{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

final_Transhipment_assignment

# final_Transhipment_assignment - Assignment on TRANsSHIPMENT...

This preview shows pages 1–4. Sign up to view the full content.

Assignment on TRANsSHIPMENT PROBLEM Submitted by

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
TRANSPORTATION MODEL One important application of linear programming has been in the area of physical distribution of resources, from one place to another to meet a specific set of requirements. It is easy to express a transportation problem mathematically in terms of an LP model, which can be solved by simplex method. Since transportation problem involves a large number of variables and constraints it takes a very long time to solve it by the simplex ways, involving transportation algorithm, namely the stepping stone method, MODI method have been involved for this purpose. The transportation algorithm is used to minimize the total cost of transporting a homogeneous commodity from one plane to another. However, it can also be used to take financial decisions like how the financial resources should be distributed to get maximum possible return. The transportation problem applied to situation in which a single product is to be transported from several sources to several sinks. In the transportation problem it is assumed that a source (factory, plant, etc.) acts only as a shipper of the goods and a destination (market etc.) acts only as receiver of the goods. TRANSHIPMENT PROBLEM The transshipment problem is an extension of the transportation problem in which the commodity can be transported to a particular destination through one or more intermediate or transshipment odes. Each of these nodes in turn supply to other destinations. The objective of the transshipment problem is to determine how many units should be shipped over each node so that all the demand requirements are met with the minimum transportation cost. For example, a multi-plant firm may find it necessary to send some goods from one plant to another in order to meet the substantial increase in the demand in the second market. The second plant here would act both as a source and a destination and there is no real distinction between source and destination. A transportation problem can be converted into a transshipment problem by relaxing the restrictions on the receiving and sending the units on the origins and destinations respectively. An m-origin, n-destination,
transportation problem, when expressed as transshipment problem, shall become an enlarged problem: with m + n origins and an equal number of destinations. With minor modifications, this problem can be solved using the transportation method. If we let the sources and destinations in a transshipment problem as T, then

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 16

final_Transhipment_assignment - Assignment on TRANsSHIPMENT...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online