Unrestricted variables in linear programming

DOI10.1007/BF00940691MaRDI QIDQ915645zbMATH OpenOpenAlexFDO

Authors Martin Schechter

Publication date 1991

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

Full work available at URL https://doi.org/10.1007/bf00940691

zbMATH Keywords

extreme pointsunrestricted variables

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• On the solution of linear programming problems with free (unrestricted) variables
• The simplex method and unrestricted variables
• Unconstrained convex programming approach to linear programming
• scientific article; zbMATH DE number 1322750
• Solving linear programming with constraints unknown
• A Variant of Karmarkar’s Linear Programming Algorithm for Problems with Some Unrestricted Variables
• Linear programming bounds
• An unconstrained convex programming view of linear programming
• scientific article; zbMATH DE number 1069803

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3552183 (Why is no real title available?)
• Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
• Finding all vertices of a convex polyhedron

Cited in

(5)

• The simplex method and unrestricted variables
• On the solution of linear programming problems with free (unrestricted) variables
• scientific article; zbMATH DE number 4031393 (Why is no real title available?)
• A linear programming-based algorithm for the signed separation of (non-smooth) convex bodies
• scientific article; zbMATH DE number 4137527 (Why is no real title available?)

This page was built for publication: Unrestricted variables in linear programming

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