Relationships among linear formulations of separable convex piecewise linear programs

Abstract

This paper considers four equivalent methods to linearize separable convex piecewise linear programming problems. These methods lead to different linear programming formulations which are necessarily equivalent in the sense that they imply the same optimal solutions. It is shown that the exact relationships among them can be established through the application of the decomposition principle of Dantzig and Wolfe.