Page 136 - DCOM303_DMGT504_OPERATION_RESEARCH
P. 136

Unit 6: Transportation Problem – Optimality Tests




          5.   Solve the following transportation problems.                                     Notes
               (a)
                      From                        To                      Available
                                     A            B            C
                       I             50           30           220           1
                       II            90           45           170           3
                       III           250          200          50            4
                   Requirement        4            2            2

               (b)
                        From                     To                    Available
                                        A        B         C
                          I             6        8         4              14
                          II            4        9         8              12
                         III            1        2         6              5
                       Demand           6       10        15

          6.   A potato chip manufacturer has three plants and four warehouses. Transportation cost for
               shipping from plants to warehouses, the plant availability and warehouses requirements
               are as follows:

                          Plants                  Warehouses          Plant Availability
                                                                         (quintals)
                                           W1     W2     W3    W4
                            F1              7      4     3      5          235
                            F2              6      8     7      4          280
                            F3              5      6     9     10          110
                    Requirements (quintals)   125   160   110   230        625

               Find optimum shipping schedule.
          7.   Solve

                                                Destination               Available
                                      1        2        3        4
                         1            21       16       25       13          11
                         2            17       18       14       23          13
                         3            32       27       18       41          19
                     Requirement      6        10       12       15          43

          8.   Find the optimal solution.
                                     D1        D2        D3       D4       Available
                        O1           23         27       16       18         30
                        O2           12         17       20       51         40
                        O3           22         28       12       32         53
                      Required       22         35       25       41         123

               The cell entries are unit transportation cost.



                                           LOVELY PROFESSIONAL UNIVERSITY                                   131
   131   132   133   134   135   136   137   138   139   140   141