TUGAS

RISET OPERASI
Diajukan Untuk Memenuhi Tugas Mata Kuliah
Riset Operasi Semester III

Disusun Oleh :
Nama

: JONI

NRP

: 09402602

Kelas

: MIF WT4/09

JURUSAN MANAJEMEN
INFORMATIKA
POLITEKNIK PIKSI GANESHA

BANDUNG
2011
Latihan Bab 2
1. a.
Kebutuhan bahan baku /unit
Produk I
Produk II
40
30
25
40
80
50
150
120

Bahan
Baku
A
B
C
Laba

b. Mengenai Karakter Keputusan

X1 produk I
X2 produk II
c. Mempormulasikan Fungsi Tujuan
Z = 150X1 + 120X2
d. Menetapkan batasan Model
40X1 + 30X2 3000
25X1 + 40X2 1500
80X1 + 50X2 3600
e. Formulasi Modelnya adalah
Memaksimalkan Z = 150X1 + 120X2
Terbatas pada 40X1 + 30X2 3000
25X1 + 40X2 1500
80X1 + 50X2 3600
X1 , X2 > 0
2. X1 = Produk I
X2 = Produk II
X3 = Produk III
Memaksimalkan Z = 3X1 + 5X2 + 2X3

Kapasitas
3000
1500
3600

5X1 + 3X2 + 4X3 < 240

4X1 + 6X2 + 3X3 < 400

Formulasi Model :
Memaksimalkan Z = 3X1 + 5X2 + 2X3
Terbatas Pada 5X1 + 3X2 + 4X3 < 240
4X1 + 6X2 + 3X3 < 400
X1 , X2 , X3 > 0
3. Formulasi Model :
Z = 100X1 + 80X2
2X1 + 2X2 > 8
X1 + 3X2 , > 0
4. Formulasi Model :
Z = 150X1 + 400X2 + 600X3
4X1 + 2X2 + 6X3 < 130
3X1 + 4X2 + 9X3 < 170
X1 + 2X2 + 4X3 < 52
X1 > 25
X2 > 130
X3 > 55

Latihan Bab 3
1. a. Z = 4X1 + 5X2
X1 + 2X2 < 10
6X1 + 6X2 < 36

(10,5)
(6,6)

X2 < 4
X1 , X2 > 0
A) X2 < 4
6X1 + 6X2 < 36
6X1 + 24 < 36
6X1 < 36 - 24
X1 > 2
X)

(2,4)
X2 < 2

X1 + 2(2) < 6
X1 > 2

(2,2)

B) X1 + 2X2 < 6 2 2X1 + 4X2 < 12

2X1 + X2 < 8 1 2X1 + X2 < 8
3X2 < 4
X2 < 4/3
X1 + 2(4/3) < 6
X1 + 2(8/3) < 6
X1 < 6 8/3

(10/3, 4/3)

X1 = 10/3
b.

Z = 3X1 + 2X2
X1 + X2 < 6

(6,3)

2X1 + X2 < 8

(4,8)

-X1 + X2 < 1

(-1,2)

X2 < 2

(0,2)

X1 , X2 > 0
c.

Z = 3X1 + 5X2
2X1 < 8

(4,0)

3X2 < 15

(0,5)

6X1 + 5X2 < 30

(5,6)

X1 , X2 > 0
A). X2 = 5
6X1 + 5(5) > 30
6X1 + > 5
X1 > 5/6
(5/6, 5)
B). X2 = 4
6(4) + 5 X2 > 30
5X2 + < 6
X2 < 6/5
(4, 6/5)
d.

Z = 5X1 + 2X2
6X1 + X2 > 6

(1,6)

4X1 + 3X2 > 2

(1/2, 2/3)

X1 + 2X2 > 4

(4,2)

X1, X2 > 0
6X1 + 2X2 > 6 2 6X1 + X2 > 6
X1 + 2X2 > 4

1 6X1 + 12X2 > 24

-11X2 < -8
X2 < 11/-8

X1 + 2(8) > 4
X1 > -12

Latihan Bab 4
1. a. Memaksimalkan Z = 4X1 + 5X2 + 0s1 + 0s2 + 0s3
Terbatas pada

4X1 + 5X2 + S1 = 10

6X1 + 6X2 + S2 = 36
X1 + S1 = 4
X1 , X2 , S1 , S2 + S3 > 0
Cj
0
0

Cj
5
0

Var
dasar
s1
s2
z1
Cj-z1

Kuantitas
10
36
0

Var
dasar
x2
s2
z1
Cj-z1

Kuantitas
2
24
0

4
X1
4
6
0
4

5
X2
5
6
0
5

0
S1
1
0
0
0

0
S2
0
1
0
0

0
S3
0
0
0
0

4
X1
4/5
6-24/5
4
0

5
X2
1
0
5
0

0
S1
1/5
-6/5
1
-1

0
S2
0
1
0
0

0
S3
0
0
0
0

b. Memaksimalkan Z = 2X1 + 3X2 + 0s1 + 0s2

Terbatas pada

X1 + 3X2 + S1 = 6

3X1 + 2X2 + S2 = 6
X1 , X2 , S1 , S2 > 0
Cj
0
0

Cj
3
0

Var
dasar
s1
s2
z1
Cj-z1

Kuantita
s
6
6
0

2
X1
1
3
0
2

3
X2
3
2
0
3

0
S1
1
0
0
0

0
S2
0
1
0
0

Var
dasar
x2
s2
z1

Kuantita
s
2
2
6

2
X1
1/3
7/3
1

3
X2
1
0
3

0
S1
1/3
2/3
1

0
S2
0
1
0

Cj-z1
Cj
3
0

Var
dasar
x2
x1
z1
Cj-z1

Kuantita
s
36/21
6/7
144/21

-1

2
X1
0
12
2
0

3
X2
13
0
3
0

0
S1
4/21
6/21
24/21
24/21

0
S2
3/21
3/7
27/21
-27/21

c. Memaksimalkan Z = 150X1 + 100X2 + 0s1 + 0s2

Terbatas pada

X1 + X2 + S1 = 600

2X1 + X2 + S2 = 1000
X1 , X2 , S1 , S2 > 0
Cj
0
0

Cj
0
150

Cj
100
150

Var
dasar
s1
s2
z1
Cj-z1

Kuantit
as
600
1000
0

150
X1
1
2
0
150

100
X2
1
1
0
100

0
S1
1
0
0
0

0
S2
0
1
0
0

Var
dasar
s1
x1
z1
Cj-z1

Kuantit
as
100
500
7500

150
X1
0
1
150
0

100
X2
1/2
1/2
75
25

0
S1
1
0
0
-1

0
S2
-1/2
1/2
75
-75

Var
dasar
x2
x1
z1
Cj-z1

Kuantit
as
50
475
71250

150
X1
0
1
150
0

100
X2
1
0
100
0

0
S1
2
-1
50
-50

0
S2
-1
1
-50
50

d. Memaksimalkan Z = 4X1 + 2X2 + 0s1 + 0s2

Terbatas pada

1X1 + 2X2 + S1 = 40

4X1 + 3X2 + S2 = 120

X1 , X2 , S1 , S2 > 0
Cj
0
0

Cj
0
4

Var
dasar
s1
s2
z1
Cj-z1

Kuantit
as
10
120
0

4
x1
1
4
0
4

2
x2
2
3
0
2

0
s1
1
0
0
0

0
s2
0
1
0
0

Var
dasar
s1
x1
z1
Cj-z1

Kuantit
as
10
30
120

4
x1
0
1
4
0

2
x2
5/4
3/4
3
-1

0
s1
1
0
0
0

0
s2
-1/4
1/4
1
-1

2. Untuk menyamakan nlkai sisi kiri dengan sisi kanannya

3. 3 Variabel dasar, 4 variabel non dasar
4.

Untuk

menentukan

variable

yang

masuk

berdasarkan

pengamatan pada bari Cj-Zj kita lihat bahwa suatu variable non
dasar akan menghasilkan kenaikan bersih positif terhadap laba
dimana semua nilai baris Cj-Zj pada saatr itu nol atau negative
ini berarti solusi optimal telah tercapai.
5. Variabel dasar variable yang nilainya tidak sama dengan nol,
Variabel non dasar variable yang nilainya sama dengan nol

Latihan bab 5
a. Meminimumkan Z = 8X1 + 6X2 + 0s1 + 0s2 + 0s3 MA1 - M A2
Terbatas pada

4X1 + 2X2 S1 + A1 = 10

-6X1 + 4X2 + S2

= 12

6X1 + X2 S3 + A2

=6

X1 , X2 , S1 , S2 , S2 , A1, A2 > 0
Cj
-M
-M
0

Cj
-M
-M
0

Var
dasar
A1
A2
S2
z1
Cj-Z1
Var
dasar
A1
A2
S3
z1

8
x1
4
1
-6
-5M
8+5M

6
x2
2
1
4
3M
6+3M

0
s1
-1
0
0
M
-M

0
s2
0
0
1
0
0

0
s3
0
-1
0
M
-M

-M
A1
1
0
0
-M
0

-M
A2
0
1
0
-M
0

2
8
-2

8
x1
0
0
1

6
x2
28/6
7/6
-4/6

0
s2
-4/6
0
-1/6

0
s3
0
-1
0

-M
A1
25
0
-6

-M
A2
24
1
-6

-10M

-35/6M

0
s1
23
0
-6
23M

4/6M

8+35/
6M

4/6M

-M

-25
M+2
5

-24
M+2
4

48
8
-2

8
x1
-23
0
1

6
x2
20
7/6
-4/6

0
s2
19/6
0
-1/6

0
s3
0
-1
0

-56

-23M

-127/6

-19/6

8-23M

139/6

19/6

-M

-M
A1
163
0
-6
163
M
162
M

-M
A2
162
1
-6
161
M
160
M

Kuantitas
10
6
12
-16M

Kuantitas

Cj-Z1

Cj
-M
-M
0

Var
dasar
A1
A2
S1
z1
Cj-Z1

Kuantitas

23M

0
s1
161
0
-6
161
M
161
M

b. Meminimumkan Z = 5X1 + 2X2 + 0s1 + 0s2 + 0s3 + MA1 + M A2 + M

A3

Terbatas pada

6X1 + X2 S1 + A1 = 6

4X1 + 3X2 + S2 + A2 = -2
X1 + 2X2 S3 +A3

=4

X1 , X2 , S1 , S2 , S2 , A1, A2 , A2 > 0
Cj
M
M

Cj
M
M

Cj
M
2

Var
dasar
A2
A3
z1
Z1-Cj

Kuantita
s
2
4
6M

5
x1
4
1
5M
5M-5

2
x2
3
2
6M
6M-2

0
s1
0
0
0
0

0
s2
1
0
M
M

0
s3
0
-1
-M
-M

M
A1
0
0
0
M

M
A2
1
0
M
0

M
A3
0
1
M
0

Var
dasar
A1
A3
z1
Z1-Cj

Kuantita
s
2/3
8/3
10/3M

5
x1
4/3
-5/3
-1/3M
-1/3M-5

2
x2
1
0
M
M-2

0
s1
0
0
0
0

0
s2
1/3
0
1/3M
1/3M

0
s3
0
-1
-M
-M

M
A1
0
0
0
M

M
A2
1/3
0
1/3M
1/3M-M

M
A3
0
1
M
M

Var
dasar
A1
X2

Kuantita
s
-6/3
8/3
6/3M+6

5
x1
9/3
-5/3

2
x2
1
0

0
s1
0
0

0
s2
1/3
0

0
s3
0
-1

M
A1
0
0

M
A2
1/3
0

M
A3
0
1

3M-10/3

1/3M

-2

1/3M

3M-10/35

M-2

1/3M

-2

1/3M-M

z1
Z1-Cj

c. Meminimumkan Z = 2X1 + 3X2 + 0s1 - MA1

Terbatas pada

2X1 + 3X2 + S1 = 1

X1 + X2 + A1 = 2
X1 , X2 , S1 , A1 > 0
Cj
0

Var
dasar
S1

Kuantita
s
1

2
x1
2

3
x2
3

0
s1
1

-M
A1
0

-M

A1
z1
Cj-Z1

2
-2M

1
-M
2+M

1
-M
3+M

0
0
0

1
-M
0

Cj

Var
dasar
X2
A1

Kuantita
s
1/3
2/3

3
x2
1
0

1-23M

-1/3M

0
s1
1/3
-1/3
1+1/3
M
1+1/3
M

-M
A1
0
0

z1

2
x1
2/3
1/3
21/3M

3
-M

Cj-Z1

0
1M

Latihan Bab 6
Minimalkan Formulasi Model Dual dari Model Primal
1. Z = 4X1 + 5X2
1X1 + 2X2 < 40
4X1 + 3X2 < 120
X1 , 2X2 < 0
Zd = 40y1 + 5X2
1X1 + 2X2 < 40
4X1 + 3X2 < 120
X1 , 2X2 < 0
2. Minimalkan Z = 3X1 + 5X2 + 2X3
1X1 + 2X2 + X3 > 1000
X1 > 200
X2 > 400
X3 > 300
X1 + X2 + X3 > 1000
- X1 + X2 - X3 < 1000
X3 > 300
X3 > 300
Zd = 1000y1 1000y2 + 200y3 + 400y4 + 300y5 300y6
y1 y2 > 130
y1 y2 > 5
y1 y2 + y3 + y4 + y5 y6 > 2
y1 , y2 , y3 , y4 , y5 , y6 > 0
3. Maximalkan Z = 2X1 + 6X2
X1 + 2X2 < 10
6X1 + 6X2 < 36
X2 < 4
X1 , X2 > 0
Z = 10y1 + 36y2 + 4y3
y1 + 6y2 < 4

2y1 + 6y2 + y3 < 4

y1 , y2 , y3 > 0
4. Minimalkan Z = 2X1 + 6X2
4X1 + 2X2 > 10
-6X1 + 4X2 < 12
6X1 - 4X2 > -12
X1 + X2 > 6
X1 , X2 > 0
Z = 10y1 + 12y2 + 6y3
4y1 + 6y2 + y3 > 6
2y1 - 4y2 + y3 > 6
y1 , y2 , y3 > 0
5. Max Z = 3X1 + 5X2
2X1 < 8
3X2 < 15
6X1 + 5X2 < 30
Z = 15y1 + 8y2
2y1 + 6y2 < 3
3y1 + 5y2 < 5
y1 , y2 > 0
6. Min Z = 5X1 + 2X2
6X1 + X2 > 6
4X1 + 3X2 > 2
X1 + 2X2 > 4
X1 , X2 > 0
Z = 6y1 + 2y2 + 4y3
6y1 + 4y2 + y3 > 5
y1 + 3y2 + 2y3 > 2
y1 , y2 , y3 > 0
7. Max Z = 400X1 + 200X2
X1 + X2 = 30

X1 + X2 = 30
2X1 + 8X2 > 80
-X1 - 8X2 < -30
X1 < 20
-2X1 - 8X2 < -80
X1 , X2 > 0
Z = 30y1 + 08y2 + 20y3

y1 - y2 + y3 < 400
y1 + y2 + y3 < 200
y1 , y2 , y3 > 0