As in the text, a general linear programming problem may have ">=" constraints (other than those requiring

the variables to be non-negative) and may require us to minimize a constraint. On this sheet we consider a
non-standard maximization problem. For a minimization problem, go to the next sheet.

Maximize p = 2x + y subject to
x + y >= 35
x + 2y <= 60
2x + y >= 60
x <= 25
x >= 0, y >= 0
Setting Up the Initial Tableau
Using the text, we introduce slack and surplus variables to obtain the following system
x+y -s = 35 we subtracted a surplus variable
x + 2y +t = 60 we added a slack variable
2x + y -u = 60 we subtracted a surplus variable
x +v = 25 we subtracted a surplus variable
-2x - y +p =0
Now Enter this in matrix form by filling in the blank entries below to get the first tableau.
As in the text, star all rows whose corresponding basic solution is negative.

x y s t u v
y 0 2 0 1 0 -1
u 0 0 0 1 2 3
s 0 0 2 1 0 1
x 1 0 0 0 0 1
p 0 0 0 1 0 3

y = 17.5
u = 7.5 Basic Solution
s = 7.5 (All variables not on this list are zero)
x = 25
p = 67.5

Since there are starred rows (negative basic solutions) we must first do Phase 1.

1. As in the text, select the largest positive element in the first starred row. Its column (Column B)
is the pivot column. Then compute the test ratios, and highlight the pivot.

2. Now picot on the highlighted element by pressing "Pivot on Selection".

and pivot on that cell by pressing "Pivot on Selection"

3. Repeat steps 1 and 2 until there are no more starred rows (negative values in the basic solutoin).
Then go to Phase 2.

Phase 2
This is the same as the simplex method for standard maximization problems:
Select the column over the entry in the bottom row with the largest negtive number (excluding the Asnwer co
and use that column as the pivot column until no negative numbers remain in the bottom row (with the possi
exception of the Answer column).
er than those requiring
s sheet we consider a

p Ans
0 35
0 15
0 15
0 25
2 135

ow. Its column (Column B)

values in the basic solutoin).

tive number (excluding the Asnwer column)

main in the bottom row (with the possible
 x
2 y 0
2 t 0
2 s 0
1 x 1
2 p 0
y s t u v p Ans
1 0 0 -1 -2 0 10
0 0 1 2 3 0 15
0 1 0 -1 -1 0 0
0 0 0 0 1 0 25
0 0 0 -1 0 1 60
-1
1
-1
1
v
c
f
g
Solving minimization problems

To solve a minimzation problem, we first convert it into a maximization problem by replacing the objective by its negative
and then follow the procedure shown in the "Maximization problem" worksheet.
Converting a minimization problem to a maximization problem
Here is an example, based on Example 3 in the text.

Minimization Problem Maximization Problem

Minimize c = 2000x + 3000y subject to Maximize p = -2000x - 3000y subject to
20x + 10y >= 200 20x + 10y >= 200
25x + 50y >= 500 25x + 50y >= 500
18x + 24y >= 300 18x + 24y >= 300
x >= 0, y >= 0 x >= 0, y >= 0

Setting Up the Initial Tableau

Now we set up the initial tableau for the associated maximizatoin problem, and solve it as in the previous worksheet.
20x + 10y -s = 200 we subtracted a surplus variable
25x + 50y -t = 500 we subtracted a surplus variable
18x + 24y -u = 300 we subtracted a surplus variable
2000x + 3000y +p =0 note that the signs of the obtjective revert back to the original ones

Now Enter this in matrix form by filling in the blank entries below to get the first tableau.
Then proceed with the simplex method as usual, following Phases 1 and 2 (as in the previous worksheet).

x y s t u p

Basic Solution (All variables not on this list are zero)

0 = 0
0 = 0
0 = 0
0 = 0 c = 0

Value of maximized objective Value of minimized (original) objective

placing the objective by its negative

2000x - 3000y subject to

it as in the previous worksheet.

ective revert back to the original ones

revious worksheet).

Ans
 x
150 x 150
300 y 0
2 t 0
3 p 0
1

1
=
5
160
-4800
y s t u p Ans
0 -12 0 5 0 900
150 9 0 -10 0 1200
0 2 2 -5 0 100
0 -60 0 400 3 -108000
-1
-4
2