Printed pages: Sub Code: MTCS051

Paper Id 2 1 0 2 1 3 Roll No.

M.TECH.
(SEM -II) THEORY EXAMINATION 2019-20
OPTIMIZATION TECHNIQUES
Time: 2 Hours Total Marks: 70
Notes:
a) This paper contains three Sections A, B and C. Section A carries 18 marks with each question
is of 03 marks. Section B carries 22 marks with each question is of 11 marks and Section C
carries 30 marks with each question carries 10 marks.
b) Attempt any 06 parts from Section A, Any 02 parts from Section B and Any 03 parts from
Section C.
c) Assume any missing data suitably.

SECTION A

1. Attempt any 06 parts questions in brief.

a. What is optimization?
b. What is Queue? Give an example and explain the basic elements of Queue.
c. Enumerate few engineering application of optimization.
d. Determine the saddle point and the value game whose payoff matrix is,
Player B
B1 B2 B3 B4
8 6 2 8

e.
Player A

What are CPM and PERT?

[
8 9 4 5
7 5 3 5 ]
f. Define production inventory.
g. What are the advantages of dual simplex method?
h. Define Transportation Problem?
i. What is non-linear programming?
j. Define duality problem?

SECTION B
2. Attempt any two parts of the following:
a. Maximize Zp = X1 + 2X2 by Simplex Method, subject to
- X1 + 3x2 ≤10
X1 + x2 ≤ 6
X1 + X2 ≤ 2
X1 + 3X2 ≥ 6
And Xi ≥ 0.
b. Write short notes on
(i) Floyd Algorithm
(ii) Reversed Simplex Method
(iii) Optimization model in engineering
 c. Solve the following LPP by Big – M Method
Min z = 4x1 + 3x2
subject to 2x1 + x2 ≥ 10
-3x1 + x2 ≤ 6
x1+ x2 ≥ 6

and x1, x2 ≥ 0
d. Drive Wilson’s EOQ Formula. What are its practical limitations
e. Write short note on Deterministic and probabilistic Models.

SECTION C
[Attempt any 03 parts of the following]
3. Attempt any one part of the following:
(a) Discuss Queuing Models and give some important applications.
(b) Define a linear programming problem? Solve the following linear
programming problem
Maximize 5x+ 3y
Subject to
4x + 5y ≤10
5x + 2y ≤10
3x + 8y ≤ 12
And x ≥0, y ≥0
4. Attempt any one part of the following:
(a) Solve the following programming problem by graphical method:
Max. Z = 300X1 + 400X2
Subject to. 5X1 + 4X2≤ 200
3X1 + 5X2≤ 150
5X1 + 4X2≥ 100
8X1 + 4X2≥ 80
Whereas X1, X2 ≥ 0
(b) What are the similarities and differences between the traditional methods of
optimization and genetic algorithm?
5. Attempt any one part of the following:
( Write short notes on M/M/1 and M/M/1/N
a model of queuing theory.
)
( Use the Simplex method, Maximize P =
b 70X1+50X2+35X3
) subject to 4x1+ 3x2+ x3 ≤ 240
2x1 + x2+ x3 ≤ 100
x1, x2, x3 ≥ 0
6. Attempt any one part of the following:
(a) Solve the transportation problem
Stores/warehouse S1 S2 S3 S4 availability
A 6 1 9 3 34
B 11 5 2 8 15
C 10 12 11 7 12
D 85 35 50 45 19
Demand 21 25 17 17

(b) Define a transportation problem? Prove that every transportation problem

has a feasible solution.
7. Attempt any one part of the following:
(a) Solve the following LPP by graphical method
Minimize. Z = 5X1 + 3X2
Subject to. 2X1 - 5X2 ≤ 6
3X1 +X2 ≤ 4
whereas X1, X2 ≥ 0
(b) Solve the transportation problem

Job/Persons A B C D E
1 12 8 7 15 14
2 7 9 17 14 10
3 9 6 12 6 7
4 7 6 14 6 10
5 99 6 12 10 6