Algorithms
New postHow optimization algorithms work & improving their performance
Show all
Sort by newest post
-
Warm start in callback to improve solution0 votes 0 comments
-
Bound update rule0 votes 2 comments
-
Lagrangian Relaxation bound greater than optimal solution0 votes 1 comment
-
Objective function tolerance0 votes 2 comments
-
Feasible heuristic solution?0 votes 1 comment
-
Reliable Results ?1 vote 3 comments
-
Branching Priority for nonconvex MIQCP0 votes 1 comment
-
Very slow MIP solving for small problem, how to speed up?0 votes 1 comment
-
Optimization0 votes 1 comment
-
If solver hits time limit, is a solution output?0 votes 3 comments
-
Stochastic programming0 votes 1 comment
-
Barrier: Inflated problem iterates and solves much faster0 votes 2 comments
-
Model contains large quadratic objective coefficient range.2 votes 6 comments
-
What does Gurobi do for different values of the NumericFocus parameter?0 votes 1 comment
-
Always Global Solutions?0 votes 1 comment
-
Dealing with 'Sub-optimal termination' in Barrier Method1 vote 1 comment
-
Tolerance and constraint parameters2 votes 3 comments
-
What solution wll GUROBI return when solving an unbounded MILP?1 vote 0 comments
-
Time limit on a parallel solve0 votes 1 comment
-
MIP solution process - updating the incumbent objective value0 votes 1 comment
-
No solution found when using an objective function1 vote 5 comments
-
meaning of "minrelax" in function "feasRelax"0 votes 1 comment
-
Distributed MIP logging & ramp-up question1 vote 0 comments
-
Heuristic used for set covering0 votes 0 comments
-
MIP Start and callback0 votes 0 comments
-
Does the order affect LP performance0 votes 1 comment
-
Why the gap is so big?0 votes 1 comment