Question: Consider the following linear programming problem P : Maximize z = 6 x 1 + 4 x 2 Subject to x 1 + x 2

Consider the following linear programming problem P:

Maximize z = 6x1 + 4 x2

Subject to x1 + x2 8 (1)

2x1 -2 x2 8 (2)

x1 - x2 2 (3)

____________________________________

x1 0

x2 unconstrained in sign

Let the slack of constraint (1) and (2) be x3 and x4, respectively, and the surplus of constraint (3) be x5. Answer the following independent questions:

What is the optimal solution, if

(i) constraint (3) is removed from the formulation?

.

(ii) constraint (2) is removed from the formulation?

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!