How optimization algorithms work & improving their performance

Tolerance and constraint parameters Answered
2 votes 3 comments
Theory about the algorithms Answered
2 votes 2 comments
How Gurobi compute IIS for MIP problem? Answered
1 vote 5 comments
Solver behaviour when giving fixed variable a start value Answered
1 vote 1 comment
How do I specify the algorithm used to solve my model in pyomo? Answered
1 vote 1 comment
Unable to find sub-optimal solution Answered
1 vote 3 comments
Optimization time: local machine vs computer cluster Answered
1 vote 1 comment
Worse performance for smaller problem Answered
1 vote 4 comments
Astronomically low node throughput; major degeneracy? Answered
1 vote 2 comments
the time Answered
1 vote 1 comment
Providing integer start solution drastically increases root relaxation computation time Answered
1 vote 7 comments
Lift and project cut Answered
1 vote 2 comments
Is it possible to use different time limits for each hierarchy when using lexicographic optimization?. Answered
1 vote 3 comments
Cannot find feasible solution and programm killed after a long time Answered
1 vote 4 comments
Reliable Results ? Answered
1 vote 3 comments
Dealing with 'Sub-optimal termination' in Barrier Method Answered
1 vote 1 comment
No solution found when using an objective function Answered
1 vote 5 comments
Cut loop at root node of MIP Answered
1 vote 6 comments
Order of variables & constraints vs. performance Answered
1 vote 3 comments
Adding multiple cuts in a single node (branch-and-cut algorithm) Answered
1 vote 1 comment
Will Gurobi retain lazy cuts after changing the objective coefficients? Answered
1 vote 4 comments
How to terminate once barrier solves problem Answered
1 vote 1 comment
Branch and price example Answered
1 vote 12 comments
Speed up gurobi to solve an milp Answered
1 vote 13 comments
Lagrangian Relaxation Answered
0 votes 4 comments
What algorithm is used for my optimization? Answered
0 votes 1 comment
Difference between nested quicksum and several quicksums Answered
0 votes 5 comments
How was upper bound generated for non-linear, non-convex maximization optimization model? Answered
0 votes 3 comments