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 on

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

 cing the objective by its negative

000x - 3000y subject to

as in the previous worksheet.

ective revert back to the original ones

vious 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