Abstract
A modification of the projection method for linear programming is presented. This modification determines the step direction by solving two triangular systems of linear equations. The triangular matrix is updated in each step by deleting a row and adding a new one whose elements were already computed for the step-size determination. Thus there is no real computational effort in the matrix-updating. The size of the triangular systems depends on how many of the active constraints have become active after the constraint that’s going to become inactive. In the worst case, i.e. if the oldest active constraint becomes inactive, the computational effort in solving the triangular systems corresponds to that of the matrix-updating in the projection method, whereas in all other cases the effort is reduced. This reduction can be very high. Cycling of the method is excluded by a very simple rule.
Preview
Unable to display preview. Download preview PDF.
References
M.J. Best and K. Ritter, Linear and quadratic programming, to appear.
R.G. Bland, “New finite pivoting rules for the simplex method”, CORE-research paper 7612 (1976).
G.B. Dantzig, Linear pogramming and extensions (Princetion University Press, 1963).
J.J.H. Forrest and J.A. Tomlin, “Updated triangular factors of the basis to maintain sparsity in the product form simplex method”, Mathematical Programming 2 (1972) 263–278.
S.I. Gass, Linear programming (McGraw-Hill, New York, 1969).
S. Karlin, Mathematical methods and theory in games, programming and economics, (Addison-Wesley, Reading, MA, 1962).
W. Orchard-Hays, Advanced linear programming computing techniques (McGraw-Hill, New York, 1968).
K. Ritter, “Fundamentals of linear programming”, in: M.Z. Cohn and G. Maier, eds., Engineering plasticity by mathematical programming (Pergamon Press, New York, 1979), pp 69–91.
M. Simmonard, Linear programming (Prentice-Hall, Englewood Cliffs, N.J., 1966).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 The Mathematical Programming Society
About this chapter
Cite this chapter
Bräuninger, J. (1981). Linear programming by an effective method using triangular matrices. In: König, H., Korte, B., Ritter, K. (eds) Mathematical Programming at Oberwolfach. Mathematical Programming Studies, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120918
Download citation
DOI: https://doi.org/10.1007/BFb0120918
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00805-4
Online ISBN: 978-3-642-00806-1
eBook Packages: Springer Book Archive