LINEAR PROGRAMMING: Simplex Minimization

In minimization, SUBTRACTION of SLACK variable is permitted but not in maximization, because if we

intend to minimize, it is logical to subtract, and if we intend to maximize , it is otherwise.

A general rule in linear programming is that all variables must be greater than or equal to zero, hence
there is a need to use another kind of variable that will save the slack variable from becoming negative.
This is known as an ARTIFICIAL variable ( A). An artificial variable has a large value which is used as a
computational device that prevents an equality constraints from equating a constant to zero, and
prevents the slack variable from becoming negative. In a ≥ symbol , convert the inequality to equation
nu subtracting a slack variable, but at the same time add an artificial variable.

Example: 10x+ 2y = 10 add an artificial variable

If x= 0 and y=0

0= 10 false 10x + 2y +A1 = 10

 Minimization problems commonly deals with cost

 SLACK variable do not contribute any amount to cost
 ARTIFICIAL variable contributes the biggest amount to cost
 Use quantity which is a power of 10, greater than any of the coefficient found in the constraints
and objective in representing the contribution of the artificial variable to the objective. Such as
10, 100,1000, etc.

Converting Constraint to Equation

1. Add an ARTIFICIAL variable of the symbol is =

2. Add a SLACK variable if the symbol is ≤
3. Subtract a slack variable but add an ARTIFICIAL variable if the symbol is ≥.
 Example:
Minimize : Z = 60x + 50y
Subject to: 3x + 5y ≤15
4x + 4y ≥ 16
X ≥ 0; y ≥ 0

Solution: New Program with Slack and Artificial Variables

Min: Z = 60x + 50y + 0S1 + 0S2 + 100A1
Subject to: 3x + 5y + S1 = 15
4x + 4y - S2 + A1 = 16

Table 1

Cj 60 50 0 0 100
Prod Qty x y S1 S2 A1
0 S1 15 3 5 1 0 0
100 A1 16 4 4 0 -1 1
Zj 1600 400 400 0 -100 100
Cj- Zj -340 -350 0 100 0

*15/5 = 3
16/ 4 = 4

( 15 3 5 1 0 0 ) / 3 = 3 3/5 1 1/5 0 0

3 ( -4 ) + 16 = 4

3/5 ( -4 ) + 4 = 8/5

1 ( -4 ) + 4 = 0

1/5 ( -4 ) + 0 = -4/5

0 ( -4 ) + (-1) = -1

0 ( -4 ) + 1 = 1
Table 2

Cj 60 50 0 0 100
Prod Qty x y S1 S2 A1 550=
50 y 3 3/5 1 1/5 0 0 (50*3)+(100*4)
100 A1 4 8/5 0 -4/5 -1 1 -130= 60-
Zj 550 190 50 -70 -100 100 190
Cj- Zj -130 0 70 100 0 3
*3 ÷ =
5
5
8
4 ÷ = 2.5
5

8 −1 −5 5
( 4 8/5 0 -4/5 -1 1 ) ÷ = 2.5 1 0
5 2 8 8

2.5 ( -3/5) + 3 = 3/2

1 ( -3/5) + 3/5 = 0

0 ( -3/5) + 1 = 1

-1/2 ( -3/5) + 1/5 = 1/2

-5/8 ( -3/5) + 0 = 3/8

5/8 ( -3/5) + 0 = -3/8

Table 3

Cj 60 50 0 0 100
Prod Qty x y S1 S2 A1
50 y 3/2 0 1 ½ 3/8 -3/8
60 x 2.5 1 0 -1/2 -5/8 5/8
Zj 225 60 50 -5 -75/4 75/4
Cj- Zj 0 0 5 75/4 325/4

Since there is no more negative entry , the table is optimum

Decision:

. x = 2.5 or 5/2

. y = 1.5 or 3/2

Min Z= P 225.00
2. The XYZ Chemical Corporation must produce exactly 100 pounds of a special mixture of phosphate
and potassium for a customer. Phosphate costs 50pesos per pounds and potassium costs 60 pesos per
pound. No more than 30 pounds of phosphate can be used and at least 15 pounds of potassium must
be used. The problem is to determine the least-cost blend of the two ingredients.

Let

. x = number of lbs of phosphate to be used in the mixture

. y= number of lbs of potassium to be used in the mixture

Objective function:

_________________________________________

Subject to:

Table 1

Cj
Prod Qty

Zj
Cj- Zj
Table 2

Cj
Prod Qty

Zj
Cj- Zj

Table 3

Cj
Prod Qty

Zj
Cj- Zj

Table 4

Cj
Prod Qty

Zj
Cj- Zj
Decision: