MT278: Linear Programming – 2017/2018

Tutorial 3 – Simplex method

1. Convert the following LP problem into standard form:

max z = 3x1 + x2
s.t. x1 ≥3
x 1 + x2 ≤ 4
2x1 − x2 = 3
x1 , x2 ≥ 0

2. Widgetco produces two products: 1 and 2. Each requires the amounts of raw
material and labor, and sells for the price given in Table below. Up to 350 units of
raw material can be purchased at $2 per unit, while up to 400 hours of labor can
be purchased at $1.50 per hour. To maximize profit, Widgetco must solve the LP
problem. Formulate the LPP and using the simplex algorithm

Product 1 Product 2
Raw material 1 unit 2 units
Labor 2 hours 1 hour
Sales price $7 $8

demonstrate the correspondence between corner points and basic feasible solutions.

3. Consider the following LP problem

max z = 16x1 + 15x2

s.t. 40x1 + 31x2 ≤ 124
−x1 + x2 ≤1
x1 ≤3
x1 , x2 ≥ 0

(a) Solve the problem by using the simplex method, where the entering variable is
nonbasic variable with the most negative z-row coefficient.
(b) Resolve the problem with Simplex algorithm, always selecting the entering
variable as the nonbasic variable with the least negative z-row coefficient.
(c) Compare the number of iterations in (a) and (b). Does the selection of entering
variable as the nonbasic variable with the most negative z-row coefficient lead
to smaller number of iterations? What conclusion can be made regarding the
optimality condition?
(d) Suppose that the sense of optimization is changed to minimization, by multi-
plying z by −1. How does this change affect the simplex iterations?