Student Name: …

Student ID: …

DETERMINISTIC MODELS IN OR
HOMEWORK 2 – Solving LPP using Simplex Method

Question 1 (30 marks)

Consider the following problem.
Minimize Z=5 x1 +7 x 2
Subject to
2 x1 +3 x 2 ≥ 147
3 x 1+ 4 x 2 ≥ 210
x 1+ x2 ≥ 63
x1 ≥ 0 , x2 ≥ 0
a. Solve this problem graphically and identify all the Corner Point Feasible (CPF) solutions.

b. Solve this problem by using the simplex method in tabular form.

Student Name: …
Student ID: …
Student Name: …
Student ID: …

Question 2 (30 marks)

Consider the following problem.
Maximize Z=5 x1 +9 x 2 +7 x 3
Subject to
x 1+ 3 x 2 +2 x3 ≤ 10
3 x 1+ 4 x 2+ 2 x 3 ≤12
2 x1 + x 2 +2 x3 ≤ 8
x1 ≥ 0 , x2 ≥ 0 , x3 ≥ 0
Work through the simplex method step by step in tabular form.
Student Name: …
Student ID: …

Question 3 (40 marks)

Consider the following problem.
Minimize Z=2 x 1 +3 x 2+ x 3
Subject to
x 1+ 4 x 2 +2 x 3 ≥ 8
3 x 1+2 x 2 ≥ 6
x1 ≥ 0 , x2 ≥ 0 , x3 ≥ 0
a. Using the Big M method, work through the simplex method step by step to solve the
problem.
Student Name: …
Student ID: …

b. Using the two-phase method, work through the simplex method step by step to solve the
problem.

Additional exercise for practice:

Student Name: …
Student ID: …
Question 4:

Consider the following problem.

Minimize Z=3 x1 +2 x 2+ 4 x 3
Subject to
2 x1 + x 2 +3 x3 =60
3 x 1+3 x 2 +5 x3 ≥ 120
x1 ≥ 0 , x2 ≥ 0 , x3 ≥ 0
a. Using the Big M method, work through the simplex method to solve the problem.

b. Using the two-phase method, work through the simplex method step by step to solve the
problem.
Student Name: …
Student ID: …

Question 5:

Consider the following problem.

Maximize Z=4 x 1 +3 x 2+ 6 x3
Subject to
3 x 1+ x 2 +3 x 3 ≤ 30
2 x1 +2 x 2+ 3 x 3 ≤ 40
x1 ≥ 0 , x2 ≥ 0 , x3 ≥ 0
Work through the simplex method (in tabular form) step by step to solve the following problem.
Student Name: …
Student ID: …

Question 6:

Consider the following problem.

Maximize Z=5 x1 + x 2 +3 x3 + 4 x 4
Subject to
x 1−2 x2 + 4 x 3+ 3 x 4 ≤ 20
−4 x 1+6 x 2 +5 x 3−4 x 4 ≤ 40
2 x1 −3 x 2 +33 +8 x 4 ≤ 50
x1 ≥ 0 , x2 ≥ 0 , x3 ≥ 0 , x4 ≥ 0
Work through the simplex method step by step to demonstrate that Z is unbounded.
Student Name: …
Student ID: …

Question 7:

Consider the following problem.

Maximize Z=2 x 1 +5 x 2+3 x 3
Subject to
x 1−2 x2 + x 3 ≥20
2 x1 + 4 x 2+ x 3 =50
x1 ≥ 0 , x2 ≥ 0 , x3 ≥ 0
a. Using the Big M method, construct the complete first simplex tableau for the simplex
method
Student Name: …
Student ID: …

b. Work through the simplex method step by step to solve the problem.

c. Using the two-phase method, construct the complete first simplex tableau for phase 1
Student Name: …
Student ID: …
d. Work through phase 1 step by step.

e. Construct the complete first simplex tableau for phase 2.

f. Work through phase 2 step by step to solve the problem.