Unanswered Questions
53 questions with no upvoted or accepted answers
9
votes
0
answers
203
views
Ill-conditioned LP in Benders decomposition
I have implemented a Benders decomposition for a constrained network flow but the LP solver (Gurobi) warns me of the ill-conditioning of the subproblem dual LP. As you can see below, the coefficients ...
- 33.1k
6
votes
0
answers
213
views
Benders decomposition for a dense MILP
I am trying to solve a large MILP, but it seems like dense problems can be very difficult for moderns solvers. I tried to solve the problem described below considering only constraints (1) and (2) ...
- 109
6
votes
0
answers
651
views
Cplex is stuck after root node relaxation solution
I am solving an MIP through Benders decomposition (coded both generic and legacy callback versions), by employing Java with Cplex 12.9. For some of the instances, Cplex is stuck for two hours (time ...
- 5,442
5
votes
0
answers
124
views
Scale of largest CPLEX/Gurobi execution
I am trying to understand the CO2 emission of large scale optimization using CPLEX or Gurobi. Is there a published literature which addresses the compute usage of large scale executions?
- 1,895
4
votes
0
answers
159
views
4
votes
0
answers
385
views
CPLEX Python: Current subproblem model in branch and bound
I have an MILP problem and use CPLEX (Python interface). I am working on user heuristics for branching in the branch-and-bound procedure. With HSCallback I managed to get the information about the ...
- 251
3
votes
0
answers
38
views
To "fix" continuous variables in Benders decomposition
In nearly all applications I have seen, the master problem variables $x$ that define the subproblem are binary.
(Logic-based) Benders decomposition can applied to a problem of the form: $$\min_{x,y} f(...
- 33.1k
3
votes
1
answer
210
views
Implementing Logic-based Benders decomposition on a single search tree
Currently, I am working on a scheduling problem and trying to approach it by the logic-based Benders decomposition method. Theoretically, I have everything, i.e., the master and sub problem(s), the ...
CommunityBot
- 1
3
votes
0
answers
101
views
cplex callbacks: getting the branching variable
I would like to obtain the number of the variable cplex branches on at the current node during B&B.
I try this by using the callback
...
- 75
2
votes
0
answers
156
views
Why the column generation algorithm remains stuck at the same solution?
I was trying to solve a MILP by a column generation algorithm, and I noticed that the algorithm was stuck at the same solution, I tried to diversify the pool of initial columns, but the problem I ...
- 429
2
votes
0
answers
107
views
Automated Benders Using Annotations
I'm trying to solve an optimization model using Automated Benders with annotations using CPLEX library in C++. I've defined a master problem and N (number of supply nodes in my model's network) ...
- 1
2
votes
0
answers
83
views
Benders with MINLP subproblem as the pricing problem of Dantzig Wolfe
I have a convex MINLP that after a Dantzig-Wolfe reformulation, passes most of the difficulty onto the pricing problem, which becomes a convex MINLP itself.
The pricing problem should be solvable with ...
- 1,895
2
votes
0
answers
67
views
Discrepancy between CPLEX interface solution and C API
I have a C API program uploaded here in Dropbox that is an LP. Here is the problem: When I compile the C file it gives me "1017 Not available for mixed-integer problems" while the problem is ...
- 5,874
2
votes
0
answers
94
views
MIP start in cplex using Java
When I am reading an "lp" file for the problem and using a MIP start reading from a "sol" file it works.
But when I pass on the same model directly to cplex (without writing lp) ...
- 5,874
2
votes
0
answers
64
views
Where is the relative gap from cplexbilp?
I am invoking cplexbilp (CPLEX 12.9) from Matlab R2022a. I request all 4 return arguments:
...
- 223