上市公司参与中国私募股权投资策略。。课件.pptVIP

Topic – 9Transportation Problem Transportation Problem Major Characteristics: Several sources (plant) with given supply capacity. Several destinations (warehouse) with given demand. Cost Matrix: unit transportation cost from each source to each destination. Assumptions: No transshipment between any two destinations/two sources. All demand/capacity constraints should be attempted to meet. Decisions: How much should be shipped from each source to each destination so that total transportation cost is minimized? Why Develop a New Method? (LP can certainly be applied) LP is still NP-complete to large size problems. Computational efficient methods are desirable to large size problems. Transportation Problem Model: Tabular Presentation Transportation Cost Transportation Table Steps in Solving the Transportation Problem Solution Procedure 1. Balancing Table: Make ∑di = ∑Si add a Dummy source when ∑di ∑Si, or add a Dummy destination when ∑Si ∑di. 2. Finding an initial solution: (several methods) Upper-Left Corner (Northwest) Method Least-Cost (Large-Profit) Method VAM Method 3. Testing Optimality: (Can current solution be improved?) Stepping-stone Procedure Modified-Distribution Method 4. Improving current solution toward a better solution. Special cases in Transportation Problem: Prohibited transportation route (take large M as cost) Multiple optimal solution is possible. Transshipment allowed/Route shipment capacity limits (All special cases can be easily formulated and solved by LP.) Application Examples: Production Planning/Scheduling/Routing Selection/.... Transportation ProblemMaximization Objectives Problem Description Klein Chemicals, Inc. manufactures a product at two plants (Clifton Springs and Danville) and ships it to four different customers (denoted D1, D2, D3 and D4) Profit per unit for shipping from each plant to each customer. Profit Per Unit: Plant Capacities and Customer Orders: The Stepping-Stone Method Select any unused square to evaluate. Begin at