2
votes
Accepted
MIP formulation for a lower semi-continuous function
You want to maximize $\max(f(x),0)$. Assume $L \le f(x) \le U$ for constants $L$ and $U$. Maximize $g(x)$ subject to
$$
0 \le g(x) \le U y \\
0 \le g(x) - f(x) \le (0-L)(1-y) \\
y \in \{0,1\}
$$
1
vote
Accepted
How to design a constraint to control flow in a non-network optimization model
Ok, suppose production process $i1$ goes to consumption process $ i2$. You can create a map of $ i1 -> i2$ & define parameters $z_{i1,i2}$such that if $ i1 -> i2$, then $ z_{i1,i2} = 1$, $0$ ...
1
vote
Ways to improve lower bounds while solving MIPs
There are serveral strategies.
I recomend Lagrangian and Surrogate relaxation.
Look for James Davis video "2.6 lagrangian relaxation". I guess it would help.
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
mixed-integer-programming × 914optimization × 207
linear-programming × 202
modeling × 200
integer-programming × 116
linearization × 105
cplex × 74
gurobi × 66
python × 65
scheduling × 61
logical-constraints × 61
constraint × 58
combinatorial-optimization × 57
binary-variable × 50
solver × 47
vehicle-routing × 41
big-m × 36
nonlinear-programming × 34
constraint-programming × 31
indicator-constraints × 30
reference-request × 28
benders-decomposition × 28
quadratic-programming × 24
pyomo × 23
heuristics × 23