Distributed MIP logging & ramp-up question

3
votes
7
comments

Model contains large quadratic objective coefficient range.

2
votes
9
comments

Tolerance and constraint parameters
Answered

2
votes
3
comments

Theory about the algorithms
Answered

2
votes
2
comments

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

Speeding up Gurobi LP solver
Ongoing

1
vote
8
comments

same LP solution multiple times in root node, user cuts ignored

1
vote
1
comment

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

Advice on Cuts and Reducing Solution Time
Ongoing

1
vote
1
comment

Implementation of Benders Decomposition with Callbacks
Ongoing

1
vote
1
comment

Is it possible to get the value of the Interior Solution ?
Ongoing

1
vote
3
comments

Lift and project cut
Answered

1
vote
2
comments

Cannot find feasible solution and programm killed after a long time
Answered

1
vote
4
comments

Does Gurobi 9.0 guarantee global optimality for MICQP?
Ongoing

1
vote
4
comments

Reliable Results ?
Answered

1
vote
3
comments

Dealing with 'Sub-optimal termination' in Barrier Method
Answered

1
vote
1
comment

What solution wll GUROBI return when solving an unbounded MILP?

1
vote
0
comments

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