KEMBAR78
Simplex Method | PDF | Combinatorial Optimization | Theoretical Computer Science
Scribd
Upload
12 views9 pages

Simplex Method

The document outlines the Simplex Method for maximizing profit with constraints on two variables, x and y. It includes the formulation of the profit function, constraints, and the iterative process to find optimal values through pivoting. The document presents various iterations and calculations necessary for determining the maximum profit and the corresponding quantities of products.

Uploaded by

Erika Fate Oliva
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
12 views9 pages

Simplex Method

The document outlines the Simplex Method for maximizing profit with constraints on two variables, x and y. It includes the formulation of the profit function, constraints, and the iterative process to find optimal values through pivoting. The document presents various iterations and calculations necessary for determining the maximum profit and the corresponding quantities of products.

Uploaded by

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

SIMPLEX METHOD

Let x = number of

y = number of

Max profit: P = ₱ 700x + ₱500y


Subject to: 8x + 6y ≤ 480
4x + 2y ≤ 200
x, y ≥ 0

Max profit: P = ₱000x + ₱000y + 0S1 + 0S2


Subject to: 0x + 0y + S1 = 000
0x + 0y + S2 = 000

Solution
Product Pivot Value
Quantity
S1 /
S2 /

Table before Improvement


Cj

Product Solution Quantity

700 x
0 S1
Zj
Cj-Zj

New values of incoming variables


Old Values of Pivot Value of
Outgoing Incoming Variable
Variable (S2) (x)
/

/
/
/

After computing for the values of the incoming variable x.


Cj 700
Product Solution Quantity x
700 x #DIV/0! #DIV/0!
0 S1
Zj
Cj-Zj

Old Values of
Pivot Value of Retained
Retained
Variable (S1)
Variables (S1)

- ×
- ×
- ×
- ×
- ×

FIRST ITERATION
Cj 700
Product Solution Quantity x
700 x #DIV/0! #DIV/0!
0 S1 0 0
Zj #DIV/0! #DIV/0!
Cj-Zj #DIV/0!

To improve
Solution
Product Pivot Value
Quantity
x /
S1 /
Old Values of
Pivot Value of Incoming
Outgoing
Variable
Variable
/ =
/ =
/ =
/ =
/ =

After computing for the values of the incoming variable


Cj 700
Product Solution Quantity x
500 y #DIV/0! #DIV/0!
700 x
Zj
Cj-Zj

Old Values of
Pivot Value of Retained
Retained
Variable
Variables
- ×
- ×
- ×
- ×
- ×

SECOND ITERATION
Cj 700
Product Solution Quantity x
500 y #DIV/0! #DIV/0!
700 x 0 0
Zj #DIV/0! #DIV/0!
Cj-Zj #DIV/0!
INITIAL TABLE
Cj 800 500 0
Solution
Product x y S1
Quantity
0 S1 480 8 6 1
0 S2 200 4 2 0
Zj 0 0 0 0
Cj-Zj 800 500 0

To compute Zj:
S1 0 ( 480 8 6 1 0 )
+ S2 0 ( 200 4 2 0 1 )
Zj 0 0 0 0 0

Quotient

= #DIV/0!
= #DIV/0!

700 500 0 0

x y S1 S2

Values of
Incoming
Variable
= #DIV/0!

= #DIV/0!

= #DIV/0!
= #DIV/0!
= #DIV/0!

500 0 0
y S1 S2
#DIV/0! #DIV/0! #DIV/0!

New Values New Values of


of Incoming Retained
Variable (x) Variables

= 0
= 0
= 0
= 0
= 0

500 0 0
y S1 S2
#DIV/0! #DIV/0! #DIV/0!
0 0 0
#DIV/0! #DIV/0! #DIV/0!
#DIV/0! #DIV/0! #DIV/0!

Quotient Table before Improvement

= #DIV/0! Cj
= #DIV/0! Product
Solution Quantity
500 y
700 x
Zj
Values of
Incoming Cj-Zj
Variable
#DIV/0!
#DIV/0!
#DIV/0!
#DIV/0!
#DIV/0!

500 0 0
y S1 S2
#DIV/0! #DIV/0! #DIV/0!

New Values New Values of


of Incoming Retained
Variable Variables
= 0
= 0
= 0
= 0
= 0

500 0 0
y S1 S2
#DIV/0! #DIV/0! #DIV/0!
0 0 0
#DIV/0! #DIV/0! #DIV/0!
#DIV/0! #DIV/0! #DIV/0!
0

S2

0
1
0
0
700 500 0 0
x y S1 S2

You might also like