Scribd
Upload
7 views3 pages

Define Random Arrival of Customers.: Q. 1 Short Answer Question 2 Marks Each

The document contains short answer and long answer questions related to topics like probability, linear programming, queuing theory, project management, game theory and sequencing problems. Some questions ask to define concepts, draw figures, solve problems and distinguish between techniques. Multiple choice, numerical and conceptual questions are included covering various operations research techniques.

Uploaded by

sbanerjee140
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
7 views3 pages

Define Random Arrival of Customers.: Q. 1 Short Answer Question 2 Marks Each

The document contains short answer and long answer questions related to topics like probability, linear programming, queuing theory, project management, game theory and sequencing problems. Some questions ask to define concepts, draw figures, solve problems and distinguish between techniques. Multiple choice, numerical and conceptual questions are included covering various operations research techniques.

Uploaded by

sbanerjee140
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

2 Marks

Q. 1 Short Answer Question


each
a. Define Random Experiment in probability.
b. Draw a figure of activity node relationship in network diagram.

c. Define random arrival of customers.


d. What is Pure Strategy in Game Theory.

e. Define Linear Programming


f. Describe The notations n , Ls And Lq used for analyzing of a queuing system.
g. Define Jockeying.
a. Where we can use Hungarian method?
b. Define objective function of linear programming problem.
c. Write the Formula of P0 and Lq for Multi-Server Queuing Models
d. Draw a figure of relationship between phases of project management
e. What is mixed Strategy in Game theory?
f. Define Sample space with one example in Probability.
g. Define Balking.
a. Write any two advantage of Linear programming.
b. Describe The notations n , Ls And Lq used for analyzing of a queuing system.
c. Define Probability. Write any two Probability terms
d. What is mixed Strategy in Game theory?
e. Write the notations used in sequencing problem.
f. Draw figures of looping and dangling in network analysis.
g. Where we can use Hungarian method?

5 Marks
Q. 2 Long and Descriptive Answer Questions (Attempt any 2 out of 3)
each
Solve using Hungarian Method
Men / Jobs A B C D
1 5 3 2 8
a.
2 7 9 2 6
3 6 4 5 7
4 5 7 7 8
Depict feasible region for the following LP problem graphically:
b.
Maximize Z = – x1 + 2x2 subject to the constraints (i) x1 – x2 ≤ –1; (ii) – 0.5x1 + x2 ≤ 2 and x1, x2 ≥ 0.
Draw a network diagram for the following activities
Activity A B C D E F G
c.
Predecessor -- -- A A, B C, D B, D E, F
Time 2 1 3 2 1 3 1
d. For c. Indicate the critical path.
e. Solve using north west corner method
D1 D2 D3 D4 Supply
S1 21 16 15 3 11
S2 17 18 14 23 13
S3 32 27 18 41 19
Demand 6 6 8 23
f. A company management and the labour union are negotiating a new three year settlement. Each of
these has 4 strategies:
I : Hard and aggressive bargaining II : Reasoning and logical approach
III : Legalistic strategy IV : Conciliatory approach
What strategy will the two sides adopt? Also determine the value of the game.

g. Write the rules of addition in Probability.


h. Write the significance of using PERT and CPM

i. Determine a sequence for the five jobs that will minimize the elapsed time T. Calculate the total
elapsed time

a. Distinguish between PERT And CPM


b. Solve Using Hungarian Method:
I II III IV
A 8 26 17 11
B 13 28 4 26
C 36 19 18 15
D 19 26 24 10
c. What are the Fundamental rules of Probability?
d. Write the assumption of the game.
e. Use the graphical method to depict a feasible region of the following LP problem.
Maximize Z = 2x1 + x2 subject to the constraints
(i) x1 + 2x2 ≤ 10, (ii) x1 + x2 ≤ 6, (iii) x1 – x2 ≤ 2, (iv) x1 – 2x2 ≤ 1 and x1, x2 ≥ 0.
f. Draw a network diagram for the following activities
Activity A B C D E F G H I
Predecessor -- A B B C D C E, F G, H
Time 5 7 2 3 1 2 1 3 10
g. D1 D2 D3 D4 Supply
S1 21 16 15 3 11
S2 17 18 14 23 13
S3 32 27 18 41 19
Demand 6 6 8 23
Solve using least cost method
h. For f. indicate Critical path
i. Find the sequence that minimizes the total time required in performing the following jobs.Calculate
the total time elapsed

a. Write the applications of linear programming.


b. Solve using Vogal Approximation method
D1 D2 D3 D4 Supply
S1 21 16 15 3 11
S2 17 18 14 23 13
S3 32 27 18 41 19
Demand 6 6 8 23
c. Determine a sequence for the five jobs that will minimize the elapsed time T. Calculate the total
elapsed time

d. At one-man barber shop, customers arrive according to poisson’s distribution with mean arrival rate
of 5 per hour and the hair cutting time was exponentially distributed with an average hair cut taking
10 minutes. It is assumed that because of his excellent reputation, customers were always willing to
wait. Calculate Average number of customers in the shop and the average numbers waiting for a
haircut.

e. What are the steps involved in Project Planning Phase in Project Management.
f. determine the optimal strategies for players A and B. Also determine the value of game. Is this game
(i) fair? (ii) strictly determinable?

g. What are the terminologies used in sequencing problem


h. Solve using Hungarian method
A B C D
J 200 200 400 100
K 300 100 300 300
L 400 100 100 500
M 200 200 400 200
i. Write the rules of multiplication in Probability.

You might also like