Scribd
Upload
9 views2 pages

MTH2 C10 - Operations Research

This document is an examination paper for the Second Semester M.Sc. Degree in Operations Research, consisting of three parts: Part A with short answer questions, Part B with detailed questions from specific units, and Part C requiring comprehensive problem-solving. The exam covers various topics in Operations Research, including convex sets, transportation problems, sensitivity analysis, and game theory. The maximum weightage for the exam is 30, with specific weightage assigned to each part and question.

Uploaded by

21ugmat1314
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
9 views2 pages

MTH2 C10 - Operations Research

This document is an examination paper for the Second Semester M.Sc. Degree in Operations Research, consisting of three parts: Part A with short answer questions, Part B with detailed questions from specific units, and Part C requiring comprehensive problem-solving. The exam covers various topics in Operations Research, including convex sets, transportation problems, sensitivity analysis, and game theory. The maximum weightage for the exam is 30, with specific weightage assigned to each part and question.

Uploaded by

21ugmat1314
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

21P205 (Pages: 2) Name: …..………………….

Reg. No: ….………………..


SECOND SEMESTER M.Sc. DEGREE EXAMINATION, APRIL 2022
(CBCSS - PG)
(Regular/Supplementary/Improvement)
CC19P MTH2 C10 - OPERATIONS RESEARCH
(Mathematics)
(2019 Admission onwards)
Time: Three Hours Maximum: 30 Weightage

PART A
Answer all questions. Each question carries 1 wieghtage.
1. Prove that the set of feasible solutions forms a convex set.
2. What are the two applications of OR?
3. What is the difference between a balanced and unbalanced transportation problem?
4. Define loop in transportation array.
5. Prove that the dual of dual is primal.
6. What is meant by sensitivity analysis?
7. Define mathematical expectation of the game.
8. Define the concept of notion of dominance.
(8 × 1 = 8 Weightage)
PART B
Two questions should be answered from each unit. Each question carries 2 weightage.

UNIT I
9. Let 𝑓(𝑋) be defined in a convex domain 𝐾 ⊆ 𝐸𝑛 and be differentiable. Then 𝑓(𝑋) is
convex if and only if 𝑓(𝑋2 ) − 𝑓(𝑋1 ) ≥ (𝑋2 − 𝑋1 )′ ∇𝑓(𝑋1 ) for all 𝑋1, 𝑋2 in 𝐾.
10. Show that the vertex of 𝑆𝐹 is a basic feasible solution.
11. What is meant by Simplex multipliers?

UNIT II
12. Show that min 𝑓(𝑋) ≥ max 𝜙(𝑌).
13. Solve the transportation problem.
𝐷1 𝐷2 𝐷3 𝐷4
𝑂1 1 2 -2 3 70
𝑂2 2 4 0 1 38
𝑂3 1 2 -2 5 32
40 28 30 42
14. What is meant by Carterer problem?

UNIT III
15. Find the minimum spanning tree in the following undirected graph
Arc (1,2) (1,3) (1,4) (2,3) (2,8) (2,10) (3,4) (3,8) (4,5) (4,6)
Length 7 4 8 3 9 14 4 10 15 12
Arc (4,8) (5,6) (5,7) (6,7) (6,8) (6,9) (7,9) (8,9) (8,10) (9,10)
Length 10 4 1 2 20 16 18 3 4 6
16. In sensitivity analysis how can we determine the new optimal solution after
introduction of new variables?
17. State and prove the Minimax theorem.
(6 × 2 = 12 Weightage)
PART C
Answer any two questions. Each question carries 5 weightage.
18. Solve the following problem by simplex method. Also solve it by solving its dual
graphically
Maximize 𝑦1 + 𝑦2 + 𝑦3
Subject to 2𝑦1 + 𝑦2 + 2𝑦3 ≤ 2,
2𝑦1 + 𝑦2 + 2𝑦3 ≤ 2,
𝑦𝑗 ≥ 0
for 𝑗 = 1, 2, 3
19. Show that the maximum flow in a graph is equal to the minimum of the capacities of
all possible cuts in it.
20. Solve the problem using branch and bound method.
Minimize 9𝑥1 + 10𝑥2
Subject to 0 ≤ 𝑥1 ≤ 10,
0 ≤ 𝑥2 ≤ 8,
3𝑥1 + 5𝑥2 ≥ 45; 𝑥2 is integer
21. Use notion of dominance to simplify the following payoff matrices and then solve the
game
0 5 −4
3 9 −6
3 −1 2
(2 × 5 = 10 Weightage)

*******

You might also like