-
Infeasible in nonc-convex model Answered -1 votes 1 comment -
Using -1 for lazy value gives wrong result Answered 0 votes 1 comment -
Incumbent while using MIPSOL Answered 0 votes 4 comments -
Fixed-Charge Network Flow Problem Answered 0 votes 12 comments -
Settting parameter of MIP Focus 1 for facility location allocation problem Answered 0 votes 5 comments -
How can I select the candidate interested in the solution pool? Answered 0 votes 5 comments -
Gurobi v11 outperforms Gurobi v12 for some models Answered 0 votes 2 comments -
False positive on second-order cone feasibility problem Answered 0 votes 2 comments -
numeric issue Awaiting user input 0 votes 1 comment -
Long Time Spend in Model Construction Answered 0 votes 6 comments -
Gurobi: Built-in Function for Bender's Decomposition? Answered 0 votes 1 comment -
Ignored lazy constraint leads to wrong solution cont. Ongoing 1 vote 4 comments -
Column generation: how to add new variables Ongoing 0 votes 4 comments -
Gurobi call function with Pandapower Answered 0 votes 1 comment -
MIP starts and multi-scenario Answered 0 votes 1 comment -
Facility layout problem 28 units Answered 0 votes 1 comment -
Dual simplex VS Barrier for Bender's feasibility cuts Awaiting user input 0 votes 4 comments -
How to accurately calculate reduced cost when generating one column in column generation? Answered 0 votes 1 comment -
Lower bound of non-convex problem not improving Answered 0 votes 3 comments -
How to ensure consistent values of .PI when the dual problem has multiple optimal solutions? Ongoing 0 votes 3 comments -
Gurobi states problem is infeasible when solution certainly exists Answered 0 votes 2 comments -
Why do the dual cost obtained by .pi seem incorrect, when the upper and lower bounds of variables are defined using "model.addVar"? Answered 0 votes 6 comments -
Hierarchical Optimization Tolerance Issue Answered 0 votes 2 comments -
Gurobi get dual problem Awaiting user input 0 votes 3 comments -
Do LP dual variables exactly match shadow prices? 0 votes 0 comments -
An empty callback function makes the solver unable to find any feasible solution Awaiting user input 0 votes 3 comments -
heuristic parameter and speed up the solving process Answered 0 votes 2 comments -
Assistance with GRB.Callback.MIPNODE for Branch and Cut in Generalized Benders Decomposition Answered 0 votes 1 comment -
Heuristic Parameter Answered 0 votes 4 comments -
How to get the result of the objective function while using a slack variable? Answered 0 votes 2 comments
Algorithms
New postHow optimization algorithms work & improving their performance