Originally posted by: Michi123
Good day, I would like to solve the following problem in CPLEX:
int u [1..V] [1..V] = ...;
int M = 51000;
int b [1..V] = ...; interval upper limit
int a [1..V] = ...; Interval lower bound
dvar int d [1..V];
dvar int w [1..V];
dvar int m [1..V];
dvar boolean x [1..V] [1..V];
Equation 1:
forall (i in 2..V, j in 1..V)
d [i] + u [i] [j] - (M * (1-x [i] [j])) <= d [j]
Equation 2:
forall (i in 2..V)
b [i] + m [i]> = d [i];
Equation 3:
forall (i in 2..V)
a [i] -w [i] <= d [i];
This is only a section of the whole mathematical model.
It is a Traveling Salesman Problem, which works with travel times instead of distances and to meet so-called time window.
The problem is that CPLEX simply the limits b [i] into equation 1 set, and m [i] to zero and continues to calculate. however CEPLEX should, only calculate the equation 1, and then check the equation 2 and 3, and thus then it could calculate m [i] and w [i].
m [i] and w [i] is then, namely, required for the objective function, which includes x.
Could you please tell me maybe how I can solve the problem or how to correct formula should read in CPLEX?
#CPLEXOptimizers#DecisionOptimization