Scribd
Upload
41 views4 pages

Day 6 PART B Simplex Minimization

The document describes the steps for solving a linear programming problem using the simplex method. It provides an example problem about minimizing the total cost of ingredients X and Y subject to constraints on the total weight and minimum amounts of each ingredient. The steps include setting up the objective function and constraints, converting inequalities to equalities, solving the problem using the simplex method through multiple simplex tables, and determining the optimal solution.

Uploaded by

John Delrosario
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
41 views4 pages

Day 6 PART B Simplex Minimization

The document describes the steps for solving a linear programming problem using the simplex method. It provides an example problem about minimizing the total cost of ingredients X and Y subject to constraints on the total weight and minimum amounts of each ingredient. The steps include setting up the objective function and constraints, converting inequalities to equalities, solving the problem using the simplex method through multiple simplex tables, and determining the optimal solution.

Uploaded by

John Delrosario
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Day 6 PART B

ENGINEERING MANAGEMENT – SIMPLEX METHOD ON MINIMIZATION

Summary Steps:

1. Set up the objective function, inequalities and equalities describing the problem constraints.
(restate the information in mathematical form)
2. Convert the inequalities to equalities by adding slack variables or subtracting slack variables as
necessarily.
3. Add artificial variable to any equalities involving negative slack variables (surplus) and to any
equalities , which were not altered by adding slack variables initially.
4. Enter the resulting equalities in the simplex table.
5. Calculate Cj and Zj values for the solution.
6. Determine the entering variable by choosing the one with the largest negative Cj – Zj value.
7. Determine the row to be replaced ( outgoing variable) by dividing the quantity column values by
their corresponding optimum column values and choosing the smallest positive quotient.
8. Compute the values for the replacing row (entering variable).
9. Calculate the values for the remaining row.
10. Calculate the Cj and Zj for this solution.
11. If there is a negative Cj - Zj value remaining , proceed as indicated in step 6.
12. If there is no Cj - Zj value remaining , the optimum solution has been obtained.

METHODS FOR TREATING CONSTRAINTS:

ORIGINAL CONSTRAINTS ACTION REQUIRED RESULTING CONSTRAINTS


X <= C Add a Slack variable X+S=C
X>= C Subtract a slack variable X-S+A=C
(surplus) and add an artificial
variable
X=C Add an artificial variable X + A =C

Example 1.

A manufacturer of commercial chemicals has an order for a certain mixture consisting of two(2)
ingredients, x and y which cost PhP 4.00 and PhP 5.00 per Kilo, respectively. The following are the
specifications: a) The weight of he mixture must be 100 Kilos, b) it contain more than 30 Kilos of X,
and c) It must satisfies the customer’s requirements and still yield a Minimum total cost of raw and
materials.

Minimize : C = 4X + 5Y

Subject to :

X + y = 100 : X + Y +A1 = 100

X <= 30 : X +S1 = 30

Y >= 20 : Y – S2 + A2 = 20

X, Y >= 0
Note : For the cost of A1 and A2, use the values in multiplies of 10 e.g, 10,000, 1,000 dependig on
the highest cost of X and Y. Here the highest cost is PhP5.00, then use PhP10.00.

REWRITING THE NEW PROGRAM:

MINIMIZE :

SUBJECT TO:

Enter the equalities in the simplex table with positive slack and artificial variables in the product mix
column.

FIRST TABLE:

CJ 4 5 0 0 10 10
PM QTY X Y S1 S2 A1 A2
10 A1 100 1 1 0 0 1 0
0 S1 30 1 0 1 0 0 0
10 A2 20 0 1 0 -1 0 1
Zj 1,200 10 20 0 -10 10 10
Cj-Zj -6 -15 0 10 0 0

Detremine the O.V.

Elements of the E.V. (Y) : The same with elements in the old row, since the intersectional element is
1.

New A1 row: New S1 row:


2nd TABLE:

Cj
PM QTY X Y S1 S2 A1 A2
A1
S1

ZJ
Cj-Zj

Determine the O.V.

Elements of the entering variable (X): The same elements.

New A1 row New Y row:

3rd TABLE:

Cj
PM QTY X Y S1 S2 A1 A2
A1

Y
Zj
Cj-Zj

Elements of the E.V.(S2):

New Y row: New X row: the same elements


4th TABLE:

Cj
PM QTY X Y S1 S2 A1 A2

X
Y
Zj
Cj - Zj

Decision :

X=

Y=

Cost =

You might also like