This action might not be possible to undo. Are you sure you want to continue?
P. del Rosario Street Brgy. Sta. Cruz Cebu City, Philippines 6000
COLLEGE OF COMMERCE
Department of Accountancy
Quantitative Techniques in Business Management
TTh 12:00-1:30 Problem No. 9 Page 466 Quantitative Approaches to Management 7th Edition (By Levin, Rubin, Stinson and Gardner)
Ritchie Ian V. Carunungan
Mr. Pepito Echavez
September 7, 2010
The airplane’s forward cargo area can hold up to 8. The food is packaged in three different sized cartons. there are 30. Formulate the linear programming problem to help the Friends of Africa determine how many of each type carton should be carried in each of the three cargo areas.000 cubic feet. but the airplane has limited capacity. The aft cargo area can hold up to 6.500 cubic feet.000 pounds with a volume limit of 3. Problem The Friends of Africa have chartered an airplane to fly donated food to the Republic of Zanimez whose residents urgently need food because of severe droughts. Type B cartons weigh 700 pounds and have a volume of 350 cubic feet. Definition of the Problem Type of Carton A B C Cargo Area Forward Center Aft Weight (pounds) 500 700 300 Max Weight (pounds) 8000 10000 6000 Volume (cubic feet) 200 350 100 Max Volume (cubic feet) 3000 4000 2500 Xz = zoo habitat Xs = show area Xra = restaurant area Xre = retail Xg = green areas Xma = maintenance Xw = walkways III.I.000 pounds or 4. Formulation . 40. Currently.000 cubic feet.000 pounds or 2. II. The center cargo area can hold no more than 10. The type A cartons weigh 500 pounds and have a volume of 200 cubic feet. In order to preserve the trim of the aircraft. and 50 cartons of the three types ready to be shipped. so that the total weight carried is maximized. the weight loaded into the three cargo areas must be in proportion to their load capacities. Type C cartons weigh 300 pounds and have a volume of 100 cubic feet.
000125XC1 – 0.000125XB1 + 0.0001XA2 – 0.000125XC1 – 0.000167XA3 – .000125XA1 + 0.000125XA1 + 0.0001XC2 = 0 (11) 0.0.Objective Function Maximize weight = 500[ XA1 + XA2 + XA3] + 700[XB1 + XB2 + XB3] + 300[XC1 + XC2 + XC3] Subject to: • cannot carry more of each of the 3 cartons than available (1) XA1 + XA2 + XA3 ≤ 500 (2) XB1 + XB2 + XB3 ≤ 700 (3) XC1 + XC2 + XC3 ≤ 300 • weight capacity of each cargo area should be respected (4) XA1 + XB1 + XC1 ≤ 8000 (5) XA2 + XB2 + XC2 ≤ 10000 (6) XA3 + XB3 + XC3 ≤ 6000 • volume capacity of each cargo area should be respected (7) 200XA1 + 350XB1 + 100XC1 ≤ 3000 (8) 200XA2 + 350XB2 + 100XC2 ≤ 4000 (9) 200XA3 + 350XB3 + 100XC3 ≤ 2500 • the weight of the cartons in the respective cargo areas must be the same proportion of that cargo area’s weight capacity to preserve the trim of the aircraft [XA1 + XB1 + XC1]/8000 = [XA2 + XB2 + XC2]/10000 = [XA3 + XB3 + XC3]/6000 (10) 0.0001XB2 .000125XB1 + 0.
Final Answer VI. Sensitivity Analysis .000167XC3 = 0 IV. Computer Solution V.0.000167XB3 .0.
Conclusion and Recommendation .VII.