Piecewise-linear programming: The compact (CPLP) algorithm

A compact algorithm is presented for solving the convex piecewise-linear-programming problem, formulated by means of a separable convex piecewise-linear objective function (to be minimized) and a set of linear constraints. This algorithm consists of a finite sequence of cycles, derived from the simplex method, characteritic of linear programming, and the line search, characteristic of nonlinear programming. Both the required storage and amount of calculation are reduced with respect to the usual approach, based on a linear-programming formulation with an expanded tableau. The tableau dimensions arem×(n+1), wherem is the number of constraints andn the number of the (original) structural variables, and they do not increase with the number of breakpoints of the piecewise-linear terms constituting the objective function.

[1]  Patrick Rivett,et al.  Principles of Operations Research , 1972 .

[2]  P. Wolfe.  The Composite Simplex Algorithm , 1965 .

[3]  A. Conn.  Linear Programming via a Nondifferentiable Penalty Function , 1976 .

[4]  Harvey M. Salkin,et al.  Integer Programming , 2019, Engineering Optimization Theory and Practice.

[5]  R. Rockafellar.  MONOTROPIC PROGRAMMING: DESCENT ALGORITHMS AND DUALITY , 1981 .

[6]  Alex Orden,et al.  A Bidirectional Simplex Algorithm , 1968, JACM.

[7]  Ralph D. Snyder,et al.  Linear Programming with Special Ordered Sets , 1984 .

[8]  Nabih N. Abdelmalek.  An efficient method for the discrete linear ₁ approximation problem , 1975 .

[9]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[10]  I. Barrodale,et al.  An Improved Algorithm for Discrete $l_1 $ Linear Approximation , 1973 .

[11]  J. Ho.  Relationships among linear formulations of separable convex piecewise linear programs , 1985 .

[12]  H. C. Williams,et al.  Advanced Linear Programming , 1983, The Mathematical Gazette.

[13]  Andrew Young,et al.  Discrete Approximation in the L1 Norm , 1973, Comput. J..

[14]  Robert Fourer,et al.  A simplex algorithm for piecewise-linear programming I: Derivation and proof , 1985, Math. Program..

[15]  M. Davies.  Linear Approximation Using the Criterion of Least Total Deviations , 1967 .

[16]  A. Barrett.  Network Flows and Monotropic Optimization. , 1984 .

[17]  A. Conn,et al.  Minimization Techniques for Piecewise Differentiable Functions: The l_1 Solution to an Overdetermined Linear System , 1978 .