Scribd
Upload
57 views

LPP Formulation Sample Question With Solution

The document describes a cargo plane with three compartments that have weight and space capacity limits. There are four available cargoes to ship with different weights, volumes, and profits. The problem is formulated as a linear program to determine how much of each cargo should be allocated to each compartment to maximize total profit while satisfying the capacity and balance constraints. The decision variables are the tons of each cargo allocated to each compartment, and the constraints include not exceeding available cargo amounts, compartment capacities, and maintaining balance. The objective is to maximize total profit from the cargo allocation.

Uploaded by

Ar Arunima Rane
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
57 views

LPP Formulation Sample Question With Solution

The document describes a cargo plane with three compartments that have weight and space capacity limits. There are four available cargoes to ship with different weights, volumes, and profits. The problem is formulated as a linear program to determine how much of each cargo should be allocated to each compartment to maximize total profit while satisfying the capacity and balance constraints. The decision variables are the tons of each cargo allocated to each compartment, and the constraints include not exceeding available cargo amounts, compartment capacities, and maintaining balance. The objective is to maximize total profit from the cargo allocation.

Uploaded by

Ar Arunima Rane
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

A cargo plane has three compartments for storing cargo: front, centre and rear.

These compartments
have the following limits on both weight and space:

Compartment Weight Capacity (tons) Space Capacity (cubic meters)


Front 10 6800
Centre 16 8700
Rear 8 5300

Furthermore, the weight of the cargo in the respective compartments must be the same proportion of
that compartment's weight capacity to maintain the balance of the plane.

The following four cargoes are available for shipment on the next flight:

Cargo Weight (tons) Volume (Cubic meters/ton) Profit (Lakhs/ton)


C1 18 480 31
C2 15 650 38
C3 23 580 35
C4 12 390 28.5

Any proportion of these cargoes can be accepted. The objective is to determine how much (if any) of
each cargo C1, C2, C3 and C4 should be accepted and how to distribute each among the compartments
so that the total profit for the flight is maximised.

• Formulate the above problem as a linear program


Solution
Variables

We need to decide how much of each of the four cargoes to put in each of the three compartments.
Hence let:

xij be the number of tons of cargo i (i=1,2,3,4 for C1, C2, C3 and C4 respectively) that is put into
compartment j (j=1 for Front, j=2 for Centre and j=3 for Rear) where xij >=0 i=1,2,3,4; j=1,2,3

Constraints:

Cannot pack more of each of the four cargoes than we have available

1. x11 + x12 + x13 <= 18


2. x21 + x22 + x23 <= 15
3. x31 + x32 + x33 <= 23
4. x41 + x42 + x43 <= 12

The weight capacity of each compartment must be respected

5. x11 + x21 + x31 + x41 <= 10


6. x12 + x22 + x32 + x42 <= 16
7. x13 + x23 + x33 + x43 <= 8

The volume (space) capacity of each compartment must be respected

8. 480x11 + 650x21 + 580x31 + 390x41 <= 6800


9. 480x12 + 650x22 + 580x32 + 390x42 <= 8700
10. 480x13 + 650x23 + 580x33 + 390x43 <= 5300

The weight of the cargo in the respective compartments must be the same proportion of that
compartment's weight capacity to maintain the balance of the plane

11. [x11 + x21 + x31 + x41]/10 = [x12 + x22 + x32 + x42]/16 = [x13 + x23 + x33 + x43]/8

Objective

The objective is to maximise total profit, i.e.

maximise 310[x11+ x12+x13] + 380[x21+ x22+x23] + 350[x31+ x32+x33] + 285[x41+ x42+x43]

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy