Skip to main content
SpringerLink
Log in

Piecewise-linear programming: The compact (CPLP) algorithm

  • Published:
Mathematical Programming Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. N.N. Abdelmalek, “An efficient method for the discrete linearL 1 approximation problem,”Mathematics of Computation 29 (1975) 844–850.

    Article  MATH  MathSciNet  Google Scholar 

  2. J. Barrodale and F.D.K. Roberts, “An improved algorithm for discretel 1 linear approximation,”SIAM Journal on Numerical Analysis 10 (1973) 839–848.

    Article  MATH  MathSciNet  Google Scholar 

  3. R.H. Bartels, A.R. Conn and J.W. Sinclair, “Minimization techniques for piecewise differentiable functions: thel 1 solution to an overdetermined linear system”,SIAM Journal on Numerical Analysis 15 (1978) 224–241.

    Article  MATH  MathSciNet  Google Scholar 

  4. A. Bobbio and A. Premoli, “A nonlinear integer algorithm for optimal reliability allocation,”Proceedings of the 1980 IEEE International Conference on Circuits and Computers (Port Chester, NY, October 1–3, 1980) pp. 1142–1145.

  5. A. Charnes and W.W. Cooper,Management Models and Industrial Applications of Linear Programming, (John Wiley & Sons, New York, 1961).

    MATH  Google Scholar 

  6. A.R. Conn. “Linear programming via a nondifferentiable penalty function,”SIAM Journal on Numerical Analysis 13 (1976) 145–154.

    Article  MATH  MathSciNet  Google Scholar 

  7. G.B. DantzigLinear Programming and Extensions (Princeton University Press, Princeton, NJ, 1963).

    MATH  Google Scholar 

  8. M. Davies, “Linear approximation usign the criterion of least total deviations”,Journal of the Royal Statistical Society (Series B) 29 (1967) 101–109.

    Google Scholar 

  9. R. Fourer, “Notes on semi-linear programming,” Draft report, Department of Industrial Engineering and Management Science, Northwestern University (Evanston, IL, 1981).

    Google Scholar 

  10. R. Fourer, “Piecewise-linear programming,” Draft report, Department of Industrial Engineering and Management Science, Northwestern University (Evanston, IL, 1983).

    Google Scholar 

  11. R. Fourer, “A simplex algorithm for piecewise-linear programming, I: Derivation and proof,”Mathematical Programming 33 (1985) 204–233.

    Article  MATH  MathSciNet  Google Scholar 

  12. R. Fourer, “A simplex algorithm for piecewise-linear programming, II: Finiteness, feasibility, and degeneracy,” Technical Report 85-03, Department of Industrial Engineering and Management Sciences, Northwestern University, (Evanston, IL, 1985).

    Google Scholar 

  13. E.G. Goldstein, “A certain class of nonlinear extremum problems,”Doklady Akademii nauk SSSR 133; translated inSoviet Mathematics, 1 (1960) 863–866.

    Google Scholar 

  14. J.K. Ho, “Relationships among linear formulation of separatble convex piecewise linear programs,”Mathematical Programming Studies 24 (1985) 121–140.

    Google Scholar 

  15. B.A. Murtagh,Advanced Linear Programming (McGraw-Hill, New York, 1981).

    MATH  Google Scholar 

  16. A. Orden and V. Nalbandian, “A bidirectional simplex algorithm,”Journal of the Association for Computing Machinery 15 (1968) 221–235.

    Google Scholar 

  17. R.T. Rockafellar, “Monotropic programming: descent algorithms and duality,” in O.L. Mangasarian, R.R. Meyer and S.M. Robinson eds.,Nonlinear Programming 4 (Academic Press, New York, 1981) pp. 327–366.

    Google Scholar 

  18. R.T. Rockafellar,Network Flows and Monotropic Optimization (Wiley-Interscience, New York, 1984).

    MATH  Google Scholar 

  19. H.M. Salkin,Integer Programming (Addison-Wesley, Reading, MA, 1975).

    MATH  Google Scholar 

  20. R.D. Snyder, “Programming with piecewise linear objective functions,” Working Paper 9/81, Department of Econometrics and Operations Research, Monash University (Clayton, Victoria, Australia, 1981).

    Google Scholar 

  21. R.D. Snyder, “Linear programming with special ordered sets,”Journal of the Operational Research Society 35 (1984) 69–74.

    Article  MATH  MathSciNet  Google Scholar 

  22. K. Spyropoulos, E. Kiountouzis, and A. Young, “Discrete approximation in theL I norm,”The Computer Journal 16 (1973) 180–186.

    Article  MathSciNet  Google Scholar 

  23. H.M. Wagner,Principles of Operations Research (Prentice-Hall, Englewood Cliffs, NJ, 1969).

    MATH  Google Scholar 

  24. P. Wolfe, “The composite simplex algorithm,”SIAM Review 7 (1965) 42–54.

    Article  MATH  MathSciNet  Google Scholar 

  25. S. Zionts,Linear and Integer Programming (Prentice-Hall, Englewood Cliffs, NJ, 1974).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto Elettrotecnico Nazionale “Galileo Ferraris”, I 10135, Torino, Italy

    Amedeo Premoli

Authors
  1. Amedeo Premoli
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Premoli, A. Piecewise-linear programming: The compact (CPLP) algorithm. Mathematical Programming 36, 210–227 (1986). https://doi.org/10.1007/BF02592026

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02592026

Key words

Search

Navigation