Scribd
Upload
15 views3 pages

Or Model 20211647845348

This document is a model question paper for the Third Semester M. Sc. Examination in Mathematics at Kerala University, focusing on Operations Research. It includes two parts: Part A with 8 questions worth 3 marks each, and Part B with 5 questions worth 12 marks each, covering topics such as linear programming, transportation problems, project networks, and optimization techniques. The total duration is 3 hours with a maximum score of 75 marks.

Uploaded by

modichore301
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
15 views3 pages

Or Model 20211647845348

This document is a model question paper for the Third Semester M. Sc. Examination in Mathematics at Kerala University, focusing on Operations Research. It includes two parts: Part A with 8 questions worth 3 marks each, and Part B with 5 questions worth 12 marks each, covering topics such as linear programming, transportation problems, project networks, and optimization techniques. The total duration is 3 hours with a maximum score of 75 marks.

Uploaded by

modichore301
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/ 3

KERALA UNIVERSITY

Model Question Paper- Third Semester M. Sc. Examination


Branch : Mathematics
MM 233 : Elective I : OPERATIONS RESEARCH

Time: 3 hours Max. Marks:75

Part A
Answer any 5 questions from among the questions 1 to 8
Each question carries 3 marks

1. What do you mean by standard form of an LPP?

2. Explain the procedure of solving a LPP using graphical method.

3. Using Vogel’s approximation method, find an initial basic feasible solution to the trans-
portation problem :

M1 M2 M3 M4 Supply
W1 2 2 2 1 3
W2 10 8 5 4 7
W3 7 6 6 8 5
Demand 4 3 4 4

4. Write a note on assignment problem. Write the mathematical model of assignment prob-
lem.

5. Define the terms ‘most probable time’, ‘optimistic estimate’ and ‘pessimistic estimate’ in
connection with project network.

6. What do you mean by non-linear programming problem? Define Lagrangian function


for the non-linear programming problem : Minimize f (X) subject to gi (X) ≤ 0, i =
1, 2, . . . , n.

7. Prove that if F (X, Y ) has a saddle point (X0 , Y0 ) for all Y ≥ 0,


then G(X0 ) ≤ 0, Y00 G(X0 ) = 0.

8. Explain the computational economy in dynamic programming. 5 × 3 = 15

Part B
Anwer all questions from 9 to 13
Each question carries 12 marks

9. A. Solve the following LPP by simplex method:

Maximize Z = 5x1 + 2x2 + 3x3 − x4 + x5


Subject to x1 + 2x2 + 2x3 + x4 = 8
3x1 + 4x2 + x3 + x5 = 7
x1 , x 2 , x 3 , x 4 , x 5 ≥ 0
OR
B. Solve the following LPP by Big M Method:

Maximize Z = −3x1 + x2 + x3
Subject to x1 − 2x2 + x3 ≤ 11
−4x1 + x2 + 2x3 ≥ 3
2x1 − x3 = −1
x1 , x 2 , x 3 ≥ 0

10. A. Find a solution to the following transportation problem :


D1 D2 D3 D4 Supply
O1 19 30 50 10 7
O2 70 30 40 60 9
O3 40 8 70 20 18
Demand 5 8 7 14
(Start with an initial basic feasible solution by North West corner rule).

OR

B. Solve the assignment problem:


J1 J2 J3 J4
M1 10 9 8 7
M2 3 4 5 6
M3 2 1 1 2
M4 4 3 5 6

11. A. Consider a project with 5 jobs A, B, C, D and E with the following job sequence:
Job A precedes C and D; Jobs B precedes D; Job C and D precede E. The completion
times for A, B, C, D and E are 3, 1, 4, 2 and 5 respectively. Construct the project
network, find earliest time, latest time and slack time of each event.
OR
B. Consider a project consisting of nine jobs (A, B, . . . I) with the following precedence
relations and time estimates:

Job Predecessor Optimisstic Time Most Probable Time Pessimistic Time


(a) (m) (b)

A – 2 5 8
B A 6 9 12
C A 6 7 8
D B, C 1 4 7
E A 8 8 8
F D, E 5 14 17
G C 3 12 21
H F, G 3 6 9
I H 5 8 11
a) Draw the project network for the above problem
b) Determine the expected duration and variance of each job.
c) What is the expected length of the project and its variance.

12. A. Find the minimum of

f (X) = (x1 + 1)2 + (x2 − 2)2


subject to g1 (x) = x1 − 2 ≤ 0,
g2 (x) = x2 − 1 ≤ 0,
x1 , x 2 ≥ 0.

OR
B.
1
Minimize f (X) = −x1 − x2 − x3 + (x21 + x22 + x23 )
2
subject to g1 (X) = x1 + x2 + x3 − 1 ≤ 0
7
g2 (X) = 4x1 + 2x2 − ≤ 0
3
x1 , x2 , x3 ≥ 0.

13. A. a) Prove that in a serial two-stage minimization or maximization problem if


(i) the objective function φ2 is a separable function of stage returns f1 (X1 , U1 )
and f2 (X2 , U2 ), and
(ii) φ2 is monotonic nondecreasing function of f1 for every feasible value of f2 ,
then the problem is decomposable.
b) Minimize u21 + u22 + u23 subject to u1 + u2 + u3 ≥ 10, u1 , u2 , u3 ≥ 0.

OR

B. a) Write an algorithm to find the shortest path in a minimum path problem.


b) Determine the maximum of u1 u2 u3 subject to u1 + u2 + u3 = 5, u1 , u2 , u3 ≥ 0.

. 5 × 12 = 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