Transportation, Assignment, and Transshipment Problems
Transportation, Assignment, andTransshipment ProblemsIn this chapter, we discuss three special types of linear programming Problems : transporta-tion, assignment, and Transshipment . Each of these can be solved by the simplex algorithm,but specialized algorithms for each type of problem are much more 1Formulating Transportation ProblemsWe begin our discussion of transportation Problems by formulating a linear programmingmodel of the following has three electric power plants that supply the needs of four cities. Each powerplant can supply the following numbers of kilowatt-hours (kwh) of electricity: plant 1 35 million; plant 2 50 million; plant 3 40 million (see Table 1).
364 CHAPTER7 Transportation, Assignment, and Transshipment Problems Plant 1 Supply points Demand points s 1 = 35 x 11 = 0 x 32 = 5 x 12 = 15 x 14 = 0 x 21 = 40 x 33 = 0 x 23 = 10 x 13 = 20 x 31 = 0 x 34 = 30 x 15 = 0 x 35 = 5 x 24 = 0 x 25 = 0 x 22 = 0 City 1 d 1 = 40 City 2 d 2 = 20 City 3 d 3 = 30 City 4 d 4 = 30 Dummy City 5 d 5 = 5 s 2 = 50 Plant 2 s 3 = 40 Plant 3 FIGURE 2 …
Download Transportation, Assignment, and Transshipment Problems
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: