Scribd
Upload
658 views

First Cargo Scond Cargo Third Cargo Fourth Cargo

There are three cargo compartments on a plane with weight and space capacity limits. Four types of cargo are offered for shipment, each with different profit amounts and weight capacities. The objective is to determine how much of each cargo to accept and how to distribute it among the compartments to maximize total profit, while satisfying the capacity constraints. This can be modeled as a linear programming problem with decision variables xij representing the amount of cargo i in compartment j, and constraints for the compartment weight limits, individual cargo weight limits, compartment space limits, and maintaining the proper weight balance of the plane.

Uploaded by

Özlem Yurtsever
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
658 views

First Cargo Scond Cargo Third Cargo Fourth Cargo

There are three cargo compartments on a plane with weight and space capacity limits. Four types of cargo are offered for shipment, each with different profit amounts and weight capacities. The objective is to determine how much of each cargo to accept and how to distribute it among the compartments to maximize total profit, while satisfying the capacity constraints. This can be modeled as a linear programming problem with decision variables xij representing the amount of cargo i in compartment j, and constraints for the compartment weight limits, individual cargo weight limits, compartment space limits, and maintaining the proper weight balance of the plane.

Uploaded by

Özlem Yurtsever
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

3-4-15 A cargo plane has three compartments for storing cargo: front, center, and back.

These compartments have capacity limits on both weight and space, as summarized below:

Furthermore, the weight of the cargo in the respective compartments must be the same proportion of that compartments weight capacity to maintain the balance of the airplane. The following four cargoes have been offered for shipment on an upcoming flight as space is available:

Any portion of these cargoes can be accepted. The objective is to determine how much (if any) of each cargo should be accepted and how to distribute each among the compartments to maximize the total profit for the flight. Formulate a linear programming model for this problem. xij =the number of tons of cargo type i=1,2,3,4 stowed in compartment j= 1,2,3 [front, center, back] Max Z = 320 (x11 + x12+ x13) + 400 (x21 + x22+ x23) + 360 (x31 + x32+ x33) + 290 (x41 + x42+ x43)
First cargo Scond cargo Third cargo Fourth cargo

St: Compartment Weight Capacity constraints: Front compartment weight capacity constraint : x11 + x21 + x31 + x41 12 Center compartment weight capacity constraint: x12 + x22 + x32 + x42 18 Back compartment weight capacity constraint: x13 + x23 + x332+ x43 10 Cargo Weight Capacity Constraints: First cargo weight capacity constraint: x11 + x12+ x13 20 Second cargo weight capacity constraint: x21 + x22+ x23 16 Third cargo weight capacity constraint: x31 + x32+ x33 25 Fourth cargo weight capacity constraint: x41 + x42+ x43 13 Compartment Space Capacity constraints: Front compartment space capacity constraint: 500x11 +700 x21 + 600x31 + 400x41 7000 Center compartment space capacity constraint: 500x12 + 700 x22 + 600 x32 +400 x42 9000 Back compartment space capacity constraint: 500x13 +700 x23 +600 x332+ 400 x43 5000

Airport Balance Constraints: Lets say: Front compartment weight = 12 k, Center compartment weight = 18 k and Back compartment weight=10 k, so; 1/12 Front compartment weight = 1/18 Center compartment weight = 1/10 Back compartment weight: 1/12 (x11 + x21 + x31 + x41) + 1/18 (x12 + x22 + x32 + x42) + 1/10 (x13 + x23 + x332+ x43) Nonnegativity Constraint: All xij 0

You might also like