Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 11

Factory

Sample Transportation Tableau


Warehouse W3 25 14 18 12 W1 W2 16 18 27 10 W4 13 23 41 15

Capacity (Supply)

F1 F2 F3

21 17 32

11 13 19 43

Click to edit Master subtitle style

Demand 6
5/13/12

MODI Method for Optimality Check


Factory W1 F1 F2 F3 Demand Column Number 21 17 32 6 v1=17
6

Warehouse W2 16 18 27 10 v2=18
7 3

W3 25 14 18 12 v3=9
1 2

W4 13 23 41 15 v4=23
1 1 4

Capacity Row (Supply) Number 11 13 19 43 u1=-10 u2=0 u3=9

A company is spending Rs.1000 on transportation of its units from three plants to four distribution centres. The supply and demand of units, with unity cost of transportation are given as: Plant D1 F1 F2 F3 Requirement 19 70 40 5 Distribution Centre D2 30 30 10 8 D3 50 40 60 7 D4 12 60 20 15 7 10 18 Availability

What can be the maximum saving by optimal scheduling? (Apply MODI method)

UNBALANCED TRANSPORTATION PROBLEM

We can always meet the balanced condition by introducing a dummy source (if the total demand is more than the total supply) or a dummy destination (if the total supply is more than the total demand).

5/13/12

UNBALANCED TRANSPORTATION PROBLEM


A company has received a contract to supply gravel for three new construction projects located in towns A,B and C. Construction engineers have estimated the required amounts of gravel which will be needed at these construction projects. Project Location A B C Weekly Requirement (Truck loads) 144 204 82

The company has three gravel pits located in towns,W,X and Y respectively. The gravel required by the construction projects can be supplied by these three plants. The amount of gravel which can be supplied by W X Y each plant is Plant as follows: Amount Available 152 164 154 (truck loads)

5/13/12

The company has computed the delivery cost from each plant to each project site. These costs (in rupees) are shown in the following table: Cost per truck load (000 Rs.) A Plant W X Y 8 32 16 B 16 48 32 C 16 32 48

MAXIMISATION TRANSPORTATION PROBLEM

5/13/12

XYZ Co. has provided the following data seeking your advice on optimal investment strategy:
Investment made at the beginning of year Net return data (in paise) of selected Investments P Q R S Amount Available (lacs.)

1 2 3 4 Maximum Investment(lacs.)

95 75 70 60 40

80 65 45 40 50

70 60 50 40 60

60 50 40 30 60

70 40 90 30

P, Q, R and S represent the selected investments. The company has decided to have four year investment plan. The policy of the company is that amount invested in Any year will remain so until the end of the fourth year. The values (paise) in the table Represent net return on investment of one rupee till the end of the planning horizon. (For example, a rupee invested in Investment P at the beginning of year 1

Prohibited and Preferred Routes

A manufacturer must produce a product in sufficient quantity to meet contractual sales in next four months. The production capacity and unit cost of production vary from month to month. The product produced in one month may be held for sales in later months but at an estimated storage cost of Re.1 per unit per month. There is no opening inventory and none is desired at the end of four months. The necessary details are given in the following table:
Month 1 2 3 4 Contracted Sales 20 30 50 40 Maximum Production 40 50 30 50 Unit cost of Production 14 16 15 17

How much should the manufacturer produce each month to minimize total cost?

A firm owns facilities at six places. It has manufacturing plants at places A, B and C with daily production of 50, 40 and 60 units respectively. At point D, E and F it has three warehouses with daily demands of 20, 95 and 35 units respectively. Per unit shipping costs are given in the following table. If the firm wants to minimize its total transportation cost, how should it route its products? Use NWC method for initial bfs.
Warehouse D A Plant B C 6 3 4 E 4 8 4 F 1 7 2

Solve the following transportation problem:


Destination D1 S1 Source S2 S3 S4 Demand 2 3 5 1 7 D2 7 3 4 6 9 D3 4 7 1 2 18 Supply 5 8 7 14 34

You might also like