Scribd
Upload
16 views2 pages

OR

Uploaded by

amankhatri9671
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
16 views2 pages

OR

Uploaded by

amankhatri9671
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

CENTRAL UNIVERSITY OF HARYANA

Jant-Pali, Mahendergarh, Haryana


Term End Examination Nov./Dec.-2017

Programme : M.Sc. Mathematics


Semester : Third Session : 2017-18
Course Title : Operations Research Max. Time : 3 Hours
Course Code : SPMMAT 01 03 CC 03 3104 Maximum Marks : 70

Instructions:
1. Question no. 1 has seven sub parts and students need to answer any four. Each sub part carries three and half
Marks.
2. Question no. 2 to 5 have three sub parts and students need to answer any two sub parts of each question. Each
sub part carries seven marks.

1. (a) Define Traffic Intensity


(b) Explain Mean Arrival Rate
(c) Prove that dual of the dual of a given primal, is the primal itself.
(d) Define Non-degenerate basic feasible solution.
(e) What is a sequencing problem?
(f) Explain Pure and mixed strategy.
(g) Define Saddle point.

2. (a) Apply Big-M Method to solve the following linear programming problem [8]

M in. Z = 4x1 + 8x2 + 3x3


s.t. x1 + x2 ≥ 2,
2x1 + x3 ≥ 5,
and x1 , x2 , x3 ≥ 0.

(b) If x is any feasible solution to the primal problem M ax Zp = cx, subject to Ax ≤ b, x ≥ 0 and w is any
feasible solution to the dual problem M in ZD = bT w subject to AT w ≥ cT , then show that ZP ≤ ZD .
(c) The linear programming problem is

M ax. Z = 3x1 + 5x2


s.t. x1 + x2 ≤ 1,
2x1 + 3x2 ≤ 1,
and x1 , x2 ≥ 0.

Obtain the variations in c1 which are permitted without changing the optimal solution.

3. (a) Explain Hungarian method for solving an assignment problem.


(b) Determine the optimum basic feasible solution to the following transportation problem:
To Available
21 16 25 13 11
From 17 18 14 23 13
32 27 18 41 19

Required 6 10 12 15
(c) Solve the travelling salesman problem in the matrix shown below: [12]
1
A B C D E
A ∞ 2 5 7 1
B 6 ∞ 3 8 2
C 8 7 ∞ 4 7
D 12 4 6 ∞ 5
E 1 3 2 8 ∞

4. (a) Find expected line length E(Ls ) of the (M/M/1) : (N/F CF S) queuing system.
(b) Customers arrive at a sales counter manned by a single person according to a poisson process with a
mean rate of 20 per hour. The time required to serve a customer has an exponential distribution with
a mean of 100 seconds. Find the average waiting time of a customer.
(c) Obtain the steady state equations of the (M/M/1) : (∞/F CF S) queuing system. Also, find the
probability that exactly n calling units are in the queueing system.

5. (a) Find the range of values of p and q which will render the entry (2, 2), a saddle point for the game.
B
0 2 3
A 8 5 q
2 p 4
(b) Solve the game with the following payoff matrix by algebraically method.

B
9 1 4
A 0 6 3
5 2 8

(c) How will you solve the sequencing problem of n jobs on Three machines.

You might also like