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.











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)