QM_Chapter_6

# QM_Chapter_6 - MAT540 Quantitative Methods Dr Vargha Azad...

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

Chapter 10 - Transportation, Transshipment, and Assignment Problems MAT540 Quantitative Methods Dr. Vargha Azad

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

View Full Document
Chapter 10 - Transportation, Transshipment, and Assignment Problems 2 Chapter 6 Transportation, Transshipment, and Assignment Problems Quantitative Methods CUSTOM EDITION Edited by Brian K. Saltzer
Chapter 10 - Transportation, Transshipment, and Assignment Problems 3 Chapter Topics Overview The Transportation Model Computer Solution of a Transportation Problem The Transshipment Model Computer Solution of a Transshipment Problem The Assignment Model Computer Solution of the Assignment Model

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

View Full Document
Chapter 10 - Transportation, Transshipment, and Assignment Problems 4 Overview In this chapter, we examine three special types of linear programming model formulations – transportation, transshipment, and assignment problems. Part of a larger class of linear programming problems known as network flow models. Possess special mathematical features that enabled development of very efficient, unique solution methods. Methods are variations of traditional simplex procedure. Detailed description of methods is contained in CD-ROM Module B, Transportation and Assignment Solution Methods . Text focuses on model formulation and solution with Excel and QM for windows.
Chapter 10 - Transportation, Transshipment, and Assignment Problems 5 The Transportation Model Characteristics A product is transported from a number of sources to a number of destinations at the minimum possible cost. Each source is able to supply a fixed number of units of the product, and each destination has a fixed demand for the product. The linear programming model has constraints for supply at each source and demand at each destination. All constraints are equalities in a balanced transportation model where supply equals demand. Constraints contain inequalities in unbalanced models where supply does not equal demand.

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

View Full Document
Chapter 10 - Transportation, Transshipment, and Assignment Problems 6 Grain Elevator Supply Mill Demand 1. Kansas City 150 A. Chicago 200 2. Omaha 175 B. St. Louis 100 3. Des Moines 275 C. Cincinnati 300 Total 600 tons Total 600 tons Transport Cost from Grain Elevator to Mill (\$/ton) Grain Elevator A. Chicago B. St. Louis C. Cincinnati 1. Kansas City 2. Omaha 3. Des Moines
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 06/17/2010 for the course MAT 540 taught by Professor Azad during the Spring '10 term at Strayer.

### Page1 / 32

QM_Chapter_6 - MAT540 Quantitative Methods Dr Vargha Azad...

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

View Full Document
Ask a homework question - tutors are online