Scribd
Upload
22 views2 pages

Optimization Techniques-2

This document is an examination paper for the MSc Mathematics program, specifically for the Optimization Techniques course. It includes two parts: Part A consists of 15 short-answer questions, while Part B contains 4 long-answer questions, each focusing on various optimization methods and concepts. The exam covers topics such as linear programming, transportation problems, and queuing models.

Uploaded by

Jeethu Jose George
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
22 views2 pages

Optimization Techniques-2

This document is an examination paper for the MSc Mathematics program, specifically for the Optimization Techniques course. It includes two parts: Part A consists of 15 short-answer questions, while Part B contains 4 long-answer questions, each focusing on various optimization methods and concepts. The exam covers topics such as linear programming, transportation problems, and queuing models.

Uploaded by

Jeethu Jose George
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

2225 M (Pages: 2) Reg. No. .................

Name ......................

MSc DEGREE EXAMINATION, AUGUST 2022


Second Semester
MSc Mathematics
BMMM210: Optimization Techniques
(2019 Admission onwards)

Time: 3 Hours Maximum: 75 Marks


Part A
Answer any fifteen questions. Each question carries 1 marks.
1. Give an example of a minimize Linear Programming Problem.
2. Give an example of an infeasible LPP.
3. Define slack and surplus variables in an LPP.
4. Obtain the dual of the LPP Minimize f (X) = 2y + 5z subject to x + 2y − z = 3,
3x − 5y ≤ −2, −x − 2y + 7z ≥ 4, 4x + 5y + 6z ≤ 9, x ≥ 0, y ≤ 0, z unrestricted in
sign.
5. What is the advantage of simplex method with respect to the graphical method in an
LPP.
6. Give an example of a transportation problem.
7. Give an example of transportation matrix.
8. Give an example of a loop in a transportation problem.
9. Define the term balanced and unbalanced TPP.
10. Define the term feasible solution of a TPP.
11. Define the term non-linear programming.
12. Define the terms local and gloabal maxima.
13. Find the saddle points of f (x, y) = 3x2 y + y 3 − 3x2 − 3y 2 + 2
14. Maximize f (x, y) = 2x + y subject to x2 + y 2 = 1 using lagrange multilpier.
15. Define the term interarriavl time in a Queue.
16. Define the term srvice time in a queue.
17. Define the term Last in Last out in a queue.
18. Define the term Ws in a queue.

(15×1=15)

Part B
Answer any four questions. Each question carries 15 marks.

19. (a) Solve the LPP by simplex method , maximize Z = x1 + 4x2 + 5x3 subject to
3x1 + 6x2 + 3x3 ≤ 22, x1 + 2x2 + 3x3 ≤ 14, 3x1 + 2x2 ≤ 14, x1 , x2 , x3 ≥ 0

Turn over
(Page 2 of 2)

OR

(b) Solve the LPP by big-M method, maximize Z = x1 + 2x2 + 3x3 − x4 subject to
x1 + 2x2 + 3x3 ≥ 15, 2x1 + x2 + 5x3 ≥ 20, x1 + 2x2 + x3 + x4 ≤ 10, x1 , ..., x4 ≥ 0.

20. (a) Solve the TPP(first use LEAST COST method).


Origin Destination D1 D2 D3 D4 Supply
O1 1 2 3 4 6
O2 4 3 2 0 8
O3 0 2 2 1 10
Demand 4 6 8 6

OR

(b) Solve the TPP(first use VAM method).


Origin Destination D1 D2 D3 Supply
O1 2 7 4 5
O2 3 3 1 8
O3 5 4 7 7
O4 1 6 2 14
Demand 7 9 18

21. (a) Explain the golden section search method.


OR
(b) Minimize 3x21 + 3x22 − 2x1 x2 − 4x2 + 5 by the method of axial directions starting
from (4.2, −2.0).

22. (a) Explain the characteristics of Queuing Models.


OR
(b) Explain the bure birth and Pure death process in a Queueing system.

(4×15=60)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy