MODULE-2 ASSIGNMENT-2

Consider the LP problem: Maximize 7X1 + 6X2 subject to X1 + X2 ≤ 4; 2X1 + X2 ≤ 6, X1, X2 ≥ 0.

Solve by algebraic method and answer the following:
1. The number of basic solutions is _______ (6)
2. The number of basic feasible solutions is _______ (4)
3. If we solve for X1 and X3 as basic and the other variables as non basic, the value of X2
is __________ (0)
4. If we solve for X2 and X3 as basic and the other variables as non basic, the value of X3
is __________ (-2)

There are 4 variables and 2 constraints. There are 4C2 = 6 basic solutions.
The four corner points (0, 0), (3, 0), (0, 4) and (2, 2) are the four basic feasible solutions.
When we solve for X1 and X3, X2 is non basic and has value zero.
We solve for X2 and X3. The equations are X2 + X3 = 4 and X2 = 6. This gives X3 = -2

Consider the LP problem: Maximize 7X1 + 6X2 + 4X3 subject to X1 + X2 + X3 ≤ 5; 2X1 + X2 + 3X3
≤ 10, X1, X2, X3 ≥ 0. Solve by algebraic method and answer the following:
5. The number of basic solutions is _______ (10)
6. The number of basic infeasible solutions is _______ (2)
7. If we solve for X2 and X3 as basic and the other variables as non basic, the value of X3
is __________ (5/2 or 2.5)
8. The number of unique basic feasible solutions is __________ (5)
9. The optimum solution has X1 = _______ (5)
10. The value of the objective function at optimum is ________ (35)

There are 2 constraints resulting in two slack variables. The number of variables is 5 and the
number of constraints is 2. There are 5C2 = 10 basic solutions.
The ten basic solutions are X1 = 5, X2 = 0; X1 = 5, X3 = 0; X1 = 5, X4 = 0; X1 = 5, X5 = 0; X2 = 5/2,
X3 = 5/2; X2 = 10, X4 = -5; X2 = 5, X5 = 5; X3 = 10/3, X4 = 5/3; X3 = 5, X5 = - 5 and X4 = 5, X5 = 10;
Out of these two are infeasible.
When we solve for X2 and X3, the solution is X2 = 5/2, X3 = 5/2.
Out of the 8 basic feasible solutions, five are unique. Three solutions repeat.
The optimum solution is when X1 = 5 and Z = 35

Consider the LP problem: Minimize 6X1 + 5X2 subject to X1 + X2 ≥ 3; 2X1 + X2 ≥ 5, X1, X2 ≥ 0.

Solve by algebraic method and answer the following:
11. The number of basic solutions is _______ (6)
MOOC-NPTEL: Introduction to Operations Research
Jan-Feb 2015
 12. The number of basic feasible solutions is _______ (3)
13. If we solve for X1 and X3 as basic and the other variables as non basic, the value of X1
is __________ (5/2 or 2.5)
14. The optimum solution has X1 = ______ (2)
15. The value of objective function at optimum is ________ (17)

There are two constraints resulting in two negative slack variables. There are 4 variables in
total and 2 constraints resulting in 4C2 = 6 basic solutions.
The six solutions are X1 = 2, X2 = 1; X1 = 5/2, X3 = -1/2; X1 = 3, X4 = 1; X2 = 5, X3 = 2; X2 = 3, X4 =
-2; X3 = -3, X4 = -5; Three solutions are basic feasible.
When we solve for X1, X3, we have the equations X1 – X3 = 3; 2X1 = 5, which gives the
solution X1 = 5/2, X3 = -1/2. The value of X1 = 5/2.
The optimum solution is X1 = 2, X2 = 1 with Z = 17.

MOOC-NPTEL: Introduction to Operations Research

Jan-Feb 2015