SELAMAT

DATANG
DI
RISET OPERASI

To accompany
Quantitative

7-1

1 2003 by
Prentice Hall, Inc.

TIM DOSEN
Noorlaily Fitdiarini
Yetty Dwi Lestari
Febriana Wuryaningrum

To accompany
Quantitative

7-2

2 2003 by
Prentice Hall, Inc.

Metode perkuliahan
dan
penilaian
Metode Perkuliahan
Klasikal
Diskusi

Penilaian

Tugas 20%
Kuis 20%
Kehadiran 10%
Keaktifan 10%
Ujian
40%

To accompany
Quantitative

7-3

3 2003 by
Prentice Hall, Inc.

MATERI UTS
LINEAR PROGRAMMING :
GRAPHICAL &
COMPUTER ; 1 & 2
LP : SIMPLEKS ; 3 & 4
MODEL TRANSPORTASI; 5
MODEL ASSIGNMENT; 6
NETWORK; 7

To accompany
Quantitative

7-4

4 2003 by
Prentice Hall, Inc.

MATERI UAS
MANAJEMEN PROYEK ; 8
INTEGER PROGRAMMING
& GOAL PROGRAMMING ;
9-11
ANALISIS MARKOV ; 12
ANALYTIC HIERARCHY
PROCESS ; 13
SIMULASI ; 14

To accompany
Quantitative

7-5

5 2003 by
Prentice Hall, Inc.

Learning Objectives
Students will be able to:
Understand the basic
assumptions and properties of
linear programming (LP).
Formulate small to moderatesized LP problems.
Graphically solve any LP
problem with two variables by
both the corner point and
isoline methods.

To accompany
Quantitative

7-6

6 2003 by
Prentice Hall, Inc.

Learning Objectives continued

Understand special issues in LP
- infeasibility, unboundedness,
redundancy, and alternative
optima.
Understand the role of
sensitivity analysis.
Use Excel spreadsheets to solve
LP problems.

To accompany
Quantitative

7-7

7 2003 by
Prentice Hall, Inc.

Chapter Outline
7.1 Introduction
7.2 Requirements of a Linear
Programming Problem
7.3 Formulating LP Problems
7.4 Graphical Solution to an LP
Problem
7.5 Solving Flair Furnitures LP
Problem using QM for Windows and
Excel

To accompany
Quantitative

7-8

8 2003 by
Prentice Hall, Inc.

Chapter Outline continued

7.6 Solving Minimization Problems
7.7 Four Special Cases
7.8 Sensitivity Analysis in LP

To accompany
Quantitative

7-9

9 2003 by
Prentice Hall, Inc.

Examples of Successful
LP Applications
1. Development of a production schedule
that will satisfy future demands for a
firms production and at the same time
minimize total production and
inventory costs
2. Selection of the product mix in a
factory to make best use of machinehours and labor-hours available while
maximizing the firms products

To accompany
Quantitative

7-10

10 2003 by
Prentice Hall, Inc.

Examples of Successful
LP Applications
3. Determination of grades of petroleum
products to yield the maximum profit
4. Selection of different blends of raw
materials to feed mills to produce finished
feed combinations at minimum cost
5. Determination of a distribution system
that will minimize total shipping cost from
several warehouses to various market
locations

To accompany
Quantitative

7-11

11 2003 by
Prentice Hall, Inc.

Requirements of a Linear
Programming Problem
All problems seek to maximize or
minimize some quantity (the
objective function).
The presence of restrictions or
constraints, limits the degree to
which we can pursue our objective.
There must be alternative courses of
action to choose from.
The objective and constraints in
linear programming problems must
be expressed in terms of linear
equations or inequalities.
To accompany
Quantitative

7-12

12 2003 by
Prentice Hall, Inc.

Basic Assumptions of
Linear Programming
Certainty
Proportionality
Additivity
Divisibility
Nonnegativity

To accompany
Quantitative

7-13

13 2003 by
Prentice Hall, Inc.

EXAMPLE
The Flair Furniture Company
produces inexpensive tables &
chairs Each table takes 4 hours of
carpentry & 2 hours in the
painting&varnishing dept. Each
chair requires 3 hours in carpentry
& 1 hour in painting&varnishing
dept. During the current
production period, 240 hours of
carpentry and 100 hours in
painting&varnishing time are
available. Each table sold yields a
profit of $7; each chair produced is
sold for a $5 profit.

To accompany
Quantitative

7-14

14 2003 by
Prentice Hall, Inc.

example
S an LP Flair Furnitures
problem is to determine the
best possible combination of
tables and chairs to
manufacture in order to reach
the maximum profit. The firm
would like this production
mix situation formulated a
problem.

To accompany
Quantitative

7-15

15 2003 by
Prentice Hall, Inc.

Flair Furniture Company

Data - Table 7.1
Hours Required to Produce One Unit
T
C
Tables Chairs

Department

Carpentry
Painting
&Varnishing

4
2

3
1

Profit Amount

$7

$5

Available
Hours This
Week
240
100

Constraints: 4T + 3C 240 (Carpentry)

2T + 1C 100 (Paint & Varnishing)
Objective: Max: 7T + 5C
To accompany
Quantitative

7-16

16 2003 by
Prentice Hall, Inc.

Flair Furniture Company

Constraints
120

Number of Chairs

100

Painting/Varnishing

80
60
40

Carpentry

20
0

20

40

60

80

100

Number of Tables
To accompany
Quantitative

7-17

17 2003 by
Prentice Hall, Inc.

Number of Chairs

Flair Furniture Company

Feasible Region

120

Painting/Varnishing

100
80
60
40
20
0

Carpentry
Feasible
Region
20

40

60

80

100

Number of Tables
To accompany
Quantitative

7-18

18 2003 by
Prentice Hall, Inc.

Flair Furniture Company

Isoprofit Lines
120
100

Number of Chairs

Painting/Varnishing
7T + 5C = 210

80

7T + 5C = 420

60

Carpentry

40
20
0

20

40

60

80

100

Number of Tables
To accompany
Quantitative

7-19

19 2003 by
Prentice Hall, Inc.

Flair Furniture Company

Optimal Solution
120
Isoprofit Lines
Number of Chairs

100

Painting/Varnishing

80
60

Solution
(T = 30, C = 40)

40

Carpentry

20
0

20

40

60

80

100

Number of Tables
To accompany
Quantitative

7-20

20 2003 by
Prentice Hall, Inc.

Flair Furniture Company

Optimal Solution
120

Corner Points

2
Number of Chairs

100

Painting/Varnishing

80
60

Solution
(T = 30, C = 40)

40

Carpentry

20

1
0

20

To accompany
Quantitative

4 60
80
Number of Tables
40

7-21

100

21 2003 by
Prentice Hall, Inc.

Soal 1
Boozer Company
memproduksi 2 macam kertas
pembersih (jenis A & B).
Proses produksi kedua jenis
kertas melalui 3 tahap :
pemotongan, pelipatan dan
pengepakan. Pengepakan
dilaukan dlm 2 ukuran , A &
B, setiap unit A berkontribusi
laba sebesar $23 sedangkan
jenis B sebesar $32

To accompany
Quantitative

7-22

22 2003 by
Prentice Hall, Inc.

Soal 1
Spesifikasi
tehnis
Proses

produk
A
B

Kapasita
s per
hari

Pemotongan 10

2500

Pelipatan

10

2000

Pengepakan

500

To accompany
Quantitative

7-23

23 2003 by
Prentice Hall, Inc.

Soal 2
Sebuah pers memproduksi 2
macam brg. Brg A perlu wkt 5
menit utk dipotong dan 10 menit
dirakit, sedangkan B perlu waktu
8 menit utk dipotong & 8 menit
utk dirakit. Waktu yang tersedia
di bgn pemotongan adalah 3 jam
20 menit dan 4 jam di bgn
perakitan. A menyumbang laba $
50/unit dan B sebesar $60/unit.
Persh ingin memaksimalkan laba.

To accompany
Quantitative

7-24

24 2003 by
Prentice Hall, Inc.

Flair Furniture - QM
for Windows

To accompany
Quantitative

7-25

25 2003 by
Prentice Hall, Inc.

Flair Furniture - Excel

To accompany
Quantitative

7-26

26 2003 by
Prentice Hall, Inc.

Holiday Meal Turkey

Ranch
Minimize: X X
Subject to : X X

( A)

X X

(B)

To accompany
Quantitative

7-27

(C)

27 2003 by
Prentice Hall, Inc.

Holiday Meal Turkey

Problem
Corner Points

To accompany
Quantitative

7-28

28 2003 by
Prentice Hall, Inc.

Holiday Meal Turkey

Problem
Isoprofit Lines

To accompany
Quantitative

7-29

29 2003 by
Prentice Hall, Inc.

soal
Seorang pasien dianjurkan utk
minum 2 macam obat:A & B yg
mengandung 2 macam vit 1& 2.
Stp unit A mengandung 2mg vit 1
dan 6 mg vit 2. Sedangkan stp unit
B mengandung 3mg vit 1 dan 2 mg
vit 2. mnt dokter stp thn pasien
hrs menelan min 3500mg vit 1 dan
7000 mg vit 2. setelah dihit biaya
per unit vit A Rp 10,- & B sebesar
Rp 4,5, Bgmn sebaiknya kombinasi A & B
yg hrs ditelan

To accompany
Quantitative

7-30

30 2003 by
Prentice Hall, Inc.

Special Cases in LP
Infeasibility
Unbounded Solutions
Redundancy
Degeneracy
More Than One Optimal
Solution

To accompany
Quantitative

7-31

31 2003 by
Prentice Hall, Inc.

A Problem with No
Feasible Solution
X2

8
6

Region Satisfying
3rd Constraint

4
2
0

X1

Region Satisfying First 2 Constraints

To accompany
Quantitative

7-32

32 2003 by
Prentice Hall, Inc.

A Solution Region That is

Unbounded to the Right
X2
15

X1 > 5

X2 < 10

10

Feasible Region

X1 + 2X2 > 10

To accompany
Quantitative

10

15

7-33

X1

33 2003 by
Prentice Hall, Inc.

A Problem with a
Redundant Constraint
X2
30
25

Redundant
Constraint

2X1 + X2 < 30

20

X1 < 25

15
10

X1 + X2 < 20

Feasible
Region

X1
5

10

To accompany
Quantitative

15
7-34

20

25

30

34 2003 by
Prentice Hall, Inc.

An Example of Alternate
Optimal Solutions
8

Optimal Solution Consists of

All Combinations of X1 and
X2 Along the AB Segment
Isoprofit Line for $8

7
6
5
4

Isoprofit Line
for $12
Overlays Line
Segment

3
B

AB

1
0
1

To accompany
Quantitative

7-35

35 2003 by
Prentice Hall, Inc.

Sensitivity Analysis
Changes in the Objective
Function Coefficient
Changes in Resources (RHS)
Changes in Technological
Coefficients

To accompany
Quantitative

7-36

36 2003 by
Prentice Hall, Inc.

Changes in the Technological

Coefficients for High Note
Sound Co.
(a) Original Problem
X2

(b) Change in Circled

X2
Coefficient

60
40
Stereo Receivers

2X1 + 1X2 < 60

3X1 + 1X2 < 60

20

Optimal Solution

0 a

2X1 + 4X2 < 80

Still Optimal
a

2X1 + 4X2 < 80

d

c
20

e
40 X1

CD Players
To accompany
Quantitative

20

30

40

CD Players
7-37

37 2003 by
Prentice Hall, Inc.

X1

Changes in the Technological

Coefficients for High Note
Sound Co.
(a) Original Problem
X2

(c) Change in Circled

X2
Coefficient

60
3X1 + 1X2 < 60

3X1 + 1X2 < 60

Optimal Solution

Optimal Solution

Stereo Receivers

40
20
0 a

2X1 + 4X2 < 80

2X1 + 5X2 < 80

f

c
20

c
40

X1

CD Players
To accompany
Quantitative

20

40

CD Players
7-38

38 2003 by
Prentice Hall, Inc.

X1