.

Sunday, December 8, 2013

Transport

Stateline Shipping and Transport Company Quantitative Methods March12, 2012 1. In Excel, or other suitable program, develop a set for impartation the drive away directly from the 6 plants to the 3 unsheathed disposition sites. Objective function of the manager is to minimize the centre transportation cost for all shipments. The objective function is the kernel of the single(a) shipping costs from severally plant to each photocopy presidency site: Minimize Z = 12x11+ 15x12+ 17x13+ 14x21+ 9x22+ 10x23+ 13x31+ 20x32 +11x33 +17x41 +16x42 +19x43 +7x51 +14x52 +12x53 +22x61 +16x62 +18x63 The timiditys in the computer simulation atomic estimate 18 the number of place of gass acquirable per week at each plant and the number of lay of wastes accommodated at each waste disposal site. There ar nine constraints- angiotensin converting enzyme for each plant supply and adept for each waste disposal sites demand. The sextet supply constraints are: X11+ X12+ X13 = 35 X21+ X22+ X23 = 26 X31+ X32 +X33 = 42 X41 + X42 +X43 = 53 X51 +X52 +X53 = 29 X61 + X62 +X63 = 38 The supply constraint X11+ X12+ X13 = 35 act the number of barrel transported from the plant Kingsport to all the three waste disposal sites. The measuring rod transported from Kingsport is limited to the 35 barrels available.
Ordercustompaper.com is a professional essay writing service at which you can buy essays on any topics and disciplines! All custom essays are written by professional writers!
The three demand constraints are: X11+ X21+ X31+X41+ X51+X61 ? 65 X12+ X22+ X32+ X42+X52 +X62 ? 80 X13+ X23+X33+ X43+X53 +X63 ? one hundred five Here the demand constraint X11+ X21+ X31+X41+ X51+X61 ? 65 symbolize the number of barrels transported to the waste disposal site Whitewater from all the 6 pl! ants. The barrel of wastes that can take in the waste disposal site Whitewater is limited to 65 barrels. The demand constraints are ? inequalities because the add up demand (65+80+105) = 250 exceeds the total supply (26+42+53+29+38) = 223. The linear program model for the transportation puzzle is summarizing as follows: Minimize Z = 12x11+ 15x12+ 17x13+ 14x21+ 9x22+ 10x23+ 13x31+ 20x32 +11x33 +17x41 +16x42 +19x43 +7x51 +14x52 +12x53...If you want to get a full essay, order it on our website: OrderCustomPaper.com

If you want to get a full essay, visit our page: write my paper

No comments:

Post a Comment