Question: The following math program is provided: Min Z= -X1 +2x2 s.t. X1 +x2 = 0, x2 >=0 [1] [2] [3] [5],[6] (a) Plot the feasible

The following math program is provided: Min Z=

The following math program is provided: Min Z= -X1 +2x2 s.t. X1 +x2 = 0, x2 >=0 [1] [2] [3] [5],[6] (a) Plot the feasible region. Identify and label each CPF solution with its coordinates. And plot any two of the Z lines. (6 points) (b) Is the feasible region unbounded? (c) Which constraint(s) are redundant, if any? (d) Solve the problem graphically. Provide optimal values for the Z and the decision variables. (e) Is the optimal solution unique? (f) Is [4] binding? (g) If you add a constraint to the original math program, what could happen to the optimal Z*? [Circle Y or N for each row] (6 points) It may worsen It may remain unchanged It may improve Y Y Y ZZZ N N N (h) The removal of which constraint would create an unbounded

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!