Ch6_TransportTransshipAssignProb

Ch6_TransportTransshipAssignProb - Transportation,...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
Chapter 6 Chapter 6 Transportation,  Transportation,  Transshipment, and  Transshipment, and  Assignment Problems Assignment Problems BIT 2406 1
Background image of page 1

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

View Full DocumentRight Arrow Icon
Chapter Topics Chapter Topics The Transportation Model Computer Solution of a Transportation Problem The Transshipment Model Computer Solution of a Transshipment Problem The Assignment Problem Computer Solution of an Assignment Problem BIT 2406 2
Background image of page 2
Transportation, Transshipment, and  Transportation, Transshipment, and  Assignment Problems Assignment Problems Part of a larger class of linear programming  problems known as network flow problems. Represent a popular group of linear programming  applications. Have special mathematical characteristics that have  enabled management scientists to develop very  efficient, unique mathematical solution approaches  to them – variations of the traditional simplex  solution procedure (transportation method and  assignment method). BIT 2406 3
Background image of page 3

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

View Full DocumentRight Arrow Icon
The Transportation Model The Transportation Model In a transportation problem, items are allocated from  sources to destinations at a minimum cost. The transportation model is formulated for a class of  problems with the following unique characteristics: (1) a product is transported from a number of sources  to a number of destinations at the minimum possible  cost; and  (2) each source is able to supply a fixed number of  units of the product, and each destination has a fixed  demand for the product. BIT 2406 4
Background image of page 4
A Transportation Problem  Example:  Example:  Problem Definition Problem Definition Wheat is harvested in the Midwest and stored in grain elevators in three different  cities – Kansas City, Omaha, and Des Moines.  These grain elevators supply  three flour mills, located in Chicago, St. Louis, and Cincinnati.  Grain is shipped to  the mills in railroad cars, each car capable of holding 1 ton of wheat.  Each grain  elevator is able to supply the following number of tons (i.e., railroad cars) of wheat  to the mills on a monthly basis:               Each mill demands the following number                                                                                of tons of wheat per month: BIT 2406 5 Grain  Elevator Supply 1. Kansas City 150 2. Omaha 175 3. Des Moines
Background image of page 5

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

View Full DocumentRight Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/04/2010 for the course MKTG 3340 taught by Professor Smith during the Spring '10 term at Roanoke.

Page1 / 35

Ch6_TransportTransshipAssignProb - Transportation,...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online