UNIT II

1. What is LPP in OR?

2. Define Vogel’s method in transportation Problem.
3. what are the limitations of the Linear programming.
4. What is Degeneracy ?how it occurs and how it can be resolved while solving for
transportation problem?
5. Describe steps involved in North West Corner method for solving Transportation
Problem.
6. Solve the following linear programming problem by graphical method:
Maximize Z= 6L1 + 11L2

• Subject to:
• 2L1 + L2 ≤
104 L1 +
2L2 ≤ 76
• and L1 ≥ 0, L2 ≥ 0.

7. Discuss the steps for initial feasible solution of Transportation Problem by using
Least Cost Method.
8. A factory is engaged in manufacturing two products A and B which involve lathe
work, grinding and assembling. The cutting, grinding and assembling times
required for one unit of A are 2, 1 and 1 hour respectively and for one unit of B are
3, 1 and 3 hours respectively. The profits on each unit of A and B are Rs. 2 and
Rs. 3 respectively. Assuming that 300 hours of lathe time, 300 hours of grinding
time and 240 hours of assembling time are available, pose a linear programming
problem in terms of maximizing the profit on the items manufactured.
9. A firm engaged in producing 2 models X1, X2 performs 3 operations Painting
Assembly and Testing. The relevant data are available as follows:

Hours required for each unit

MODEL Unit sale price
Assembly Painting Testing
X Rs. 50 1 0.2 0
1
X Rs. 80 1.5 0.2 0.1
2
Total numbers of hours available are: Assembly 600, Painting 100, and Testing 30.
Determine production schedule to maximize the revenue by formulating the problem as an
LPP.

10. A firm can produce three types of cloth, say A, B and C. Three kinds of wool are
required for it, say red wool, green wool and blue wool. One unit length of type A
cloth needs 2 meters of red and 3 meters of blue wool; one unit length of type B cloth
needs 3 meters of red, 2 meters of green and 2 meters of blue wool; and one unit
length of type C cloth needs 5 meters ofgreen and 4 meters of blue wool. The
firm has only a stock of 8 meters of red wool, 10 meters of green wool and 15 meters
of blue wool. It is assumed that the income obtained from one unit length of type
A cloth is Rs. 3, of type B is Rs. 5 and that of type C is Rs. 4. Formulate this problem
as a LPP.
11. A resourceful home decorator manufactures two types of lamps, say A and B. Both
the lamps go through two technicians, first a cutter, second a finisher. A lamp
requires 2 hours of the cutter’s time and 1 hour of finisher’s time. Lamp B requires
1 hour of cutter’s time and 2 hours of finisher’s time. The cutter has 104 hours and
finishers have 76 hours of available time each month. Profit on one lamp A if Rs.
6 and on one lamp B is Rs. 11. Assuming that he can sell all that he produces,
formulate this problem as an LPP.

12.
Solve the following LPP graphically:
 Max z= 2x1 +3x2
s.t x1 + x2 ≤ 1,
3x1+x2 ≤ 4,

and x1, x2 ≥ 0

 Max z = 8 x1 + 7 x2s.t

3x1 + x2 ≤ 66000,
x1 + x2 ≤ 45000,
x1 ≤ 20000,
x2 ≤ 40000,
and x 1 , x2 ≥ 0

 Min z = 2x1 + 3x2

s.t. x1 + x2 ≤ 4,
6x1 + 2x2 ≤ 8,
x1 + 5x2 ≥ 4,
x1 ≤ 3, x2 ≤
3
and x1, x2 ≥ 0

13. Solve the following LPP’s by Simplex method:

(i) 𝑀𝑎𝑥 𝑧 = 2𝑥1 + 5𝑥2 + 7𝑥3 (iv) 𝑀𝑎𝑥 𝑧 = 2𝑥1 + 3𝑥2

𝑆𝑢𝑏j𝑒𝑐𝑡 𝑡𝑜 𝑆𝑢𝑏j𝑒𝑐𝑡 𝑡𝑜
3𝑥1 + 2𝑥2 + 4𝑥3 ≤ 100, 𝑥1 + 2𝑥2 ≤ 4,
𝑥1 + 4𝑥2 + 2𝑥3 ≤ 100, 𝑥1 + 𝑥2 = 3,
𝑥1 + 𝑥2 + 3𝑥3 ≤ 100, 𝑎𝑛𝑑 𝑥1, 𝑥2 ≥ 0
𝑎𝑛𝑑 𝑥1, 𝑥2, 𝑥3 ≥ 0
(v) 𝑀i𝑛 𝑧 = 5𝑥1 − 6𝑥2 − 7𝑥3
(ii) 𝑀𝑎𝑥 𝑧 = 2𝑥1 + 4 + 𝑥3 𝑆𝑢𝑏j𝑒𝑐𝑡 𝑡𝑜
𝑆𝑢𝑏j𝑒𝑐𝑡 𝑡𝑜 𝑥1 + 5𝑥2 − 3𝑥3 ≥ 15,
𝑥1 + 2𝑥2 ≤ 4, 𝑥1 + 𝑥2 + 𝑥3 = 5,
2𝑥1 + 𝑥2 ≤ 3, 5𝑥1 − 6𝑥2 + 10𝑥3 ≥ 0,
𝑥2 + 4𝑥3 ≤ 3, 𝑎𝑛𝑑 𝑥1, 𝑥2, 𝑥3 ≥ 0
𝑎𝑛𝑑 𝑥1, 𝑥2, 𝑥3 ≥ 0
(iii) 𝑀𝑎𝑥 𝑧 = 3𝑥1 + 2𝑥2 + 5𝑥3 (vi) 𝑀𝑎𝑥 𝑧 = 𝑥1 + 2𝑥2
𝑆𝑢𝑏j𝑒𝑐𝑡 𝑡𝑜 𝑆𝑢𝑏j𝑒𝑐𝑡 𝑡𝑜
𝑥1 + 2𝑥2 + 𝑥3 ≤ 430, 𝑥1 − 𝑥 2 ≤ 1
𝑥1 + 4𝑥2 ≤ 420, 𝑥1 + 𝑥2 ≥ 3
3𝑥1 + 2𝑥3 ≤ 460,
𝑎𝑛𝑑 𝑥1, 𝑥2 ≥ 0
𝑎𝑛𝑑 𝑥1, 𝑥2, 𝑥3 ≥ 0

14. Write the dual of following LPP

(i) 𝑀i𝑛 𝑧 = 8𝑥1 − 2𝑥2 − 4𝑥3 (ii) 𝑀i𝑛 𝑧 = 6𝑥1 + 5𝑥2 + 2𝑥3
𝑠𝑢𝑏j𝑒𝑐𝑡 𝑡𝑜 𝑠𝑢𝑏j𝑒𝑐𝑡 𝑡𝑜
𝑥1 − 4𝑥2 − 2𝑥3 ≥ 2, 𝑥1 + 3𝑥2 + 2𝑥3 ≥ 5,
𝑥1 + 𝑥2 − 3𝑥3 ≥ −1, 2𝑥1 + 2𝑥2 + 𝑥3 ≥ 2,
−3𝑥1 − 𝑥2 + 𝑥3 ≥ 1, 4𝑥1 − 2𝑥2 + 3𝑥3 ≥ −1,
𝑎𝑛𝑑 𝑥1, 𝑥2, 𝑥3 ≥ 0 𝑎𝑛𝑑 𝑥1, 𝑥2, 𝑥3 ≥0
 15. Solve the following transportation problem using
a. North-west corner method
b. Lowest cost entry method
c. Vogel’s method
Also check whether the solution is optimal or not using MODI and Stepping Stone
method
a.
Market
Plant A B C D Supply
X 14 9 18 6 11
Y 10 11 7 16 13
Z 25 20 11 34 19
Demand 6 10 12 15 43

b.
W1 W2 W3 W4 Capacity
F1 95 105 80 15 12
F2 115 180 40 30 7
F3 155 180 95 70 5
c Requirements 5 4 4 11

MARKET
ORIGINS D1 D2 D3 D4 D5 D6 AVAILABILITY
O1 1 2 1 4 5 2 30
O2 3 3 2 1 4 3 50
O3 4 2 9 5 6 2 75
O4 3 1 7 3 4 6 20
REQUIREMENT 20 40 30 10 50 25 175

d.
DEMAND POINT
SOURCE 1 2 3 4 SUPPLY

1 2 3 11 7 6
2 1 0 6 1 1
3 5 8 15 9 10
DEMAND 7 5 3 2