-
Can Gurobi not be able to solve a MILP problem if the objective function is formulate differently? Ongoing 0 votes 4 comments -
Lazy constraints and solution pruning Ongoing 0 votes 2 comments -
Speeding up Gurobi LP solver Ongoing 1 vote 9 comments -
Beaten by a naive method solving MILP Ongoing 0 votes 5 comments -
User cuts are not counted in the MIP log Ongoing 0 votes 4 comments -
User Cuts cut off too much (done after one cut) - Problem with Presolver Ongoing 0 votes 3 comments -
Numerical problem encountered while solving convex QCQP Ongoing 0 votes 2 comments -
Benders optimality cut for a LP subproblem with piecewise linear objective Ongoing 0 votes 2 comments -
Why is Gurobi returning MIP solution with gap of 0 which is not close to the actual optimal solution? Ongoing 0 votes 17 comments -
Potential Numerical Bug in MIP Solving Ongoing 0 votes 1 comment -
Column generation: how to add new variables Ongoing 0 votes 4 comments -
Ignored lazy constraint leads to wrong solution cont. Ongoing 1 vote 4 comments -
How to ensure consistent values of .PI when the dual problem has multiple optimal solutions? Ongoing 0 votes 3 comments -
Inquiry Regarding Gurobi's Recent Improvements in Network Simplex Algorithm Ongoing 0 votes 3 comments -
Barrier Method and Crossover in Large-Scale LP Solving Ongoing 0 votes 4 comments -
Opportunity for lazy cut Ongoing 0 votes 3 comments -
Optimizing partial warm start mip solution Ongoing 1 vote 5 comments -
Out of memory error while running a large MIP problem Ongoing 0 votes 5 comments -
A lazy constraint and MIP optimality issue Ongoing 0 votes 1 comment -
Gurobi worsen the coefficient ranges while it handles non-convex quadratic constraints and cause numerical issue Ongoing 0 votes 2 comments -
List of cutting plane techniques implemented by Gurobi Ongoing 0 votes 3 comments -
Question about Fluctuations in Bounds with Benders Decomposition and Callback Ongoing 0 votes 2 comments -
Gurobi Stuck After Solving Problem Ongoing 1 vote 2 comments -
Initial feasible solution for Linear Optimization Ongoing 0 votes 1 comment -
How to interpret IntFeasTol ? Ongoing 0 votes 7 comments -
Gurobi stuck in root node. Ongoing 0 votes 1 comment -
Is it possible to get the exact solution of a large-scale convex quadratic programming problem (quadratic objective, linear inequality constraints)? Ongoing 0 votes 2 comments -
Gurobi gets stuck Ongoing 1 vote 9 comments -
Can't get the result of optimization problem in an acceptable time(more than 10 hours). Ongoing 0 votes 2 comments -
Check heuristics for each solution Ongoing 0 votes 5 comments
Algorithms
New postHow optimization algorithms work & improving their performance