Transcription of Transportation, Assignment, and Transshipment Problems
{{id}} {{{paragraph}}}
Example: stock market
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 1 Formulating 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). The peak power de-mands in these cities, which occur at the same time (2 ), are as follows (in kwh): city1 45 million; city 2 20 million; city 3 30 million; city 4 30 million.
a transportation problem (see Problem 7 at the end of this section). If i m i 1 s i j n j 1 d j then total supply equals total demand, and the problem is said to be a balanced trans-portation problem. For the Powerco problem, total supply and total demand both equal 125, so this is a
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: