Scribd
Upload
9 views6 pages

LP-SIMPLEX-METHOD-ILLUSTRATIONS

The document illustrates a maximization problem for Margan Furniture, focusing on the production of tables and chairs under specific time constraints in assembly and finishing departments. It presents the standard form of the problem, the conversion of constraints, and the application of the Simplex method through multiple tableau iterations to find the optimal production quantities. The final solution indicates producing 12 tables and 6 chairs for a total profit of P1320, along with a second problem involving different constraints that is not fully detailed in the document.

Uploaded by

lovemondano2
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
9 views6 pages

LP-SIMPLEX-METHOD-ILLUSTRATIONS

The document illustrates a maximization problem for Margan Furniture, focusing on the production of tables and chairs under specific time constraints in assembly and finishing departments. It presents the standard form of the problem, the conversion of constraints, and the application of the Simplex method through multiple tableau iterations to find the optimal production quantities. The final solution indicates producing 12 tables and 6 chairs for a total profit of P1320, along with a second problem involving different constraints that is not fully detailed in the document.

Uploaded by

lovemondano2
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/ 6

ACTUAL SIMPLEX - MAXIMIZATION PROBLEM ILLUSTRATION

Problem 1: Maximization problem containing only with“Lesser than or


Equal to constraints
The Margan Furniture makes two products: tables and chairs, which
must be processed through assembly and finishing departments.
Assembly department is available for 60 hours in every production
period, while the finishing department is available for 48 hours of work.
Manufacturing one table requires 4 hours in the assembly and 2 hours
in the finishing. Each chair requires 2 hours in the assembly and 2
hours in the finishing. One table contributes P80 to profit, while a chair
contributes P60. The problem is the determine the number of tables
and chairs to make per production period in order to maximize the
profit.
SOLUTIONS:
A. Standard Form
Objective function (OF) : Maximize: Z = 80x + 60y
Subject to (Constraints) : 4x + 2y  60
2x +2y  48
x  0, y  0

B. Least Common Factor (LCF) Conversion of Constraints

Maximize: Z = 80x + 60y


Subject to: 2x + y  30
x + y  24
x  0, y  0
C. New Program with slack variables
Maximize: Z = 80x + 60y + 0S1 + 0S2
Subject to: 2x + y + S1 = 30
x + 2y + S2 = 24
x  0, y  0, S1  0, S2  0

D. The Simplex Maximization Tableau


Table 1 (Initial table)
Cj 80 60 0 0
Prod Qty x y S1 S2
0 S1 30 2 1 1 0
0 S2 24 1 2 0 1
Zj 0 0 0 0 0
Cj- Zj 80 60 0 0

- To determine the entering variable, find the greatest Cj- Zj value, and in
this table, x has the greatest = 80
- To find the pivotal row, find the least quotient between the quantity
and the element of the entering variable, and in this table, it the 30/2
= 15 (least value), while the other one is higher, that is 24/1 = 24
(greater value).
- The element that is common to the entering variable and the pivotal
row is called pivot element.
Table 2

Cj 80 60 0 0
Prod Qty x y S1 S2
80 x 15 1 1/2 1/2 0
0 S2 9 0 3/2 -1/2 1
Zj 1200 80 40 40 0
Cj- Zj 0 20 -40 0

Computations:
x Row: (30 2 1 1 0) ÷ 2 = 15 1 ½ ½ 0
y Row: (New x Row elements) x ( - 1) + (Old y Row elements)
(15 1 ½ ½ 0 ) x (- 1) + (24 1 2 0 1)
= 9 0 3/2 - ½ 1
Zj Row: 80 (15 1 ½ ½ 0) = 1200 80 40 40 0
0 (9 0 3/2 - ½ 1) = 0 0 0 0 0
Zj = 1200 80 40 40 0

Developing the Third Table

Cj 80 60 0 0
Prod Qty x y S1 S2
80 x 15 1 1/2 1/2 0
0 S2 9 0 3/2 -1/2 1
Zj 1200 80 40 40 0
Cj- Zj 0 20 -40 0
Computations: 15 ÷ ½ = 30 ( greater value)
9 ÷ 3/2 = 6 (least value)
Table 3 (Final Table)
Cj 80 60 0 0
Prod Qty x y S1 S2
80 x 12 1 0 2/3 -1/3
60 y 6 0 1 -1/3 2/3
Zj 1320 80 60 100/3 40/3
Cj- Zj 0 0 -100/3 -40/3

Computations:
y Row: (9 0 3/2 - ½ 1) ÷ 3/2 = 6 0 1 -1/3 2/3

x Row: (New y Row elements) x (- 1/2) + (Old x Row elements)


(6 0 1 -1/3 2/3) x (- ½) + (15 1 ½ ½ 0)

= 12 1 0 2/3 -1/3
Zj Row: 80 ( 12 1 0 2/3 -1/3) + 60 (6 0 1 -1/3 2/3)
= 1320 80 60 100/3 40/3
Cj- Zj Row: Cj = 80 60 0 0
- Zj = 80 60 100/3 40/3
Cj- Zj = 0 0 -100/3 -40/3

E. FINAL ANSWERS:
x = 12 tables
y = 6 chairs
Profit (Z) = P1320 [(P80 x 12) + (P60 x 6)]
Problem 2: Maximization problem containing “Lesser/Greater than or
Equal to constraints
A. Standard Form
Objective function (OF) : Maximize: Z = 50x1 + 60x2
Subject to (Constraints) : x1  20
x2  30
x1 + x2  48
x1  0, x2  0

B. Converting the greater than to lesser than form of inequality


Old 3rd constraint: x1 + x2  48
Multiplied by (- 1): (x1 + x2  48) (- 1)
New 3rd constraint: - x1 - x2  - 48

C. New Program with slack variables


Maximize: Z = 50x1 + 60x2 + 0S1 + 0S2 + 0S3
Subject to: x1 + S1 = 20
x2 + S2 = 30
- x1 - x2 + S3 = - 48
x1  0, x2  0, S1  0, S2  0, S3  0
D. The Simplex Maximization Tableau
Table 1
Cj 50 20 0 0 0
Prod Qty x1 x2 S1 S2 S3
0 S1 20 1 0 1 0 0
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
Computations:

E. Table 2
Computations:
F. Table 3
Computations
G. …

H. …

You might also like