Exam N a me___________________________________

TRUE/FALSE. Write 'T' if the statement is true and 'F' if the statement is false. 1) T ransportation an d assign ment p roblems are reall y li near program mi ng tech niqu es calle d net w or k flo w p roblems. 2) T ransportation mo dels m ay be use d w hen a fir m is tr y i ng to d eci de w here to locate a ne w facilit y. 3) A t y p ical transportation p roblem m a y ask the q uestion, " H o w man y of X shou l d be shi p ped to point E from so u rce A ?" 4) In fin d i ng the m axi m u m q u antit y that can be sh i p p ed on the least costl y rou te usi ng the step p in g- stone m etho d, one exa mi nes the close d path of p lus an d mi n us signs d ra w n an d selects the sm allest nu mber fou n d i n those sq uares contai ni ng m i n us signs. 5) U sing the step p ing - stone method to sol v e a m axi mi z ation p roblem, w e w o u l d choose the ro u te w ith the largest positi v e im pro vem ent i n d ex. 6) O ne of the ad v antages of the step p ing - stone met hod is t hat if, at a particu lar iteration, we accid entall y choose a rou te that is not the best, the on ly penalt y is to perfor m a d d itional iterations. 7) T he transportation algorithm can be used to sol ve both m ini mi z ation p roblems and m axi mi zation problems. 8) A ssign m ent problems i n v ol ve determin i ng th e most efficien t assig n ment of people to projects, salesmen to territories, contracts to bi d ders, an d so on. 9) T he objecti ve of an assign m ent proble m solution most often is to m in imi z e the total costs or ti m e of p erform i ng the assigne d tasks. 10) In the assign ment p roblem, the costs for a d u m m y ro w w ill be equ al to the lo w est cost of the col u mn for each resp ectiv e cell i n that ro w . 1)

2)

3)

4)

5)

6)

7)

8)

9)

10)

1

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
Table 9-1

11) W hat is the total cost represented by th e sol ution sho w n i n T abl e 9- 1? A ) 60 B) 2600 C ) 2500 D ) 500 E) N one of the abo ve 12) W hat is the v alu e of the i m p rov ement i n dex for cell B1 sho w n i n Table 9- 1? A ) +2 B) - 50 C ) +1 D ) +3 E) N one of the abo ve

11)

12)

2

Table 9-3

T he follo w i ng i m p ro v em ents are pro v ed for T able 9- 3: Cell A1 A3 B2 B- D ummy C1 C2 Improvement Index +2 +6 +1 +2 +2 +1

13) T he cell i m p rov em ent i n dices for Table 9- 3 su ggest that the op ti mal sol u tion has been fou n d. Base d on this solu tion, ho w man y u nits w o u l d actuall y be sen t from sou rce C? A ) 180 B) 10 C ) 170 D ) 250 E) N one of the abo ve 14) Both transportation an d assign ment problems are mem bers of a categor y of L P techniq ues cal led ________. A ) transshi p m ent p roblems B) net w or k flo w p roblems C ) sou rce- d esti natio n p roblems D ) H u ngarian p roblems E) su p pl y an d d eman d p roblems 15) T ransportation m od els can be use d for w hich of the follo w i ng d ecisions? A ) p ro d uction mix B) m ed ia selection C ) facilit y location D ) em p lo y ee shift sched u ling E) portfolio selection

13)

14)

15)

3

16) T he t w o most co m mo n objecti v es for t he assign m ent p roblem are the mi nim i zation of ________. A ) total costs or uncertai nty B) total costs or i nexp erience C ) total costs or total time D ) u ncertaint y or inexp erience E) total tim e or i nex perience
Table 9-11

16)

17) A com p any m ust assign m echan ics to each of fo u r jobs. T he tim e in v ol v e d varies accor d ing to i n d i vi d ual abilities. Table 9- 11 sho w s h o w man y m in utes it ta kes each mechanic to perfor m each job. If the op ti m al assign m ents are m a d e, ho w m an y total m i nu tes w o u l d be requ ire d for co m pleti ng t he jobs? A ) 16 B) 0 C ) 17 D) 4 E) N one of the abo ve
Table 9-12

17)

18) G i v en T able 9- 12, the fi nal table for an assign m ent problem, w