Linear programming problem

Questions Unit - V
Formation of LPP:
1. The manufacturer of medicines is proposed to prepare a production plan for
medicines A and B. There are sufficient ingredients available to make 20,000
bottles of medicines A and 40,000 bottles of medicine B, but there are only
45,000 bottles into which either of the medicines can be filled. Further, it
takes three hours to prepare enough material to fill 1,000 bottles of medicine
A and one hour to prepare enough material to fill 1,000 bottles of medicine
B. There are 66 hours available for this operation. The profit is Rs.9000 for
medicine A and Rs.10000 for medicine B. Formulate this problem as a LPP.
2. A fir engaged in producing two modules A and B performs three operation
assembly, painting and testing, the relevant data are as follows.
Models Unit sale in Hours required for each
Rs unit
Assemblin Paintin Testin
g g g
A 50 1.0 0.2 0.0
B 80 1.5 02 1.1
Total number of hours are available are assembly 600, painting 100 and
testing 30. Determine weekly production schedule to maximizing revenue.
Formulate the following problem as a linear programming problem.
3. The manufacturer of medicines is proposed to prepare a production plan for
medicines A and B. There are sufficient ingredients available to make
20,000 bottles of medicines A and 40,000 bottles of medicine B, but there
are only 45,000 bottles into which either of the medicines can be filled.
Further, it takes three hours to prepare enough material to fill 1,000 bottles
of medicine A and one hour to prepare enough material to fill 1,000 bottles
of medicine B. There are 66 hours available for this operation. The profit is
Rs.9000 for medicine A and Rs.10000 for medicine B. Formulate this
problem as an LPP to maximize the profit.
4. Let us look at this diet problem, A housewife wishes to mix two types of food
𝐹1 and 𝐹2 in such a way that the vitamin contents of the mixture contain at
least 8 units of vitamin A and 11 units of vitamin B. Food 𝐹1 costs rupees
60/Kg and Food 𝐹2 costs rupees 80/kg. Food F1 contains 3 units/kg of
vitamin A and 5 units/kg of vitamin B while Food 𝐹2 contains 4 units/kg of
vitamin A and 2 units/kg of vitamin B. Formulate this problem as a linear
programming problem to minimize the cost of the mixtures.
5. Vitamins 𝐵1 and 𝐵2 are found in two foods 𝐹1 and 𝐹2. 1 unit of 𝐹1 contains
3 units of 𝐵1 and 4 units of 𝐵2. 1 unit of 𝐹2 contains 5 units of 𝐵1 and 3
units of 𝐵2 respectively. Minimum daily prescribed consumption of 𝐵1 & 𝐵2
is 50 and 60 units respectively. Cost per unit of 𝐹1 & 𝐹2 is Rs. 6 & Rs. 3
respectively. Formulate as LPP.
6. A firm manufacturing two types of electric items A and B, can make a profit
of 20 Rs/- per unit of A and 30 Rs/- per unit of B. Each unit of A requires 3
motors and 2 transformers and each unit of B requires 2 motors 4
transformers. The total supply of these per month is restricted to 210 motors
and 300 transformers. Type B is an export model requiring a voltage
stabilizer which has a supply restricted to 60 units per month. Formulate
the LPP for maximum profit.
Solve the following LP problems by graphical method:
1. Min 𝑧 = 5𝑥1 − 2𝑥2; 𝑠. 𝑡. 2𝑥1 + 3𝑥2 ≥ 1, 𝑥1, 𝑥2 ≥ 0
2. Max. 𝑧 = 5𝑥1 + 3𝑥2; 𝑠. 𝑡. 3𝑥1 + 5𝑥2 ≤ 10, 𝑥1, 𝑥2 ≥ 0
3. Max. 𝑧 = 2𝑥1 + 3𝑥2; 𝑠. 𝑡. 𝑥1 + 𝑥2 ≤ 1, 3𝑥1 + 𝑥2 ≤ 4 𝑥1, 𝑥2 ≥ 0
4. Max. 𝑧 = 2𝑥1 + 3𝑥2; 𝑠. 𝑡. 𝑥1 + 𝑥2 ≤ 1, 3𝑥1 + 𝑥2 ≤ 4 𝑥1, 𝑥2 ≥ 0
5. Min . 𝑧 = 𝑥1 + 2𝑥2; 𝑠. 𝑡. − 𝑥1 + 3𝑥2 ≤ 10, 𝑥1 + 𝑥2 ≤ 6, 𝑥1 − 𝑥2 ≤ 2
6. Max. 𝑧 = 3𝑥 + 2𝑦; 𝑠. 𝑡. −2𝑥 + 3𝑦 ≤ 9, 𝑥 − 5𝑦 ≥ −20: 𝑥, 𝑦 ≥ 0.
Solve the above LPP by Simplex method
1. The following LPP is formulated to get maximum profit (𝑧) by a baker with the
available resources 𝑥1, 𝑥2 and 𝑥3.
𝑀𝑎𝑥 (𝑍) = 2𝑥1 − 𝑥2 + 𝑥3
such that
3𝑥1 + 𝑥2 + 𝑥3 ≤ 60
2𝑥1 + 𝑥2 + 2𝑥3 ≤ 20
−2𝑥1 − 2𝑥2 − 𝑥3 ≥ −20
𝑥1 , 𝑥2 , 𝑥3 ≥ 0
Solve the above LPP by Simplex method to get maximum profit.
2. Solve the above LPP by Simplex method to get maximum profit.
max(𝑧) = 7𝑥1 + 5𝑥2
Subjected to
x1 + 2𝑥2 ≤ 6
4𝑥1 + 3𝑥2 ≤ 12
𝑥1 , 𝑥2 ≥ 0
3. Solve the above LPP by Simplex method to get maximum profit.
Max(𝑧) = 4𝑥1 + 3𝑥2
Subjected to
2x1 + 𝑥2 ≤ 30
𝑥1 + 𝑥2 ≤ 24
𝑥1 , 𝑥2 ≥ 0
4. Using simplex method, solve the following problem:
𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝑍 = 2𝑥1 + 2𝑥2 + 4𝑥3
subject to
2𝑥1 + 3𝑥2 + 5𝑥3 ≤ 2
3𝑥1 + 𝑥2 + 7𝑥3 ≤ 3
𝑥1 + 4𝑥2 + 6𝑥3 ≤ 5
𝑥1 , 𝑥2 , 𝑥3 ≥ 0
5. Using Simplex method solve the following LPP:
Maximize 𝑧 = 4𝑥1 + 10𝑥2
subject to 2𝑥1 + 𝑥2 ≤ 50 , 2𝑥1 + 5𝑥2 ≤ 100 , 2𝑥1 + 3𝑥2 ≤ 90 and 𝑥1, 𝑥2 ≥ 0.
Solve the following using Chame’s Big-M (penalty) method
1. Max 𝑅 = 5𝑥 + 2𝑦 − 𝑧
Subject to constraints: 2𝑥 + 2𝑦 − 𝑧 ≥ 2
3𝑥 − 4𝑦 ≥ 3
𝑦 + 3𝑧 ≥ 5
𝑥, 𝑦, 𝑧 ≥ 0.

2. Minimize 𝑧 = 𝑥1 + 𝑥2 + 3𝑥3
Subject to constraints: 3𝑥1 + 2𝑥2 + 𝑥3 ≤ 3
2𝑥1 + 𝑥2 + 2𝑥3 ≥ 3, 𝑥1, 𝑥2, 𝑥3 ≥ 0.

3. Minimize 𝑧 = 4𝑥1 + 8𝑥2 + 3𝑥3