New answers tagged big-m
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\}
$$
3
votes
Accepted
Linearize piecewise function without big-M constraints
I don't see or remember a way around the big-M constraints. Thankfully they are not that hard to write. Or you may use indicator constraints which are even simpler.
We add new binary variables, and ...
2
votes
Travelling salesman problem
The MTZ constraints are big-M constraints that enforce the logical implication
$$x_{ij}=1\implies u_j\ge u_i+d_j.$$
That is, if you traverse arc $(i,j)$, the cumulative demand at $j$ is at least the ...
Top 50 recent answers are included
Related Tags
big-m × 57mixed-integer-programming × 36
linear-programming × 16
linearization × 14
modeling × 12
indicator-constraints × 10
optimization × 9
logical-constraints × 9
constraint × 8
integer-programming × 7
binary-variable × 6
combinatorial-optimization × 3
scheduling × 3
reference-request × 2
nonlinear-programming × 2
benders-decomposition × 2
python × 1
cplex × 1
solver × 1
gurobi × 1
convex-optimization × 1
pyomo × 1
vehicle-routing × 1
nonconvex-programming × 1
stochastic-programming × 1