UNIT II

1. 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.
2. 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

X1

Rs. 50

0.2

X2

Rs. 80

1.5

0.2

0.1

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.
3. 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 of
green 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.
4. 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
cutters time and 1 hour of finishers time. Lamp B requires 1 hour of cutters time and 2
hours of finishers 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.
5. Solve the following LPP graphically:
i.

Max z= 2x1 +3x2

s.t x1 + x2 1,
3x1+x2 4,
and
x1, x2 0

ii.

Max z = 8 x1 + 7 x2
s.t 3x1 + x2 66000,
x1 + x2 45000,
x1 20000,
x2 40000,
and
x1, x2 0

iii.

Min z = 4x1 + 2x2

s.t. x1 + 2x2 2
3x1 + x2 3
4x1 + 3x2 6
and
x1, x2 0
iv.

Min z = 2x1 + 3x2

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

v.

Max z = 3x1 - 2x2

x1 - x2 0,
3x1 - x2 -3,
and
x1, x2 0

s.t

6. Solve the following LPPs by Simplex method:

= 2

(i)
3

+5

+7

= 2

(iv)

+ 2 + 4 100,
+ 4 + 2 100,
+ + 3 100,
, , 0

+ 2 4,
+ = 3,
, 0
= 5

(v)
= 2

(ii)

(iii)

+2
+
+4

+4+
+ 5 3 15,
+ + = 5,
5 6 + 10 0,
, , 0

4,
3,
3,
, , 0
= 3

+3

+2

+5

(vi)

+ 2 + 430,
+ 4 420,
3 + 2 460,
, , 0

+2
1
3

7. Write the dual of following LPP

(i)

=8

4 2 2,
+ 3 1,
3 + 1,
, , 0

=6

(ii)

2
4

+5

+2

+ 3 + 2 5,
+ 2 + 2,
2 + 3 1,
, , 0

=2

(iii)
3
2
2

+3

+4

2 41,
+ + 35,
+ 3 30,
, , 0
=3

(iv)

+4

3
6

+ 5 + 4 7,
+ + 3 4,
2 + 5 3,
7 2 10,
4 + 7 2 2,
,

8. Solve the following transportation problem using

a. North-west corner method
b. Lowest cost entry method
c. Vogels method
Also check whether the solution is optimal or not using MODI and Stepping Stone
method
a.
Market

Plant

Supply

14

18

11

10

11

16

13

25

20

11

34

19

10

12

15

43

Demand

b.

W1

W2

W3

W4

Capacity

F1

95

105

80

15

12

F2

115

180

40

30

F3

155

180

95

70

Requirements

11

c.

MARKET
ORIGINS

D1

D2

D3

D4

D5

D6

AVAILABILITY

O1

30

O2

50

O3

75

O4

20

REQUIREMENT

20

40

30

10

50

25

175

d.

DEMAND POINT
SOURCE

SUPPLY

11

15

10

DEMAND

e.

Store
Factory

ai

10

II

10

10

III

11

IV

12

14

10

bj

10

10