Croxton, Keely L.; Gendron, Bernard; Magnanti, Thomas L. - In: Management Science 49 (2003) 9, pp. 1268-1273
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...