Download PTU M.Tech. CSE 3rd Semester 74160 OPTIMIZATION TECHNIQUES Question Paper

Firstranker's choice

FirstRanker.com

M.Tech.(CSE Engg.) (2015 to 2017) (EI-I) (Sem.-3)

--- Content provided by‍ FirstRanker.com ---

Time: 3 Hrs. Max. Marks : 100

INSTRUCTIONS TO CANDIDATES :

--- Content provided by‍ FirstRanker.com ---

1. Attempt any FIVE questions out of EIGHT questions.
2. Each question carries TWENTY marks.

1. Define Operation Research. State the different types of models used in Operations Research. Briefly explain the general methods of solving these models.
2. Solve the following problem using Simplex method :
   
   

   --- Content provided by​ FirstRanker.com ---

   Maximize Z = f(x,y) = 3x + 2y
   subject to :
   2x + y = 18
   2x + 13y = 52
   3x + y = 24
   

   --- Content provided by⁠ FirstRanker.com ---

   x = 0, y = 0
3. What is Linear Programming Problem? Explain the detailed structure of Linear Programming.
4. Develop an algorithm for North-West Corner method for solving transportation problem.
5. What is dynamic programming? Differentiate between Deterministic and Probabilistic Dynamic Programming. Give applications of dynamic programming.
6. If P(X) = 0.3, P(Y) = 0.2 and P(Z) = 0.1 and X, Y, Z are independent events, find the probability of occurrence of at least one of the three events X. Y and Z.

--- Content provided by‍ FirstRanker.com ---

7. What is Integer Programming? Explain in detail Branch and Bound method with the help of an example.
8. Explain in detail Gomory's cutting-plane algorithm for solving an integer Linear Programming, by taking suitable example.

NOTE : Disclosure of Identity by writing Mobile No. or Making of passing request on any page of Answer Sheet will lead to UMC against the Student.

1| M-74160 (S9)-2361

FirstRanker.com

--- Content provided by FirstRanker.com ---