Abstract
—Although it is very easy to solve the conditional IF
problem with a procedural programming language, it is very
difficult to solve it with mathematical programming, especially if
the argument of the IF it is an AND or an OR logical condition,
based on the variables of the Mixed Integer Liner Program
(MILP) model. In this work we propose three very elegant and
simple MILP models to solve this problem, and we show with
three examples that they are very efficient in terms of runtime
and memory usage. Next we generalize the first MILP model to
N non overlapping intervals. Finally we present the outputs of
the solution of these MILP models using the Cplex solver and
the GAMS modeling software.
problem with a procedural programming language, it is very
difficult to solve it with mathematical programming, especially if
the argument of the IF it is an AND or an OR logical condition,
based on the variables of the Mixed Integer Liner Program
(MILP) model. In this work we propose three very elegant and
simple MILP models to solve this problem, and we show with
three examples that they are very efficient in terms of runtime
and memory usage. Next we generalize the first MILP model to
N non overlapping intervals. Finally we present the outputs of
the solution of these MILP models using the Cplex solver and
the GAMS modeling software.
| Original language | English |
|---|---|
| Title of host publication | ECOMOD 2021 |
| Publication status | Published - 2021 |