Scribd
Upload
18 views13 pages

Simplex Minimization (Quantitative Techniques in Business)

By miss libeeth Guevarra

Uploaded by

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

Simplex Minimization (Quantitative Techniques in Business)

By miss libeeth Guevarra

Uploaded by

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

Linear Programming:

Simplex Minimization Method

Libeeth B. Guevarra
Department of Mathematics and Natural Sciences

Math035 - Quantitative Techniques for Business 1


Minimization: STEPS

1: Set up the objective function and the problem constraints.


2: Convert inequality explicit constraints to equations by adding
slack or artificial variables.
I if f ≤ c, add slack variable s, f + s = c
I if f ≥ c, subtract a slack variable (surplus) and add an artificial
variable, f − s + A = c
I if f = c, add an artificial variable A, f + A = c
3: Enter the positive slack and artificial variables of each
constraints in the initial simplex tableau.
4: Calculate the Cj and Zj values for this solution.

Math035 - Quantitative Techniques for Business 2


Minimization: STEPS
Initial Simplex table

Math035 - Quantitative Techniques for Business 3


Minimization: STEPS
5: Determine the optimum column or entering variable by
choosing the most negative value in the Cj–Zj row.
6: Determine the outgoing variable of the pivot row. Divide the
quantity column values by their corresponding optimum column
values and choose the smallest positive quotient.
7: Compute the values for the replacing row by dividing all the
entries by the pivot. Enter the result in the next table.
8: Compute the new entries for the remaining rows by reducing
the optimum column entries to zero (entries in the constraint
rows).
9: Calculate the Cj − Zj values for the solution.
10: If there is a negative entry in the Cj–Zj row, return to step
5. The final solution has been obtained if there is no negative
value in the Cj–Zj row.

Math035 - Quantitative Techniques for Business 4


Example
A rancher raises milking cows and goats which he feeds with two types of
mixes, type x and type y. Each bag of type x costs P400 and contains 100
units of calcium and 400 units of protein; each bag of type y costs P600
and contains 200 units of calcium and 200 units of protein. The livestock
need a minimum of 6,000 units of calcium and 12,000 units of protein per
day. What combination of mixes should the rancher buy to minimize daily
feed cost?
The linear program:
Let x = # bags of type X; y = # bags of type Y ; C = Cost
Minimize C = 400x + 600y
Constraints:
100x + 200y ≥ 6000
400x + 200y ≥ 12000
x ≥ 0; y ≥ 0

Math035 - Quantitative Techniques for Business 5


Math035 - Quantitative Techniques for Business 6
Math035 - Quantitative Techniques for Business 7
Math035 - Quantitative Techniques for Business 8
Math035 - Quantitative Techniques for Business 9
The linear program:

Minimize C = 10x1 + 20x2


Constraints:
x1 + x2 ≥ 10
3x1 + x2 ≤ 12
x1 ≥ 0; x2 ≥ 0

Math035 - Quantitative Techniques for Business 10


The linear program:
Let x1 = # item A; x2 = # item B ; x3 = # item C; C = Cost

Minimize C = 2x1 + 5x2 + 9x3


Constraints:
2x1 + 5x2 + x3 = 20
2x1 + 4x2 + 5x3 ≤ 20
x1 + 2x2 ≥ 6
x1 ≥ 0; x2 ≥ 0; x3 ≥ 0

Math035 - Quantitative Techniques for Business 11


Exercise
Solve the following LP problems:
1 Minimize C = 3x1 + 5x2
Constraints:
5x1 + 6x2 = 80
x1 ≥ 30
x2 ≤ 20
x1 ≥ 0; x2 ≥ 0
2 Minimize C = 4x + 3y + 8z
Constraints:
4x + 3y ≥ 12
4x + 5z ≥ 16
x ≥ 0; y ≥ 0; z ≥ 0

Math035 - Quantitative Techniques for Business 12


Exercise

The Jay Gee Bull Ranch has plans to sell cattle to a large meat
packaging plant. The manager of the ranch believes that each cattle
should receive a minimum of 240 oz of nutritional ingredients A and
a minimum of 150 oz of nutritional ingredients B each week. There
are two grains available which contain both types of nutritional
ingredients. One bag of grain 1 contains 12 oz of ingredients A and
25 oz of ingredients B and costs P140 per bag; one bag of grain 2
contains 20 oz of ingredients A and five (5) oz of ingredients B and
costs P120per bag. Determine the optimum mixture of grains and
the associated minimum cost.

Math035 - Quantitative Techniques for Business 13

You might also like