运筹学与供应链管理第5讲.pptxVIP

第五讲 Transportation and Network Models;Introduction;Introduction;Transportation Model;Demand;;Transportation Model;The goal is to minimize total transportation cost.; TO DESTINATION FROM ORIGIN 1 2 3 4 A 120xA1 130xA2 41xA3 59.50xA4 B 61xB1 40xB2 100xB3 110xB4 C 102.50xC1 90xC2 122xC3 42xC4;Two general types of constraints.;2. Demand at each plant must be satisfied. ;Variations on the Transportation Model;When supply and demand are not equal, then the problem is unbalanced. There are two situations:;In this case, the LP model has no feasible solution. However, there are two approaches to solving this problem:;2. Revise the model to append a placeholder  origin, called a dummy origin, with supply equal to the difference between total demand and total supply.;Certain routes in a transportation model may be unacceptable due to regional restrictions, delivery time, etc.;Generally, LP models do not produce integer solutions. ;Assignment Model;We will use the AutoPower example to illustrate Assignment problems.;The issues to consider in assigning the different vice-presidents to the plants are:;The following table lists the assignment costs in $000s for every vice-president/plant combination.; PLANT Leipzig Nancy Liege Tilburg V.P. (1) (2) (3) (4) Finance (F) 24 10 21 11 Marketing (M) 14 22 10 15 Operations (O) 15 17 20 19 Personnel (P) 11 19 14 13 ;Complete enumeration is the calculation of the total cost of each feasible assignment pattern in order to pick the assignment with the lowest total cost. ;1. F can be assign