Seat No.: ________ Enrolment No.

___________

GUJARAT TECHNOLOGICAL UNIVERSITY

ME - SEMESTER– • 3 ( New) EXAMINATION – SUMMER - 2022

Subject Code:3730007 Date: 02 Jun 2022

Subject Name:Operation Research
Time:02:30 PM TO 05:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1 (a) What is Linear Programming? Explain the process to formulate a Linear 07
Programming problem.
(b) Explain the following terms in detail. 07
a) Decision Variables
b) Objective Function
c) Constraints
d) Non-negativity restriction
Q.2 (a) Write down the different Linear Programming methods and explain any one in 07
detail.
(b) Explain Unimodal function with example. Also explain method of Exhaustive 07
search to find optimal solution in case of Unimodal function.
OR
(b) Explain solution of minimization problem in Linear Programming using Big M 07
method with example
Q.3 (a) Explain following scenarios in terms of solution of Linear programming 07
problem with example and using graphical representation.
(1) Degeneracy situation in Solution
(2) Unbounded Solution space with finite solution.
(b) What is dynamic programming? Explain state and stage. 07
OR
Q.3 (a) Explain Sensitivity analysis of Linear programming problem for change in the 07
Coefficient of objective function with example.
(b) Write a note on crashing of the network 07
Q.4 (a) What is sequential linear programming? Explain its advantages. 07
(b) Explain Decision tree analysis to take decision using appropriate example. 07
OR
Q.4 (a) Explain Interval Halving method to find optimal solution in given range of 07
interval.
(b) Explain Optimization of unconstrained single and multi variable optimization 07
with example.
Q.5 (a) Explain the functionality of various phases of Genetic Algorithm 07
(b) Explain Kuhn Tucker condition method to find optimal solution of constrained 07
non-linear programming problem with example.
OR
Q.5 (a) Explain Simulated annealing algorithm in detail. Also give advantages of 07
Simulated annealing algorithm.
(b) Explain Golden section method to find optimal solution in given interval with 07
suitable example.
*************