Unanswered Questions
64 questions with no upvoted or accepted answers
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
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?
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 ...
4
votes
0
answers
288
views
Linearize a highly non-linear objective function
[EDIT] : The formula below is updated to remove the radical, 0.5 in the term $(I_{i,v} \cdot \Delta t)$ and constant temperature $T$ replces temperature as function of current.
[EDIT] :The values of ...
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 ...
3
votes
0
answers
124
views
From Quadratic to MILP?
I am playing around with some Quadratic Programs (QPs), and I want to check if my reasoning is right concerning a re-modeling from QP to MILP. So, let's consider the below QP:
(QP) $\min c^T x + x^T Q ...
3
votes
0
answers
153
views
Linearize objective function with non-linear terms
I have a problem with linear constraints but in the objective function I want to have some linear terms along with a $x^2$ term. So it is like the following:
$$\min \sum \limits _i \sum \limits _j (a[...
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
...
3
votes
0
answers
91
views
Function approximation of a complex objective function
I would like to approximate the following objective function using a simpler function that can use be defined in gurobi.
\begin{equation}
\min_{I_{i,v}} \ \sum^{N_v}_{v}\sum^{TT_v}_{i} \ C_{loss,...
3
votes
0
answers
76
views
Linearization of a quadratic model, what is the difference while using gurobi?
I have a quadratic model of parking $N$ cars in $S$ separate lanes as follows. Each car has an arrival time and a departure time. Departure follow the last in first out principle. The objective is to ...
3
votes
0
answers
189
views
How to linearize a max min objective function?
Let us suppose that I have a $\max \min$ objective function that only depends on one set of variables:
$\underset{x}\max \underset{y}\min dy$
Associated with the linear set of constraints and right ...
3
votes
0
answers
91
views
Linearization of the shifted copy of a function
Suppose in a model I have the expression $y_{1}(x) = 10 + 5 x^2$ where $x \in [0,20]$ is a continuous variable. In order to be able to use an MILP solver, I piecewise linearise $z_{1} = x^2$, by ...
3
votes
0
answers
62
views
Linearisation using SOS2
I am trying to linearise the following expresssion.
$C(k) = B(k) e^{-d(k)}, B(k) \ge 0 , d(k) \ge 0 $
I am trying to do this by using SOS2 sets.
I set $X(k) = e^{-d(k)}$ and I get $C(k) = B(k) X(...
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 ...