-
Gurobi inconsistent performance when solving the MIP problems in parallel and in sequence Answered 0 votes 2 comments -
Extract cutting planes Answered 0 votes 3 comments -
Model is "Either infeasible or unbonded" reported by Gurobi, however feasible and bounded after providing with partial initial guess Answered 0 votes 3 comments -
Can we improve solution time when integer variables are determined by continuous variables? Answered 0 votes 3 comments -
Warm start in callback to improve solution Answered 0 votes 3 comments -
Bound update rule 0 votes 3 comments -
Lagrangian Relaxation bound greater than optimal solution Ongoing 0 votes 3 comments -
Objective function tolerance Answered 0 votes 3 comments -
Feasible heuristic solution? Answered 0 votes 2 comments -
Reliable Results ? Answered 1 vote 4 comments -
Branching Priority for nonconvex MIQCP Answered 0 votes 2 comments -
Setting stop criterion to maximum one solution changes the behaviour of branch and bound 0 votes 5 comments -
Very slow MIP solving for small problem, how to speed up? 0 votes 2 comments -
Optimization Answered 0 votes 2 comments -
If solver hits time limit, is a solution output? Answered 0 votes 4 comments -
Stochastic programming Answered 0 votes 2 comments -
Barrier: Inflated problem iterates and solves much faster Answered 0 votes 3 comments -
Model contains large quadratic objective coefficient range. 2 votes 10 comments -
What does Gurobi do for different values of the NumericFocus parameter? Answered 0 votes 2 comments -
Always Global Solutions? Answered 0 votes 6 comments -
Dealing with 'Sub-optimal termination' in Barrier Method Answered 1 vote 2 comments -
Tolerance and constraint parameters Answered 2 votes 4 comments -
What solution wll GUROBI return when solving an unbounded MILP? 2 votes 1 comment -
Is it possible to enable the presolve method to utilize VarHintVal and Start values? 0 votes 1 comment -
Time limit on a parallel solve 0 votes 2 comments -
MIP solution process - updating the incumbent objective value Answered 0 votes 2 comments -
Solving LPs sequentially versus one large LP with non-interacting variables/constraints Answered 0 votes 4 comments -
No solution found when using an objective function Answered 1 vote 6 comments -
meaning of "minrelax" in function "feasRelax" Answered 0 votes 2 comments -
Distributed MIP logging & ramp-up question 3 votes 8 comments
Algorithms
New postHow optimization algorithms work & improving their performance