The simplex method and unrestricted variables

DOI10.1007/BF00940811zbMATH Open0534.90058MaRDI QIDQ790709FDOQ790709

Authors: Michael J. Best, Richard J. Caron 

Publication date: 1985

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

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

zbMATH Keywords

simplex methodLU-factorizationcomputational savingssimplex multipliersunrestricted variables

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Matrix augmentation and structure preservation in linearly constrained control problems
• A method to increase the computational efficiency of certain quadratic programming algorithms

Cited In (8)

• Linearly constrained global optimization: a general solution algorithm with applications.
• Unrestricted variables in linear programming
• Title not available (Why is that?)
• The simplex method is not always well behaved
• On geometric programming and complementary slackness
• Title not available (Why is that?)
• X-matrix simplex-method (an improved version)
• On the solution of linear programming problems with free (unrestricted) variables

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)