Vinod Gupta School of Management

Indian Institute of Technology (IIT) Kharagpur

Quantitative and Statistical Methods (BM70003)
Practice Set - Linear Programming Problems

Date -2024

1. Solve the following linear programming problem:

Maximize Z = 8V
subject to
U −V ≥0
2U + 3V ≤ −6
U, V unrestricted

2. A luxury hotel chain in India is planning to allocate its resources between two ma-
jor services: premium room bookings and exclusive tour packages. The hotel man-
agement wants to maximise its revenue from these services while adhering to resource
constraints.The revenue generated per premium room booking is Rs 6,000, while each
exclusive tour package brings in Rs 3,000. The hotel has limited resources in terms of
staff, time, and other operational capacities, leading to the following constraints: Each
premium room booking requires 2 units of resource, and each exclusive tour package re-
quires 1 unit of resource. The total available resource is 8 units. The combined staff and
time requirements for premium room bookings and exclusive tour packages should not
exceed 18 units, where each premium room booking requires 3 units, and each exclusive
tour package requires 3 units. The hotel can accommodate a maximum of 3 exclusive
tour packages. Formulate it and solve using the Simplex method to determine the opti-
mal number of premium room bookings and exclusive tour packages that will maximise
the hotel’s revenue.

3. Solve the following linear programming problem:

Maximize Z = 4P + Q + 4R + 5S
subject to
4P + 6Q − 5R + 4S ≥ −20
3P − 2Q + 4R + S ≤ 10
8P − 3Q − 3R + 2S ≤ 20
P, Q, R, S ≥ 0

1
4. A manufacturing company is aiming to maximise its profit from producing two types
of components. The profit contribution per unit for Component A is Rs 3, and for
Component B, it is Rs 9. The production process is constrained by two factors: the total
production of Component A plus four times the production of Component B cannot
exceed 8 units, and the total production of Component A plus twice the production
of Component B cannot exceed 4 units. Additionally, the production levels of both
components must be non-negative. Formulate it and solve using the Simplex method to
determine the optimal production levels of Component A and Component B to achieve
the maximum profit.

5. Solve the following linear programming problem:

Minimize Z = 5A + 2B + 10C
subject to
A − C ≤ 10
B + C ≥ 10
A, B, C ≥ 0

6. Solve the following linear programming problem:

Maximize Z = 30X1 + 15X2

subject to
3
X1 + X2 ≤ 200
2
2X1 + X2 ≤ 200
X1 ≤ 200
X1 , X2 ≥ 0

7. A farmer seeks to maximize the profit from growing three different crops: corn, soybeans,
and wheat. Each crop offers varying profit contributions: corn and wheat provide 1 unit
of profit per unit planted, while soybeans offer 2 units of profit per unit. The farm has a
total land area of 1 unit, with each crop requiring different amounts of land: corn needs
1 unit, soybeans need 0.5 units, and wheat also needs 0.5 units. To ensure economic
viability, the total production must exceed 8 units.
The farmer must also manage limited resources. The farm has a water supply of 15 liters,
with each crop requiring different amounts: corn needs 3 liters per unit, soybeans require
2 liters, and wheat uses 1 liter. Additionally, the farmer needs to apply pesticides to
control crop pests. The pesticide supply is constrained to 10 liters, with corn, soybeans,
and wheat needing 4, 3, and 2 liters per unit, respectively. Given these constraints on
land, water, and pesticides, the challenge is to determine the optimal number of units
for each crop to maximize the total profit.

2
 8. Solve the following linear programming problem:

Maximize Z = 5Y1 + 3Y2 + Y3

subject to
Y1 + Y2 + Y3 ≤ 6
5Y1 + 3Y2 + 6Y3 ≤ 15
Y1 , Y2 , Y3 ≥ 0

9. Solve the following linear programming problem:

Maximize Z = 2X1 + 3X2 + X3

subject to
X1 + 2X2 + 4X3 ≤ 4
2X1 + 3X3 ≥ 8
X1 + 4X2 + 3X3 ≤ 3
X1 , X2 , X3 ≥ 0

10. Gourmet Delights Inc. produces three types of gourmet food products: Classic Cookies,
Artisan Bread, and Premium Pastries. The company aims to maximize its total profit
from these products, with each Classic Cookie contributing $4, each Artisan Bread
$5, and each Premium Pastry $6 to the profit. The production is constrained by the
availability of resources. The company has to use at least 1,200 pounds of flour due
to perishability, with Classic Cookies using 2 pounds per unit, Artisan Bread using 4
pounds, and Premium Pastries using 3 pounds. There are also 800 pounds of sugar
available, with Classic Cookies requiring 1 pound per unit, Artisan Bread needing 2
pounds, and Premium Pastries consuming 5 pounds. Additionally, the company has
200 hours of oven time, with Classic Cookies requiring 1 hour per unit, Artisan Bread
needing 1.5 hours, and Premium Pastries 2 hours. Lastly, the company has to use a
minimum of 250 labor hours due to high production, with Classic Cookies requiring
1.5 hours per unit, Artisan Bread needing 2 hours, and Premium Pastries consuming
1 hour. Gourmet Delights Inc. needs to determine the optimal production levels of
Classic Cookies, Artisan Bread, and Premium Pastries to achieve the highest possible
profit while staying within the constraints of flour, sugar, oven time, and labor hours.

11. Solve the following linear programming problem:

Minimize Z = 3G − H − K
subject to
G − 2H + K ≤ 11
− 4G + H + 2K ≥ 3
− 2G + K = 1
G, H, K ≥ 0

3
12. A research lab is working on developing three types of energy devices, labeled X, Y, and
Z. These devices rely on three distinct types of energy sources: M, N, and O. The lab has
set specific constraints for the availability of these energy sources: a maximum of 600
megajoules (MJ) of energy source M, at least 480 MJ of energy source N, and exactly
540 MJ of energy source O are to be utilized. Each type of device consumes different
amounts of these energy sources: Device X requires 3 MJ,2 MJ,2 MJ; Device Y requires 1
MJ,4 MJ,3 MJ; and Device Z requires 4 MJ,2 MJ,3 MJ of M,N,O respectively. In terms
of output, Device X is expected to produce 2 units of energy, Device Y 3 units, and
Device Z 4 units. What production schedule will enable the lab to achieve the highest
total energy output?

13. Solve the following linear programming problem:

Maximize Z = x1 + x2 + x4
subject to
x1 + x 2 + x3 + x4 = 4
x1 + 2x2 + x3 + x4 = 4
x1 + 2x2 + x3 = 4
x1 , x2 , x3 , x4 ≥ 0

14. Solve the following linear programming problem:

Maximize Z = 3x1 + 2x2 + x3

subject to
2x1 + 5x2 + x3 = 12
3x1 + 4x2 = 11
x2 , x3 ≥ 0
x1 is unrestricted

15. Solve the following linear programming problem:

Minimize Z = 2X1 + 3X2

subject to
1 1
X1 + X 2 ≤ 4
2 4
X1 + 3X2 ≥ 20
X1 + X2 = 10
X1 , X2 ≥ 0