Abstract

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 computerbased mathematical programming systems. Key theorems are proved that demonstrate the role of free variables in an optimal solution.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call