Abstract
The simplex method for linear programming can be extended to permit the minimization of any convex separable piecewise-linear objective, subject to linear constraints. Part I of this paper has developed a general and direct simplex algorithm for piecewise-linear programming, under convenient assumptions that guarantee a finite number of basic solutions, existence of basic feasible solutions, and nondegeneracy of all such solutions. Part II now shows how these assumptions can be weakened so that they pose no obstacle to effective use of the piecewise-linear simplex algorithm. The theory of piecewise-linear programming is thereby extended, and numerous features of linear programming are generalized or are seen in a new light. An analysis of the algorithm's computational requirements and a survey of applications will be presented in Part III.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M.L. Balinski and R.E. Gomory, “A mutual primal-dual simplex method,” in: R.L. Graves and P. Wolfe, eds.,Recent Advances in Mathematical Programming (McGraw-Hill, New York, 1963) pp. 17–26.
R.H. Bartels, “A penalty linear programming method using reduced-gradient basis-exchange techniques,”Linear Algebra and Its Applications 29 (1980) 17–32.
R.G. Bland, “New finite pivoting rules for the simplex method,”Mathematics of Operations Research 2 (1977) 103–107.
A. Charnes and C.E. Lemke, “Minimization of non-linear separable convex functionals,”Naval Research Logistics Quarterly 1 (1954) 301–312.
V. Chvatal,Linear Programming (W.H. Freeman, New York, 1983).
A.R. Conn, “Linear programming via a nondifferentiable penalty function,”SIAM Journal on Numerical Analysis 13 (1976) 145–154.
G.B. Dantzig,Linear Programming and Extensions (Princeton University Press, Princeton, NJ, 1963).
R. Fourer, “A simplex algorithm for piecewise-linear programming I: Derivation and proof,”Mathematical Programming 33 (1985) 204–233.
R. Fourer, “A simplex algorithm for piecewise-linear programming III: Computational analysis and applications,” Technical Report 86-03, Department of Industrial Engineering and Management Sciences, Northwestern University (Evanston, IL, 1986).
E.G. Gol'šteîn, “A certain class of nonlinear extremum problems,”Doklady Akademii Nauk SSSR 133; translation inSoviet Mathematics 1 (1960) 863–866.
G.W. Graves, “A complete constructive algorithm for the general mixed linear programming problem,”Naval Research Logistics Quarterly 12 (1965) 1–34.
Luenberger, D.G.,Linear and Nonlinear Programming, 2nd edition (Addison-Wesley Publishing Company, Reading, MA, 1984).
C.E. Miller, “The simplex method for local separable programming,” in: R.L. Graves and P. Wolfe, eds.,Recent Advances in Mathematical Programming (McGraw-Hill, New York, 1963) pp. 89–100.
A. Orden and V. Nalbandian, “A bidirectional simplex algorithm,”Journal of the Association for Computing Machinery 15 (1968) 221–235.
D.C. Rarick, “Pivot row selection in the WHIZARD LP code,” Management Science Systems.
R.T. Rockafellar,Network Flows and Monotropic Optimization (Wiley-Interscience, New York, 1984).
P. Wolfe, “The composite simplex algorithm,”SIAM Review 7 (1965) 42–54.
Author information
Authors and Affiliations
Additional information
This research has been supported in part by the National Science Foundation under grant DMS-8217261.
Rights and permissions
About this article
Cite this article
Fourer, R. A simplex algorithm for piecewise-linear programming II: Finiteness, feasibility and degeneracy. Mathematical Programming 41, 281–315 (1988). https://doi.org/10.1007/BF01580769
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01580769