Question: C. Assorted LP Questions As above, just type the value. Do not type dollar signs, spaces, decimals, or other characters. a. Consider a 2-variable LP

C. Assorted LP Questions As above, just type the

C. Assorted LP Questions As above, just type the value. Do not type dollar signs, spaces, decimals, or other characters. a. Consider a 2-variable LP that has an optimal solution. What is the minimum number of binding constraints it must have? b. If a cost minimization LP has multiple optimal solutions, and one of those optimal solutions has a cost of 150, what is the smallest cost we could see on a different optimal solution? c. Consider a 2-variable LP with a bounded feasible region. What is the smallest number of constraints possible (including the non-negativity constraints)? d. Consider a transportation LP with 4 "from" locations and 4 "to" locations. What is the minimum number of constraints (including non-negativity constraints) that such a model could have

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!