OPTIMIZATION TECHNIQUES

IMPORTANT QUESTIONS (UNIT I & II)

1.Solve the LPP by using graphical method.

Maximum Z = 3X1 + 2X2
Subject to the constraints
-2X1 + X2 ≤ 1,

X1 ≤ 2,

X1 + X2 = 8 &

X1,X2 ¿ 0

2.Solve the following LPP using Big – M method

Minimize Z = X1 +2X2
Subject to constraints
X1 −X2 ¿ 3,

2X1+X2 ¿ 10,

X1,X2 ¿ 0

3.Solve the following LPP using Simplex method.

Maximize Z = 4X1 +10X2
Subject to constraints
2X1 + X2 ¿ 10 ,
2X1 + 5X2 ≤ 20,

2X1 + 3X2 ≤ 18

X1,X2 ¿ 0

4. A company manufactures two types of products A and B and sells them at a profit of Rs.2 on type
A and Rs. 3 on type B. Each product is processed on two machine M 1 And M2. Type A required 1
minute of processing time on M1 and 2 minute on M2. Type B requires 1 minute on M1 and 1 minute
on M2. Machine M1 is available for not More than 6 hours 40 minutes while machine M 2 is available
for 10 hours during any working day. Construct the problem as LPP so as to maximize the profit. And
using Simplex method.

5. Consider the Linear programming model and Use Two Phase Method to solve
Maximize Z = 5X1 + 8X2
Subject to 3X1 + 2X2 ≥3,

X1 + 4X2 ≥4,

X1 + X2 ≤ 5 &

X1 , X2 ≥ 0.

6. Solve the following graphically

Maximum Z = 6X1 + 7X2
Subject to the constraints
 2X1 + 3X2 ≤ 12,

2X1 + X2 ≤ 8

X1,X2 ¿ 0

7. Solve the following IPP.

Maximize Z = 2X1 +9 X2
Subject to constraints
2X1 + X2 ≤ 20,

X1 + 5X2 ≤ 24,

X1,X2 ¿ 0 and are integer.

8. Use Branch and Bound method to solve the following IPP

Maximize Z = X1 + 4X2
Subject to 2X1+4X2 7,
5X1+3X2 15,
X1,X2 0 and are integers.

9. Solve the following travelling salesman problem so as to minimize the cost per cycle.

To
1 2 3 4 5
A - 3 6 2 3

From B 3 - 5 2 3
C
6 5 - 6 4
D
2 2 6 - 6
E 3 3 4 6 -
10. Company has one surplus truck in each of the cities
A,B,C,D and e and one deficit truck in each of the cities 1,2,3,4,5 and 6.The distance between the
cities(in km) is shown in below matrix.
To cities (Deficit)
1 2 3 4 5 6
A 10 22 12 14 18 8

From cities B 10 18 25 15 16 12 B
Surplus
C 11 10 3 8 5 9

6 14 10 13 13 12
D
8 12 11 7 13 10
E
Obtain the assignment of trucks from cities in surplus to cities in deficit so that the distance covered
vechicles is minimum.