管理科学06-运输配送模型.ppt

Chapter 6 - Transportation, Transshipment, and Assignment Problems Chapter Topics * * Chapter 6 Transportation, Transshipment, and Assignment Problems Introduction to Management Science 8th Edition by Bernard W. Taylor III The Transportation Model Computer Solution of a Transportation Problem The Assignment Model Computer Solution of the Assignment Model Overview 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. 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. 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 Transportation Model Example Problem Definition and Data Problem: How many tons of wheat to transport from each grain elevator to each mill on a monthly basis in order to minimize the total cost of transportation? Data: Minimize Z = $6x1A + 8x1B + 10x1C + 7x2A + 11x2B + 11x2C +