# Robert Hildebrand

• Total activity 24
• Last activity
• Member since
• Following 0 users
• Followed by 0 users
• Subscriptions 6

## Activity overview

Latest activity by Robert Hildebrand
• Robert Hildebrand commented,

I see.  I can write it by using  m.Params.logfile = "myfile.log"

• Robert Hildebrand commented,

I updated to Gurobi 9.5.2, but I am getting the same error with writing the log file: I can run  m.write("myfile.sol")m.write("myfile.lp")m.write("myfile.log") But then I get the error GurobiError:...

• Robert Hildebrand commented,

• Robert Hildebrand commented,

A sensitivity analysis package in the GUROBI TOOLs github hub would be a fantastic thing to add!  This would make teaching introductory courses with gurobi much easier. Perhaps also a function to d...

• Robert Hildebrand commented,

Is there a python version of  GRBBinvRowi?  https://www.gurobi.com/documentation/7.5/refman/c_grbbinvrowi.html This is what I want to get access to.   I suppose, if not, I could the B^{-1} matrix b...

• Robert Hildebrand commented,

1. Thanks.  I didn't know that you could access the presolved model.  That's exciting.   2. Then the question is, if we solve the LP relaxation, is there a way to look at the tabluea.  That is,    ...

• Robert Hildebrand commented,

If you're on a windows computer, you need to execute the setup.py file using the python located in your anaconda distribution.   Here are my instructions for installing gurobi/anaconda:   Installin...

• Robert Hildebrand commented,

Yeah, MIPFocus =1 doesn't do anything.  The starting solution that I feed it is probably optimal. Sure, I'll try making these lazy constraints.  I'll also try a Lagrangian Relaxation to see if th...

• Robert Hildebrand commented,

The complicating constraints are actually flow constraints: m.addConstrs(( sum(F[e[0],e[1],j] for e in H.in_edges(i)) - sum(F[a[0],a[1],j] for a in H.out_edges(i)) == X[i,j] for i in V for j in V i...

• Robert Hildebrand commented,

(That last log is from the original model) I'm surprised that it gets stuck on 3.61 as the best bound that it can find.