-
Same model, same parameters, but different solutions Answered 0 votes 4 comments -
Degree-4 nonlinear constraint disaggregated to bilinear during presolve Answered 0 votes 1 comment -
How are lazy constraints used? Answered 1 vote 2 comments -
Giving an initial basis to the simplex solver results in different optimal value depending on LPWarmStart set to 1 or 2 and on the value of NumericFocus Answered 0 votes 1 comment -
Question regarding output log behaviours and branch and bound algorithms Answered 0 votes 1 comment -
Extreme matrix range [6e-11, 2e+08] in multi-stage energy system MILP — model not solving within 24 hours Answered 0 votes 3 comments -
Handling small constraint violation warnings after adding constraints and re-optimizing Answered 0 votes 3 comments -
Why Does a Bilinear Term Get Infinite Upper Bound After Presolve? Answered 0 votes 4 comments -
Will Gurobi 8.0.0 and 13.0.1 return different solutions for the same prioritizr conservation planning problem? Answered 1 vote 2 comments -
the gap in the solution of multi-period mixed integer linear programming has been stuck at around 1.7%. Is this error considered large or small, Answered 1 vote 1 comment -
Improve root relaxation performance Answered 0 votes 1 comment -
Behavior of the lazy constraints added within a callback Answered 0 votes 8 comments -
Potential Numerical Issue in MIP Solving Answered 0 votes 1 comment -
For ILP problems, does GUROBI gaurantee finding all possible solutions? Answered 1 vote 4 comments -
MIQPs | Barrier method for Method and NodeMethod parameters Answered 1 vote 2 comments -
Solution Guarantees and Best-Bound Access for Convex MINLPs in Gurobi via AMPL Answered 0 votes 1 comment -
Terminating barrier with TimeLimit provides no solution Answered 0 votes 8 comments -
Does NoRel heuristic enable smart branch and bound? Answered 0 votes 1 comment -
Stopping criteria for NoRel heuristics Answered 0 votes 1 comment -
Does callbacks affect to the selection of algorithm? Answered 1 vote 2 comments -
Different behavior of MIPNODE_OBJBND depending on LazyConstraints param Answered 0 votes 4 comments -
Quadratic Programming with Non-Convex Objective Function Answered 0 votes 1 comment -
Parallelization of distinct subproblems in Column Generation Answered 1 vote 1 comment -
Speeding up large problems Answered 1 vote 1 comment -
Why is it slower to enter MIP start than not to enter it? Answered 0 votes 1 comment -
Gurobi Effect of Abs/Max Answered 0 votes 2 comments -
Does model.cbSetSolution affect the search process? Answered 0 votes 3 comments -
Binary Integer Non Linear Programming Answered 0 votes 1 comment -
Transforming binary variables into integer variables during presolve Answered 0 votes 2 comments -
About using 'LazyConstraints' Parameter Answered 0 votes 1 comment
Algorithms
New postHow optimization algorithms work & improving their performance