Scribd
Upload
18 views2 pages

Simplex Maxi

This document presents a linear programming problem to maximize profit with constraints. It uses the simplex method to solve a 3-variable optimization problem over multiple steps, tracking the calculations in tables to arrive at an optimal solution of 40 units of product A, 0 units of product B, and 70 units of product C for maximum profit of $16,600.

Uploaded by

Jane Rico
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 views2 pages

Simplex Maxi

This document presents a linear programming problem to maximize profit with constraints. It uses the simplex method to solve a 3-variable optimization problem over multiple steps, tracking the calculations in tables to arrive at an optimal solution of 40 units of product A, 0 units of product B, and 70 units of product C for maximum profit of $16,600.

Uploaded by

Jane Rico
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/ 2

rico

LINEAR PROGRAMMING
(SIMPLEX METHOD – MAXIMIZATION)

Objectives: New Program:


Max P= 100x + 150y + 180z ᵄ = 100ᵆ + 150ᵆ + 180ᵆ + 0ᵄ 1 + 0ᵄ 2 + 0ᵄ 3
Constraints: Constraints:
5ᵆ + 5ᵆ + 5ᵆ ≤ 560 5ᵆ + 5ᵆ + 5ᵆ + ᵄ 1 ≤ 560
8ᵆ + 8ᵆ + 8ᵆ ≤ 880 8ᵆ + 8ᵆ + 8ᵆ + ᵄ 2 ≤ 880
5ᵆ + 10ᵆ + 10ᵆ ≤ 900 5ᵆ + 10ᵆ + 10ᵆ + ᵄ 3 ≤ 900

TABLE 1
Cj 100 150 180 0 0 0
PRODUCT QTY x y z S1 S2 S3
0 S1 560 5 5 5 1 0 0
0 S2 880 8 8 8 0 1 0
0 S3 900 5 10 10 0 0 1
Zj 0 0 0 0 0 0 0
Cj-Zj 100 150 180 0 0 0

Pivotal Row = QTY vs. OPTIMUM COLUMN


560÷5 = 112
880÷8 = 110
900÷10 = 90→ Least Quotient

TABLE 2: Pivotal Row : (900 5 10 10 0 0 1) ÷ 10


90 1/2 1 1 0 0 1/10
Cj 100 150 180 0 0 0
PRODUCT QTY X y z S1 S2 S3
0 S1 110 5 0 0 1 0 1
−
2 2
0 S2 160 4 0 0 0 1 4
−
5
180 z 90 1 1 1 0 0 1
2 10
Zj 16,200 90 180 180 0 0 18
Cj-Zj 10 -30 0 0 0 -18

Pivotal Row = QTY vs. OPTIMUM COLUMN


110 ÷ 5/2 =44
160 ÷ 4 = 40 → Least Quotient
90 ÷ 1/2 = 180
rico

S1 Row: S2 Row:
90 (− 5) + 560 = 110 90 (− 8) + 880 = 160
1 2 (− 5) + 5 = 5 2 1 2 (− 8) + 8 = 4
1 (− 5) + 5 = 0 1 (− 8) + 8 = 0
1 (− 5) + 5 = 0 1 (− 8) + 8 = 0
0 (− 5) + 1 = 1 0 (− 8) + 0 = 0
0 (− 5) + 0 = 0 0 (− 8) + 1 = 1
1 10 (− 5) + 0 = − 1 2 1 10 (− 8) + 0 = − 4 5

TABLE 3: Pivotal Row: (160 4 0 0 0 1 -4/5) ÷ 4


40 1 0 0 0 1/4 -1/5
Cj 100 150 180 0 0 0
PRODUCT QTY x y z S1 S2 S3
0 S1 10 0 0 0 1 5 0
−
8
100 x 40 1 0 0 0 1 1
−
4 5
180 z 70 0 1 1 0 1 2
−
8 10
Zj 16,600 100 180 180 0 5 16
2
Cj-Zj 0 -30 0 0 5 -16
−
2
S1 Row: Z Row:
40 (− 5 / 2) + 110 = 10 40 (− 1 / 2) + 90 = 70
1 (− 5 / 2 ) + 5 / 2 = 0 1 (− 1 / 2 ) + 1 / 2 = 0
0 (− 5 / 2 ) + 0 = 0 0 (− 1 / 2 ) + 1 = 1
0 (− 5 / 2 ) + 0 = 0 0 (− 1 / 2 ) + 1 = 1
0 (− 5 / 2 ) + 1 = 1 0 (− 1 / 2 ) + 0 = 0
1 4 ( − 5 2 ) + 0 =− 5 / 8 1 / 4( − 1 / 2) + 0 =− 1 / 8
− 1 / 5 (− 5 / 2) +− 1 / 2 = 0 − 1 / 5 (− 1 / 2) + 1 / 10 = 2 / 10

DECISION:
x= 40 units of ladder type A
y= 0 units of ladder type B
z= 70 units of ladder type C
MAX P= P16,600

You might also like