MTL103: Tutorial Sheet-II

Graphical Method & Basic Feasible Solution

1. Solve the following LPPs graphically:

(1) Max z = 2x1 + x2

subject to
2x1 + x2 ≤ 4
−x1 + x2 ≥ 1
x1 , x2 ≥ 0.

(2) Max z = 2x1 + x2

subject to
x1 + x2 ≥1
−x1 + x2 ≥ 1
x1 , x2 ≥ 0.

(3) Max z = 2x1 + 4x2

subject to
3x1 + 5x2 ≤ 15
3x1 + 2x2 ≤ 12
x1 , x2 ≥ 0.

(4) Min z = x1 − 10x2

subject to
x1 − 5x2 ≥ 0
−x1 + 5x2 ≤ 5
x1 , x2 ≥ 0.

(5) Min z = x1 − 10x2

subject to
x1 − 5x2 ≥ 0
−x1 + 5x2 ≤ 5
x1 , x2 ≥ 0.

(6) Max z = 2x1 + 5x2

subject to
x1 + 2x2 ≤ 20
x1 + x2 ≤ 15
x2 ≤ 6
x1 , x2 ≥ 0.

1
 (7) Max z = x1 + 2x2
subject to
x1 + x2 + x3 = 8
2x1 + x2 + x4 = 10
x1 , x2 , x3 , x4 ≥ 0.

(8) Max z = 6x1 − 2x2

subject to
x1 − x 2 ≤ 1
2x1 − x2 ≤ 6
x1 , x2 ≥ 0.

(9) Max z = 6x1 − 2x2

subject to
2x1 − x2 ≤ 2
x1 ≤ 4
x1 , x2 ≥ 0.

(10) Max z = x1 − 2x2

subject to
x1 + x2 ≥ 2
−x1 + x2 ≥ 1
x2 ≤ 3
x1 , x2 ≥ 0.

2. Solve the problem graphically:

Minimize 4x1 − 3x2
s.t 2x1 + x2 + x3 = 10
x1 + x2 + x4 = 7
2x1 + 3x2 − x5 = 12
xi ≥ 0, i = 1, ..., 5

3. Find all basic solutions of the following system of linear equations

(a) x1 + 2x2 + 3x3 + 4x4 = 7 (b) 8x1 + 6x2 + 12x3 + x4 + x5 = 6
2x1 + x2 + x3 + 2x4 = 3 9x1 + x2 + 2x3 + 6x4 + 10x5 = 11
x1 , x2 , x3 , x4 ≥ 0 x1 , x2 , x3 , x4 , x5 ≥ 0

4. Determine all degenerate and non-degenerate basic feasible solutions of the system
graphically

2x + 3y ≤ 21, 3x − y ≤ 15, x + y ≥ 5, y ≤ 5, ; x, y ≥ 0.

5. Identify the basic feasible solutions for the system

x1 + 4x2 + x3 = 8
x1 + 2x2 + x4 = 4
x1 , x 2 , x 3 , x 4 ≥ 0

2
6. Find all degenerate b.f.s of the system

x 1 + x2 + x3 = 3
x1 − x2 + x4 = 0
x1 , x2 , x3 , x4 ≥ 0.

7. Consider the standard form polyhedron P = {x ∈ Rn | Ax = b, x ≥ 0}, and assume

that the rows of m × n matrix A are linearly independent.

• Suppose that two different bases lead to the same basic solution. Show that the
basic solution is degenerate.
• Consider a degenerate basic solution. Is it true that it corresponds to two or more
distinct bases? Prove or give a counter example.
• Suppose that a basic solution is degenerate. Is it true that there exists an adjacent
basic solution which is degenerate? Prove or give a counter example.
• Let x be an element of P that has exactly m positive components. Is it true that
x is a basic feasible solution? Prove or give a counter example.

8. Find the degenerate basic feasible solutions for each polyhedron given below:

x1 + 4x2 ≤ 8; x1 + 2x2 ≤ 4, x1 + x2 ≤ 3; −x1 + x2 ≤ 0,

(a) (b)
x1 , x2 ≥ 0. x1 , x2 ≥ 0.

Is degeneracy depend on the representation of polyhedron?