Course : Quantitative Method / Operations Research

LP Simplex
Maximization
Budi Harsanto
blogs.unpad.ac.id/budiharsanto

2012

Introduction
Graphical analysis is only for 2
variables.
In reality, LP problem is too
complex to solved by graphical
analysis.
Simplex method can accomodate
2 variables or more.

budi.harsanto@fe.unpad.ac.id

For Example We Use 2 Variables: Well

Solve Use Graphical & Simplex
Sebuah perusahaan furnitur hendak
memproduksi 2 buah produk, yaitu Meja
dan Kursi yang masing-masing
memberikan laba bersih per unit sebesar
7 & 5.
Kedua produk tersebut diproses oleh dua
divisi, yaitu divisi Perkayuan dan divisi
Perakitan. Jam kerja yang tersedia di
divisi Perkayuan tersedia maksimal 100
jam sedangkan jam kerja divisi Perakitan
tersedia tidak lebih dari 240 jam.
Setiap unit Meja harus diproses selama 2
jam kerja di divisi Perkayuan dan 4 jam
kerja di divisi Perakitan. Sedangkan
setiap unit kursi memerlukan proses di
divisi Perkayuan selama 1 jam dan divisi
Perakitan selama 3 jam.
budi.harsanto@fe.unpad.ac.id

Determine the best

combination!

Matrix & Mathematical Formulation

Division

Meja (M)

Kursi (K)

<

100

<

240

Profit ()

Objective: Max Profit Z = 7M + 5K

Constraits:
2M + 1K < 100
4M + 3K < 240
Status: M; K > 0
budi.harsanto@fe.unpad.ac.id

Quantity

Preparation:
Simplex Formulation

budi.harsanto@fe.unpad.ac.id

Change inequality in constraints function

become equality.

The consequence, () change with adding

slack variable for every slack. Slack variable is
unused resources.

Simplex Formulation
Objective: Maks Laba: Z = 7M + 5K + 0S1 + 0S2

Constraint:
2M + 1K + 1S1 + 0S2 = 100
4M + 3K + 0S1 +1 S2 = 240

Status: M; K; S1 ;S2 > 0

budi.harsanto@fe.unpad.ac.id

Basic Variable
1st Iteration Like at (0,0) point.
Assume all product are zero.

budi.harsanto@fe.unpad.ac.id

1st Iteration

Cj
Solution
Mix

S1

S2

Quantity

S1

100

S2

240

Zj

Cj - Zj

budi.harsanto@fe.unpad.ac.id

5 Steps
5 Langkah:
1. Entering variable: choose the biggest positive Cj - Zj
2. Leaving variable: choose the smallest non negative ratio.
3. New Pivot Row. Old pivot row divided by pivot number.
4. Other row.
5. Cj - Zj non positive mean optimal. If not optimal, back to the first step
for the next iteration.

budi.harsanto@fe.unpad.ac.id

Pivot!
Cj

Solution
Mix

S1

S2

Quantity

100

3
0
Pivot Number

240

S1

S2

Zj

Cj - Zj

Pivot column

Biggest positive Cj - Zj
budi.harsanto@fe.unpad.ac.id

Pivot Row

Other Row Equation

Numbers

in old
row

4
3
0
1
240

Number

above

- or below

pivot

number
-

budi.harsanto@fe.unpad.ac.id

(4)
(4)
(4)
(4)
(4)

Corresponding

number

in the

new row

x
x
x
x
x

(1)
(1/2)
(1/2)
(0)
(50)

=
=
=
=
=

New

Row
Numbers

0
1
-2
1
40

2nd Iteration
Cj
Solution
Mix

S1

S2

Quantity

1/2

1/2

50

S2

-2

40

Zj

7/2

7/2

350

Cj - Zj

3/2

-7/2

budi.harsanto@fe.unpad.ac.id

Cj
Solution
Mix

S1

S2

Quantity

1/2

50

1/2

S2

Zj

7/2

7/2

Cj - Zj

3/2

-7/2

-2
1
Pivot number

Pivot column

budi.harsanto@fe.unpad.ac.id

40
350
(Total
Profit)

Pivot
row

 New

Row
Numbers

1
0
3/2
-1/2
30

Numbers

in old

row

=
=
=
=

budi.harsanto@fe.unpad.ac.id

1
1/2
1/2
0
50

Number

above

- or below

pivot

number
(1/2)
-

(1/2)
(1/2)
(1/2)
(1/2)

Corresponding

number

in the

new
row

x
(0)
x
x
x

(1)
(-2)
(1)
(40)

3rd Iteration
Cj
Solution
Mix

S1

S2

Quantity

3/2

-1/2

30

-2

40

Zj

1/2

3/2

Cj - Zj

-1/2

-3/2

Optimal
T = 30 units

C = 40 units

budi.harsanto@fe.unpad.ac.id

Pofit = 410

410

Graphical Vs Simplex
X2

100

Kursi

B = (0,80)

80

4T + 3C

60

C = (30,40)

20

2T + 1C

Daerah
Layak

40
0

< 240

D = (50,0)

A = (0,0)
20

40

60

80

Meja
budi.harsanto@fe.unpad.ac.id

< 100

100

References
1. Render, Barry; Stair, Jr Ralph M & Hanna, Michael E,
Quantitative Analysis for Management, Latest Edition.
2. Taylor III, Bernard W, Introduction to Management Science,
Latest Edition.
3. Taha, Hamdy A., Operation Research An Introduction, Latest
Edition.
4. Internet

budi.harsanto@fe.unpad.ac.id