Beruflich Dokumente
Kultur Dokumente
To accompany
Quantitative Analysis for Management, Tenth Edition,
by Render, Stair, and Hanna
Power Point slides created by Jeff Heyl
Introduction
Many management decisions involve trying to
materials
72
putusan = 2
Dalam persoalan nyata, jumlah variabel putusan
mungkin saja puluhan atau bahkan ratusan
Perlu metode/teknik penyelesaian yang mampu
memberikan solusi untuk persoalan secara umum
dengan variabel putusan > 2
Metode Simpleks dirancang untuk memberikan
solusi PL dengan variabel putusan > 2, menerap-kan
teknik komputasi yang iteratif (perbaikan berulang)
73
Requirements of a Linear
Programming Problem
LP has been applied in many areas over the past 50
years
All LP problems have 4 properties in common
74
Langkah-2 Perhitungan
75
Optimality Test
76
77
Standard Simplex
Ilustration:
T = number of tables produced
C = number of chairs produced
and
Maximize profit = $70T + $50C
subject to
2T +
4T +
(objective function)
78
equations
Less-than-or-equal-to constraints () are
converted to equations by adding a slack variable
to each
Slack variables represent unused resources
For the Flair Furniture problem, the slacks are
S1 = slack variable representing unused hours
in the painting department
S2 = slack variable representing unused hours
in the carpentry department
2T + 1C + S1 = 100
4T + 3C + S2 = 240
79
painting capacity
7 10
constraint equation
Slack variables not actually needed for an
equation have a coefficient of 0
So
2T + 1C + 1S1 + 0S2 = 100
4T + 3C +0S1 + 1S2 = 240
T, C, S1, S2 0
The objective function becomes
7 11
variables
When there are more unknowns than
equations, you have to set some of the
variables equal to 0 and solve for the
others
In this example, two variables must be set
to 0 so we can solve for the other two
A solution found in this manner is called a
basic feasible solution
2009 Prentice-Hall, Inc.
7 12
7 13
100
Number of Chairs
80
B = (0, 80)
2T + 1C 100
60
C = (30, 40)
40
4T + 3C 240
20
(0, 0) A |
0
Figure 9.1
20
D = (50, 0)
|
40
60
80
Number of Tables
7 14
SOLUTION MIX
S1
S2
S1
100
S2
240
7 15
S
co lac
lu k v
m a
ns ria
C
co on
lu sta
m n
n t
bl
es
es
R
co ea
lu l va
m r
ns iab
l
m
ix
P
co rod
lu uc
m ti
n on
P
co rof
lu it p
m e
n r
un
it
Cj
SOLUTION
MIX
$70
T
$50
C
$0
S1
$0
S2
QUANTITY
$0
S1
100
$0
S2
240
Zj
$0
$0
$0
$0
$0
Gross
profit row
Cj - Zj
$70
$50
$0
$0
$0
Profit per
unit row
Constraint
equation rows
Table 9.1
2009 Prentice-Hall, Inc.
7 16
T
C
S1
S2
0
0
100
240
2009 Prentice-Hall, Inc.
7 17
30
40
0
0
2009 Prentice-Hall, Inc.
7 18
7 19
$70
$50
$0
$0
SOLUTION
MIX
S1
S2
QUANTITY
$0
S1
100
$0
S2
240
2009 Prentice-Hall, Inc.
7 20
7 21
7 22
7 23
Cj for column
$70
$50
Zj for column
$70
$50
Cj Zj for column
S1
S2
$0
$0
$0
$0
2009 Prentice-Hall, Inc.
7 24
not optimal
By examining the numbers in the Cj Zj row in
Table 9.1, we can see that the total profits can be
increased by $70 for each unit of T and $50 for
each unit of C
A negative number in the number in the Cj Zj row
would tell us that the profits would decrease if the
corresponding variable were added to the
solution mix
An optimal solution is reached when there are no
positive numbers in the Cj Zj row
2009 Prentice-Hall, Inc.
7 25
7 26
7 27
Number above
or below
pivot number
Corresponding number in
the new row, that is, the
row replaced in step 3
7 28
7 29
Furniture problem
Step 1.
1 Select the variable with the largest positive
Cj - Zj value to enter the solution next. In this case,
variable T with a contribution value of $70.
Cj
$70
SOLUTION
MIX
$50
$0
$0
S1
S2
QUANTITY
(RHS)
$0
S1
100
$0
S2
240
Zj
$0
$0
$0
$0
Cj - Zj
$70
$50
$0
Pivot column
$0
$0
total profit
Table 9.2
2009 Prentice-Hall, Inc.
7 30
7 31
$70
SOLUTION
MIX
$50
$0
$0
QUANTITY
(RHS)
S1
S2
100
240
Pivot row
$0
$0
$0
$50
$0
Pivot column
$0
$0
S1
$0
S2
Zj
$0
Cj - Zj
$70
3
0
Pivot number
$0
Table 9.3
2009 Prentice-Hall, Inc.
7 32
1
0.5
2
1*
0.5
2
0
0
2
100
50
2
Cj
SOLUTION MIX
S1
S2
QUANTITY
$70
0.5
0.5
50
7 33
Number in
= Old S Row
2
Number Below
Pivot Number
Corresponding Number
in the New T Row
(4)
(1)
(4)
(0.5)
(4)
(0.5)
(4)
(0)
40
240
(4)
(50)
Cj
SOLUTION MIX
S1
S2
QUANTITY
$70
0.5
0.5
50
$0
S2
40
2009 Prentice-Hall, Inc.
7 34
7 35
= ($70)(1) + ($0)(0)
= ($70)(0.5) + ($0)(1)
= ($70)(0.5) + ($0)(2)
= ($70)(0) + ($0)(1)
= $70
= $35
= $35
= $0
7 36
Cj for column
$70
$50
Zj for column
$70
$35
S1
S2
$0
$0
$35
$0
$35
$0
Cj Zj for second
column
$0
$15
Completed
simplex
tableau
Cj
$70
SOLUTION
MIX
$50
$0
$0
S1
S2
QUANTITY
(RHS)
$0
0.5
0.5
50
$0
S2
40
Zj
$70
$35
$35
$0
$3,500
Cj - Zj
$0
$15
$35
$0
Table 9.4
7 37
7 38
7 39
7 40
Step 1.
1 Variable C will enter the solution as its Cj - Zj
value of 15 is the largest positive value. The C
column is the new pivot column.
Step 2.
2 Identify the pivot row by dividing the number
in the quantity column by its corresponding
substitution rate in the C column.
50
For the T row :
100 chairs
0.5
40
For the S2 row :
40 chairs
1
2009 Prentice-Hall, Inc.
7 41
$70
$50
$0
$0
S1
S2
0.5
50
2
1
Pivot number
40
$70
0.5
$0
S2
Zj
Cj - Zj
$70
$0
Pivot column
$35
$35
$0
$15
$35
$0
QUANTITY
Pivot row
$3,500
Table 9.5
2009 Prentice-Hall, Inc.
7 42
1
1
1
2
2
1
1
1
1
40
40
1
SOLUTION MIX
S1
S2
QUANTITY
$5
40
7 43
Number in
old T row
Number above
pivot number
Corresponding number
in new C row
(0.5)
(0)
0.5
(0.5)
(1)
1.5
0.5
(0.5)
(2)
0.5
(0.5)
(1)
30
50
(0.5)
(40)
Cj
SOLUTION MIX
S1
S2
QUANTITY
$70
1.5
0.5
30
$50
40
2009 Prentice-Hall, Inc.
7 44
= $70
Cj for column
$70
$50
Zj for column
$70
$50
S1
S2
$0
$0
$5
$15
2009 Prentice-Hall, Inc.
7 45
7 46
Cj
SOLUTION
MIX
$70
$50
$0
$0
S1
S2
QUANTITY
$70
1.5
0.5
30
$50
40
Zj
$70
$50
$5
$15
$4,100
Cj - Zj
$0
$0
$5
$15
Table 9.6
7 47
7 48
3.
4.
5.
7 49