Transportation Problems Assignment Help Transports different quantities of a similar commodity to different destinations in such a way that the

total cost of transportation is minimized. In this sample assignment on Transportation Problems, we are going to extend the theory of linear programming to linear programming problems, namely, the Transportation and Assignment Problems. We can sol e both the problems by the simple method. We will explain this topic more clearly by setting up a Transportation problem. Example: A construction company transports raw materials from three plants, P, ! and ", to three construction #ites, a, b and c. The plants are able to supply the following numbers of tons per wee$ Plant P ! " The requirements of the sites, in number of tons per wee$, are Construction site a b c Demand (&& (&& %&& Supply (capacity) %&& %&& '&&

The cost of transporting of ' ton raw materials from each plant to each site. )ow, illustrate how to set up a transportation problem. We can sol e this transportation problem by many ways, but we are sol ing it through the )orth West corner rule. *ther methods can be found in standard texts on linear programming. Nort !est Corner "ule +ou ha e to start by selecting the cell in the most ,)orth-West. corner of the table. )ow, assign the maximum amount to this cell that is allowable based on the requirements as well as the capacity constraints. )ow, exhaust the capacity from each row before mo ing down to another row. /xhaust the necessity from each column before mo ing right to another column. 0hec$ to ensure that the capacity and necessities are met. 1anufactures office des$s at three locations2 P, ! and ". The company distributes the des$s through regional warehouses located in a, b and c.

Sources '&& 3nits %&& 3nits %&& 3nits

Destinations %&& 3nits (&& 3nits (&& 3nits

Capacities

S ipping "outes

Demands

We are assuming that the production costs per des$ are identical at each factory. The only pertinent costs are those of shipping from e ery source to e ery destination. The costs are in the figure gi en below2

#rom a b c

Top

$ 45 47 48

% 46 46 49

% 4% 4% 49

)ow, we will construct a transportation table and label its different element as show below

#rom a b c "equirements

Top

$ 45 47 48 %&& (&&

% 46 46 49

% 4% 4% 49 (&&

Capacity '&& %&& %&& 9&&

After sol ing it, we will the first feasible solution for this issue is 46(&&. :or complete solutions or detailed solution, contact to http2;;www.pay6paper.com; !it t e elp o& t is assignment' students (ill be able to: :ormulate special linear programming problems using the transportation model. <ow to define a balanced transportation problem =e elop an initial solution of a transportation problem by using the )orthwest 0orner "ule.

 #ol e the problems with the <ungarian method.