-
Questions on Gurobi's algorithm 0 votes 2 comments -
Cannot find feasible solution Answered 0 votes 2 comments -
How to test the performance of an optimal solution on different scenarios? 0 votes 4 comments -
Different results using different stopping criteria Answered 0 votes 2 comments -
Does Gurobi 9.0 guarantee global optimality for MICQP? Ongoing 1 vote 5 comments -
Lazy Constraints and Re-optimization Ongoing 1 vote 3 comments -
Duality of MILP Answered 0 votes 2 comments -
Presolve Parameter Tuning Answered 0 votes 2 comments -
Performance difference of two formulations Answered 0 votes 2 comments -
Cutting planes 0 votes 3 comments -
LP with Barrier (Method=2) and crossover disabled (i.e., Crossover=0) still stuck in crossover 0 votes 2 comments -
AMPL GURUBI bestbound Answered 0 votes 4 comments -
Turn off Gurobi internal cut only at root node Answered 0 votes 2 comments -
How does the Gurobi "Model.computeIIS()" work 0 votes 1 comment -
Lazy constraints not working? 0 votes 6 comments -
Why is Gurobi is not fully exploiting the sparsity and structure of the sparse QP problem? 0 votes 3 comments -
How does Gurobi handle binary variables in Mixed Integer (Binary) Linear Program? 0 votes 1 comment -
Barrier algorithm; what kind of matrices can it handle the best (sparse or dense, large or small problems)? 0 votes 3 comments -
Is Parallel exploration of tree for MIP concurrent with callback execution? Answered 0 votes 4 comments -
How does Gurobi determine whether a MIQCQP problem is feasible or not Answered 0 votes 4 comments -
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
Algorithms
New postHow optimization algorithms work & improving their performance