soal program linier

5
9. Solve the following transportation problem by the uv- method, using any one of the available methods for finding an initial solution. D 1 D 2 D 3 D 4 D 5 D 6 D 7 a i O 1 40 O 2 50 O 3 90 O 4 30 O 5 60 b j 20 30 40 80 60 25 15 270 Penyelesaian: Berdasarkan tabel diatas, disusun dengan menggunakan metode modi sebagai berikut: D 1 D 2 D 3 D 4 D 5 D 6 D 7 R i u i O 1 20 - 20 + -6 -4 -4 -7 1 40 5 O 2 + 6 10 - -1 40 -2 -2 -1 50 6 O 3 1 0 40 40 10 -7 1 90 3 O 4 -5 -2 -3 -1 30 -2 -2 30 9 O 5 2 -4 1 4 20 25 15 60 6 b j 20 30 40 80 60 25 15 270 8 6 10 12 9 11 3 7 6 9 8 7 8 3 3 9 9 6 6 4 5 17 12 11 13 10 12 7 5 5 4 11 7 2 5 6 1 12 9 1 5 8 3 7 6 9 8 7 8 5 4 2 6 3 9 3 17 12 1 13 9 1 12 7 11 4 5 6 5 7

Upload: rany-euracia-cieedira

Post on 09-Nov-2015

15 views

Category:

Documents


1 download

DESCRIPTION

proglin

TRANSCRIPT

9. Solve the following transportation problem by the uv-method, using any one of the available methods for finding an initial solution.D1D2D3D4D5D6D7ai

O18

610129 11540

O23

76987850

O35

426393 90

O417

1211139101230

O57

114565760

bj20304080602515270

Penyelesaian:Berdasarkan tabel diatas, disusun dengan menggunakan metode modi sebagai berikut:

820 -6 20 +10 -612 -49 -411 -75 1

405

3 + 6 7 10 -6 -19 408 -27 -28 -1506

5 14 02406403109 -73 1903

17 -512 -211 -313 -19 3010 -212 -2309

7 211 -44 15 4620525715606

20304080602515270

31-130-11

810 -63010 012 29 211 15 7 + 4011

310

+7 -66 -1940 -8 -27 -28 -1506

5 -54 -6240640

+310 -9 -73 1903

17- 11

12 -811 -313 -1930 10 -212 -2309

7 -411-104 15 -2620 + 5 25715 -606

20304080602515270

-3-5-130-11

8 -7630 10 -712 -59 -511 -85 10

404

320

7 16 -19308 -27 -28 -1506

5 -54 12 406 50 -3 0 +9 -73 1903

17 -1112 111 -313 193010 -212 -2309

7 -411 -34 15 + 4630 - 52575606

20304080602515270

-32-130-11

8-116 30 10-1112 -99-911 -85 10

405

3 20

7 56 -1930

8 -27 28 3506

5 -54 52 406 20 -3309 -33 + 5903

17 -1112 311 -313 -193010 212 -2309

7 -811 -34 -3530+6 -45257 5 -606

20304080602515270

31-130-11

8 -6

6 30 10 -612 -49 -411 -35 10

405

320

7 06 -19 30-8 -27 2 +8 -2506

5 -54 02 406 15 3309 -33 5903

17 -1212 -211 -313 -19 3010 212 -3309

7

-811 -84

-3535+

6 -4525 -7 -560 6

20304080602515270

31-130-11

8 -6

630 10 -612 -49 -411 -55 10

408

320

7 06 -19 5

8 -27 258 -2509

5 -54 02 406 15 3309 -53 5906

17- 1112 -211 -313 -193010 0123012

7 -811 -84 -3560

6 -45 -27 -5605

20304080602515270

-6-2-40-3-2-3

Karena maka tabel sudah optimum sehingga:Fmin = 30(6) + 10(5) + 20(3) + 5(9) + 25(7) + 40(2) + 15(6) + 30(3) + 5(3) + 30(9) + 60(5) = 180 + 50 + 60 + 45 + 175 + 80 + 90 + 90 + 15 + 270 + 300 = 1355