Scribd
Upload
3 views

LINEAR-PROGRAMMING-MINIMIZATION-ILLUSTRATION

The document outlines the steps for solving a minimization problem using the Simplex Method in linear programming, including converting constraints to equations. It provides a sample problem involving the production of a feed mixture, detailing the formulation of the linear program, the introduction of slack and artificial variables, and the tableau presentations leading to the final solution. Additionally, it presents an assignment problem related to grain mixing, requiring the application of the Simplex Method to minimize costs while meeting nutritional requirements.

Uploaded by

lovemondano2
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

LINEAR-PROGRAMMING-MINIMIZATION-ILLUSTRATION

The document outlines the steps for solving a minimization problem using the Simplex Method in linear programming, including converting constraints to equations. It provides a sample problem involving the production of a feed mixture, detailing the formulation of the linear program, the introduction of slack and artificial variables, and the tableau presentations leading to the final solution. Additionally, it presents an assignment problem related to grain mixing, requiring the application of the Simplex Method to minimize costs while meeting nutritional requirements.

Uploaded by

lovemondano2
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

LINEAR PROGRAMMING: THE SIMPLEX MINIMIZATION METHOD

Steps in Solving a Minimization Problem:


1. The Cj column of the initial table begins with the coefficients of artificial
variables and of slack variables in the objective function with positive
coefficients in the constraints.
2. Instead of looking for the most positive quantity in Cj-Zj row for the optimum
column, look for the most negative entry.
3. The optimum table or final table has entries in the Cj-Zj row which are either
zero or positive.
Summary of Converting Constraints to Equations in a Minimization Problem:
1. Add an artificial variable (An) if the symbol is =.
2. Add a slack variable (Sn) if the symbol is .
3. Subtract a slack variable but add an artificial variable if the symbol is

Sample Problem 1:
The Philippine Feeds Inc. produces specially blended feed supplements. It has an
order of 400 pounds of the mixture. This consists of two ingredients: P, a source of
protein and C, a carbohydrate source.
The first ingredient P, costs Php6 a pound. The second ingredient C, costs Php16 a
pound. The mixture cannot be more than 150 pounds P, and it must have at least
200 pounds C. The company’s problem is to determine how much of each
ingredient to use to minimize cost, but satisfy the requirements.

Solutions
A. Writing the Linear program:

Minimize: Z = 6P + 16C
Subject to: P + C = 400 total order
P  150 P content
C C content
B. New program with slack and artificial variables
Minimize: Z = 6P + 16C + 0S1 + 0S2 + 100A1 + 100A2
Subject to: P + C + A1 = 400
P + S1 = 150
C - S2 + A2 = 200
P ,C S1 S2

C. Tableau Presentations
Table 1 (Initial Table)

Cj 6 16 0 0 100 100
Prod Qty P C S1 S2 A1 A2
100 A1 400 1 1 0 0 1 0
0 S1 150 1 0 1 0 0 0
100 A2 200 0 1 0 -1 0 1
Zj 60000 100 200 0 -100 100 100
Cj- Zj -94 -184 0 100 0 0

Table 2 (Determining the optimum column, entering variable, pivot row,


and outgoing variable)

Cj 6 16 0 0 100 100
Prod Qty P C S1 S2 A1 A2
100 A1 400 1 1 0 0 1 0
0 S1 150 1 0 1 0 0 0
100 A2 200 0 1 0 -1 0 1
Zj 60000 100 200 0 -100 100 100
Cj- Zj -94 -184 0 100 0 0
For New A1 row = (New Row elements) x ( - 1) + (Old A1 Row elements)
(200 0 1 0 -1 0 1) x (-1) + (400 1 1 0 0 1 0)
= 200 1 0 0 1 1 -1
Table 3

Cj 6 16 0 0 100 100
Prod Qty P C S1 S2 A1 A2
100 A1 200 1 0 0 1 1 -1
0 S1 150 1 0 1 0 0 0
16 A2 200 0 1 0 -1 0 1
Zj 23200 100 16 0 84 100 -84
Cj- Zj -94 0 0 -84 0 184
For New A1 row = (New Row elements) x ( - 1) + (Old A1 Row elements)
(150 1 0 1 0 0 0) x (-1) + (200 1 0 0 1 1 -1)
= 50 0 0 -1 1 1 -1

Table 4

Cj 6 16 0 0 100 100
Prod Qty P C S1 S2 A1 A2
100 A1 50 0 0 -1 1 1 -1
6 P 150 1 0 1 0 0 0
16 C 200 0 1 0 -1 0 1
Zj 9100 6 16 -94 84 100 -84
Cj- Zj 0 0 94 -84 0 184
For New C row = (New Row elements) x (1) + (Old C Row elements)
(50 0 0 -1 1 1 -1 x (1) + (200 0 1 0 -1 0 1)
= 250 0 1 -1 0 1 0

Table 5 (Final Table)

Cj 6 16 0 0 100 100
Prod Qty P C S1 S2 A1 A2
0 S2 50 0 0 -1 1 1 -1
6 P 150 1 0 1 0 0 0
16 C 250 0 1 -1 0 1 0
Zj 4900 6 16 -10 0 16 0
Cj- Zj 0 0 10 0 84 100

D. Final Answer: P = 6 Total Cost = Php 4,900.00


C = 16
LINEAR PROGRAMMING: SIMPLEX MINIMIZATION METHOD

Assignment Problem:

An animal feed producer mixes two types of grain: X and Y. Each unit
of grain X contains 20 grams of fat, 10 grams of protein, and 800 calories.
Each unit of grain Y contains 30 grams of protein, 30 grams of fat and 600
calories. Suppose that the producer wants each unit of the final product to
yield at least 180 grams of fat, at least 130 grams of protein and at least
4800 calories. If each unit of X costs P180 and each unit of Y costs P160, how
many units of each type of grain should the producer use to minimize his
cost?

Solve the above problem using the Simplex Method and submit the
file of your answers to the assignment section (marked as Prelim – Weeks 1
– 2 Assignment 2) of the course in the Moodle.

You might also like