Ch6_TransportTransshipAssignProb

Ch6_TransportTransshipAssignProb - Chapter 6 T rMaster...

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

View Full Document Right Arrow Icon
Click to edit Master subtitle style 11/5/10 BIT 2406 Chapter 6 11
Background image of page 1

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

View Full DocumentRight Arrow Icon
11/5/10 BIT 2406 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 22
Background image of page 2
11/5/10 BIT 2406 Transportation, Transshipment, and 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). 33
Background image of page 3

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

View Full DocumentRight Arrow Icon
11/5/10 BIT 2406 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 44
Background image of page 4
11/5/10 BIT 2406 A Transportation Problem Example: 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 Each mill demands the following number of tons of wheat per month: 55 Grain Elevator Supply 1. Kansas City 150 2. Omaha 175 3. Des Moines 275 Total 600 tons Grain Elevator Demand A. Chicago 200 B. St. Louis 100 C. Cincinnati 300 Total 600 tons
Background image of page 5

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

View Full DocumentRight Arrow Icon
11/5/10 BIT 2406 A Transportation Problem Example: Mill Grain Elevator A. Chicago B. St.
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 35

Ch6_TransportTransshipAssignProb - Chapter 6 T rMaster...

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

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