केरल केन्द्रीय विश्िविद्यालय

CENTRAL UNIVERSITY OF KERALA

Department of Mathematics
Assignment for MBA- I Semester
Operations Research
22-04-2020

I- Shortest Path Problem, CPM & PERT

1. Name two algorithms used to find the MST? Explain them?

OR

2. Explain the terms: Minimal Spanning Tree Problem and Shortest Path
Trees

Consider the undirected network as shown in the figure. Find Minimum Spanning Tree
and Shortest Path Trees of the network using Prim’s Algorithm and Dijkstra’s Algorithm
respectively.

3. Write a short note on the following:

a. Project Management
b. Phases of project management
 c. Guidance for network construction
d. Critical path of a project network

4. You are given a network with six nodes and nine arcs. The data is shown in the
following Table

Arc Length Arc length Arc length

1-2 14 1-4 8 4-6 13
1-3 6 1-5 11 3-6 13
2-4 12 3-5 9 5-6 15

4.1. Find the length of the minimum spanning tree using Prim’s algorithm?
4.2. For the data given in problem 1 find length of the minimum spanning tree using
Kruskal’s algorithm?

5. What is PERT and CPM?

6. Explain the following terms

a. Earliest time
b. Latest time
c. Total activity slack
d. Event slack
e. Critical path
7. What is the difference between PERT and CPM/
8. Example 3 A project has the following times schedule

9. A project has the following times schedule

Time Activity Time
Activity
(1-2) 4 (5-7 8
(1 – 3) 1 (6-8) 1
(2 – 4) 1 (7-8) 2
(3-4) 1 (8-9) 1
(3-5) 6 (8-10) 8
(4-9) 5 (9-10) 7
(5-6) 4

9.1. Construct the CPM Network

9.2. Determine the critical pathnand project completion time
9.3. Compute total floats and free floats for non-critical activities.
10. Consider the details of a project as shown below
Activity Immediate Predecessor(s) Duartion (Months)
A - 2
B - 5
C - 4
D B 5
E A 7
F A 3
G B 3
H C,D 6
I C,D 2
J E 5
K F,G,H 4
L F,G,H 3
M I 12
N J,K 8
10.1. Construct the CPM Network
10.2. Determine the critical pathnand project completion time
10.3. Compute total floats and free floats for non-critical activities

11. A small project consisting of eight activities has the following characteristics:
 11.1. Draw the PERT network for the project.

11.2. Prepare the activity schedule for the project.

11.3. Determine the critical path.

11.4. If a 30- week deadline is imposed, what is the probability that the project will be
finished within the time limit?

11.5. If the project manager wants to 99% sure that the project is completed on the
schedule date, how many weeks before that date should he start the project
work?

12.
A small project consisting of ten activities has the following characteristics:

12.1. Construct the project Network

12.2. Find the critical path and expected project completion time

12.3. What is the probability of completing the project on or before 12 weeks?

13. What is Crashing in Project Management?

Consider the data of the project as shown in the table.
If the indirect cost per week is Rs. 1000/- , find the optimal crashed project completion time.

Example 3:
Product manager has planned a list of activities culminating in the inaugurate launch of the
new products.

These are given in the table below:

What is the probability that product manager will be able to complete the language launch
within 80 days-time?

II. Game Theory:

1. Explain the following

a. Pure Strategy and Mixed Strategy
b. Solution of a game
c. Value of a game
 d. Saddle point
e. Zero Sum game and Non-Zero Sum game
f. Principle of dominance
15 2 3
2. Solve the game [ 6 5 7]
−7 4 0
1 7 2
3. Solve the Game whose Pay=off matrix is [6 2 7]
5 1 6

9 3 1 8 0
6 5 4 6 7
4. Solve the Game whose Pay-off matrix is
2 4 3 3 8
[5 6 2 2 1 ]
5. Use principle of dominance to simply the rectangular game with the following pay-off matrix
19 15 17 16
and then solve it graphically 0 20 15 5
[ 10 12 5 8 ]
6. Solve the game graphically
1 3 11
6.1. [ ]
8 5 2
1 5
3 5
1 6
6.2.
4 1
2 2
[5 0 ]

III. Dynamic programming:

1. Define the objective of Dynamic programming problem

2. Solve the Stage Coach problem using Dynamic programming problem using the following table
A person wants to go from City 1 to City 10. The various possibilities and the distances are given
in table
Arc distance Arc distance
1-2 5 4-6 5
1-3 5 4-7 7
1-4 6 5-8 6
2-5 4 5-9 8
2-6 7 6-8 9
2-7 8 6-9 7
3-5 8 7-8 5
3-6 10 7-9 7
3-7 5 8-10 8
4-5 4 9-10 9