SIMPLEX METHOD OF

MAXIMIZATION PROBLEMS
CONTAINING THE GREATER
THAN SYMBOL
BOY, JOVIE MAE HANAYA, ALYSSA
CAGALAWAN, LAGNAS, JAINEY
SONIA MEDALLE, NANZIE
DAGU-OB, ANN
STEFANIE NARCISO, ROSELYN
DELA CRUZ, JOHN QUIRANTE,
DESCUTIDO, IAN JALAICA
BSMA
JAY
1 – B TULMO, TRISHA
ESCATIN, REY JOY
INTRODUCTION
The preceding on maximization problems solved by the simplex
method is limited to problems containing the “less than” symbol in the
constraints.
In a maximization problem, we always add a slack variable to
convert a constraint to equation. But if the constraint has a “≥“ symbol,
we cannot transform it to equation by immediately adding a slack
variable for obvious reason. We must convert first the symbol ≥ to a ≤
symbol. This is easily done by multiplying the inequality constraint by
negative 1, then add the slack variable. In this particular case, since
the “greater than” symbol implies a value bigger than the right
member, the constraint containing the greater than symbol could not
have solution variable in (i.e. x and y) both equal to zero for obvious
reason. Hence, it is not possible for the slack variable in this particular
constraint to become negative. v
EXAMPLE
MAXIMIZE: 50x1 + 20x2
Subject to: x1 ≤ 20
x2 ≤ 30
x1 + x2 ≥ 48
x1 ≥ 0, x2 ≥ 0
SOLUTION:
Multiplying the third constraint by -1:
( x1 + x2 ≥ 48 ) (-1) gives - x1 - x2 ≤ -48
Hence the new program with slack variables will be:
MAXIMIZE: 50x1 + 20x2 + OS1 + OS2 + OS3
Subject to: x1 + S1 = 20
x2 + S2 = 30
- x1 - x2 +S3 = -48
TABLE 1
CJ 50 20 0 0 0

PROD QTY x1 x2 S1 S2 S3

0 S1 20 1 0 1 0 0 PIVOTAL ROW

0 S2 30 0 1 0 1 0

0 S3 -48 -1 -1 0 0 1

Zj 0 0 0 0 0 0

Cj-Zj 50 20 0 0 0

OPTIMUM COLUMN
TABLE 1 EXPLANATION
x1 x2 S1 S2 S3
S1
1 0 1 0 0
S2
0 1 0 1 0
S3
-1 -1 0 0 1

X1 + S1 = 20 no: X2, S2, S3

X2 + S2 = 30 no: X1, S1, S3

-X2 - S2 + 53 = -48 no: S1, S2

TABLE 2
Cj 50 20 0 0 0
Prod Qty x1 x2 S1 S2 S3
50 x1 20 1 0 1 0 0 REPLACING ROW

0 S2 30 0 1 0 1 0
0 S3
Zj
Cj – Zj
S2 entries need not change, since the entry below the pivot is already 0
Computing for S3 row:
20(1) + -48 = -28
1(1) + -1 = 0
0(1) + -1 = -1
1(1) + 0 = 1
0(1) + 0 = 0
0(1) + 1 = 1
An easy computation for the new S3 row is just to add the pivotal row (or S1 row and the S3 row of table 1.
TABLE 2 (with complete entries)

Cj 50 20 0 0 0
Prod Qty x1 x2 S1 S2 S3
50 x1 20 1 0 1 0 0
0 S2 30 0 1 0 1 0
0 S3 -28 0 -1 1 0 1
Zj 1000 50 0 50 0 0
Cj - Zj 0 20 -50 0 0

OPTIMUM COLUMN
TABLE 3 (with replacing row entries)
Cj 50 20 0 0 0
Prod Qty x1 x2 S1 S2 S3
50 x1 20 1 0 1 0 0
20 x2 30 0 1 0 1 0
REPLACING ROW
0 S3
Zj
Cj - Zj 0 20 -50 0 0

X1 Row entries will just be transferred since the entry along the optimum column is already
zero.
Computing for S3 row entries:
30(1) + -28 = 2
0(1) + 0 = 0
1(1) + -1 = 0
0(1) + 1 = 1
1(1) + 0 = 1
0(1) +1 = 1
TABLE 3 (with complete entries)
Cj 50 20 0 0 0
Prod Qty x1 x2 S1 S2 S3

50 x1 20 1 0 1 0 0
20 x2 30 0 1 0 1 0
0 S3 2 0 0 1 1 1
Zj 1600 50 20 50 20 0
Cj - Zj 0 0 -50 -20 0

DECISION:
x1 = 20
x2 = 30
MAXIMUM: 1600
(This can be check by the graphical method)
THANK YOU!