1.

Currently, State University can store 200 files on hard disk, 100 files in computer memory, and
300 files on tape. Users want to store 300 word-processing files, 100 packaged-program
files, and 100 data files. Each month a typical word-processing file is accessed eight times; a
typical packaged-program file, four times; and a typical data file, two times. When a file is
accessed, the time it takes for the file to be retrieved depends on the type of file and on the
storage medium (see Table 68).
a) If the goal is to minimize the total time per month that users spend accessing their files,
formulate a balanced transportation problem that can be used to determine where files
should be stored.
b) Use the minimum cost method to find a bfs.
c) Use the transportation simplex to find an optimal solution.
2. The Gotham City police have just received three calls for police. Five cars are available. The
distance (in city blocks) of each car from each call is given in Table 69. Gotham City wants to
minimize the total distance cars must travel to respond to the three police calls. Use the
Hungarian method to determine which car should respond to which call.

Penyelesaian :
Soal Nomor 1

Minimize Total Time.

Z = 100*5 + 100*4 +100*1 + 200*10 = 3000

R1 + K 1 = 5

R1 + K 2 = 4

R2 + K 2 = 1

R2 + K 3 = 1

Dengan mengambil R1 = 0 , maka :

R1 = 0
R2 = -3
R3 = 5
K1 = 5
K2 = 4
K3 = 4

K4 = -5

R1 + K 1 = 5

R3 + K1 = 10

R2 + K 2 = 1

R2 + K 3 = 1

R3 + K1 = 10

R3 + K 4 = 0

R3 + K 3 = 6

R3 + K 4 = 0

Dengan mengambil R1 = 0 , maka :

R1 = 0
R2 = 0
R3 = 5
K1 = 5
K2 = 1
K3 = 1

K4 = -5

Z = 200*5 + 100*10 +100*1 + 100*6 + 0*1 + 100*0 = 2700

Soal Nomor 2
Assigment ordo 5 x 5

Langkah 1
Ambil sebuah nilai terkecil pada setiap baris, selanjutnya nilai yang lain pada masing-masing
baris dikurangi dengan nilai terkecil tersebut.
10

11

18

Langkah ke 2
Ambil sebuah nilai terkecil pada setiap kolom, selanjutnya nilai yang lain pada masing-masing
kolom dikurangi dengan nilai terkecil tersebut.
10

11

18

Sehingga menghasilkan
5 -1

7 -1

14 -1

nilai yang tidak terkena garis dikurangi 1

1 -1

3 -1

3 -1

nilai yang terkena garis 2 kali, diambah 1

2 -1

4 -1

1 -1

0 +1

0 +1

0 +1

0 +1

Sehingga nilainya menjadi

4

13

13