Linear Programming

Suppose we are modeling an operation that requires us to find values of 5 decision variables as simply as we possibly can with the least number of inequalities and constraints. How many inequalities and how many constraints do we need to model this problem in LP?  Why?

Posted in Uncategorized