The simplex method and unrestricted variables

DOI10.1007/BF00940811MaRDI QIDQ790709zbMATH OpenFDO

Authors Michael J. Best, Richard J. Caron

Publication date 1985

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

simplex methodLU-factorizationcomputational savingssimplex multipliersunrestricted variables

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Recommendations

• Unrestricted variables in linear programming
• Computational aspects of linear programming simplex method
• X-matrix simplex-method (an improved version)
• scientific article; zbMATH DE number 4031393
• A Variant of Karmarkar’s Linear Programming Algorithm for Problems with Some Unrestricted Variables

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• A method to increase the computational efficiency of certain quadratic programming algorithms
• Matrix augmentation and structure preservation in linearly constrained control problems

Cited in

(8)

• scientific article; zbMATH DE number 1775150 (Why is no real title available?)
• On geometric programming and complementary slackness
• On the solution of linear programming problems with free (unrestricted) variables
• The simplex method is not always well behaved
• Unrestricted variables in linear programming
• X-matrix simplex-method (an improved version)
• Linearly constrained global optimization: a general solution algorithm with applications.
• scientific article; zbMATH DE number 4031393 (Why is no real title available?)

This page was built for publication: The simplex method and unrestricted variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790709)