-
Different best bounds for different python scripts that run precisely the same model for the same problem Ongoing 0 votes 4 comments -
User cuts are not counted in the MIP log Ongoing 0 votes 4 comments -
Can Gurobi not be able to solve a MILP problem if the objective function is formulate differently? Ongoing 0 votes 4 comments -
Is it possible to get the value of the Interior Solution ? Ongoing 1 vote 4 comments -
How does Gurobi recognize/solve simple stochastic programs? Ongoing 0 votes 4 comments -
How to ensure consistent values of .PI when the dual problem has multiple optimal solutions? Ongoing 0 votes 3 comments -
Opportunity for lazy cut Ongoing 0 votes 3 comments -
List of cutting plane techniques implemented by Gurobi Ongoing 0 votes 3 comments -
Inquiry Regarding Gurobi's Recent Improvements in Network Simplex Algorithm Ongoing 0 votes 3 comments -
User Cuts cut off too much (done after one cut) - Problem with Presolver Ongoing 0 votes 3 comments -
Lazy Constraints and Re-optimization Ongoing 1 vote 3 comments -
Lagrangian Relaxation bound greater than optimal solution Ongoing 0 votes 3 comments -
Gurobi worsen the coefficient ranges while it handles non-convex quadratic constraints and cause numerical issue Ongoing 0 votes 2 comments -
Question about Fluctuations in Bounds with Benders Decomposition and Callback Ongoing 0 votes 2 comments -
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 -
Can't get the result of optimization problem in an acceptable time(more than 10 hours). Ongoing 0 votes 2 comments -
Gurobi Stuck After Solving Problem Ongoing 1 vote 2 comments -
Why my model is not considered MIQCP? Ongoing 0 votes 2 comments -
Why Barrier report numerical trouble encountered even the ranges are not large? Ongoing 0 votes 2 comments -
Obtaining 0-1 Integer Solutions with Linear Programming solvers Ongoing 0 votes 2 comments -
Benders optimality cut for a LP subproblem with piecewise linear objective Ongoing 0 votes 2 comments -
Numerical problem encountered while solving convex QCQP Ongoing 0 votes 2 comments -
Lazy constraints and solution pruning Ongoing 0 votes 2 comments -
Slow MIPS Performance Ongoing 0 votes 2 comments -
Advice on Cuts and Reducing Solution Time Ongoing 1 vote 2 comments -
Added Cut in Callback Not Activated Immediately Even on Single Thread Ongoing 0 votes 2 comments -
Root simplex log takes so long Ongoing 0 votes 2 comments -
A lazy constraint and MIP optimality issue Ongoing 0 votes 1 comment -
Initial feasible solution for Linear Optimization Ongoing 0 votes 1 comment -
Gurobi stuck in root node. Ongoing 0 votes 1 comment
Algorithms
New postHow optimization algorithms work & improving their performance