minimizing problems

what is missing now

2. Suppose that the Wireless Widget (WW) company has six warehouses supplying eight vendors with their widgets. Each warehouse has a supply of widgets that can not be exceeded, and each vendor has a demand for widgets that must be satisfied. Formulate a balanced transportation problem to minimize the sum of costs. WW wants to determine how many widgets to ship from each warehouse to each vendor so as to minimize the total shipping cost? V1 V2 V3 V4 V5 V6 V7 WH1 6 2 CO 7 4 0001 WH2 4 9 5 5 3 00 WH3 5 1 1 OD 7 4 3 WH4 7 7 3 9 9 2 7 WH5 2 3 9 5 7 N 6 WH6 5 5 N 2 2 8 1 4 Widget Demand 37 22 32 41 32 43 3. Four building companies have presented their projects to a competition called to build buildings A, B, C and D. Each builder must be assigned the construction of a building. The following tableau shows the time each building company needs to build each of the buildings. The objective is to assign the construction of a building to each building company so that the total building time is minimized. 1 2 3 4 A 58 58 60 54 B 66 70 70 78 C 106 104 100 95 21 D52 54 64 54 2. Suppose that the Wireless Widget (WW) company has six warehouses supplying eight vendors with their widgets. Each warehouse has a supply of widgets that can not be exceeded, and each vendor has a demand for widgets that must be satisfied. Formulate a balanced transportation problem to minimize the sum of costs. WW wants to determine how many widgets to ship from each warehouse to each vendor so as to minimize the total shipping cost? V1 V2 V3 V4 V5 V6 V7 WH1 6 2 CO 7 4 0001 WH2 4 9 5 5 3 00 WH3 5 1 1 OD 7 4 3 WH4 7 7 3 9 9 2 7 WH5 2 3 9 5 7 N 6 WH6 5 5 N 2 2 8 1 4 Widget Demand 37 22 32 41 32 43 C doguakdeniz-my.sharepoint.com 30 W Type A.docx / V1 V2 V3 V4 V5 V6 V7 V8 Widgets On Hand 6 WH1 6 7 4 2 5 9 60 WH2 4 5 5 2 55 O NON WH3 5 1 4 3 51 O NON WH4 7 6 7 1 43 WH5 A A N - NN 6 5 41 2 3 95 7 5 5 2 2 8 35 37 22 3241 WH6 4 3 52 32 4338 Widget Demand