On the solution of linear programming problems with free (unrestricted) variables
From MaRDI portal
This paper reviews the way free (unrestricted) variables are handled in the formulation and solution of linear programming problems, and how such variables are processed in computer-based mathematical programming systems. Key theorems are proved that demonstrate the role of free variables in an optimal solution.
Recommendations
Cites work
- Applications of Linear Programming to Numerical Analysis
- scientific article; zbMATH DE number 3956805 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 3607797 (Why is no real title available?)
- scientific article; zbMATH DE number 3284358 (Why is no real title available?)
- scientific article; zbMATH DE number 3356432 (Why is no real title available?)
- Optimization problems. Translated by P. Wadsack
- Stationary Ordinal Utility and Impatience
Cited in
(3)
This page was built for publication: On the solution of linear programming problems with free (unrestricted) variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086153)