Answers are grounded in this paper and cite their sources.
We study a generic minimization problem with separable nonconvex piecewise linear costs, showing that the linear programming (LP) relaxation of three textbook mixed-integer programming formulations each approximates the cost function by its lower convex envelope. We also show a relationship between this result and classical Lagrangian duality theory.
No takes yet. Share an insight, caveat, or question.
Croxton et al. (2003) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: