CODE COURSE NAME CATEGORY L T P CREDIT

20MCA261 OPERATIONS RESEARCH ELECTIVE 3 1 0 4

Preamble: This course introduces the concepts of linear programming problems. The topics
treated in this course have applications in real life problems.

Prerequisite: Nil

Course Outcomes: After completion of the course the student will be able to

Bloom's
CO No. Course Outcome (CO)
Category Level
Level 3:
CO 1 Solve different types of Linear Programming Problems.
Apply
Apply the concept of linear programming problems in real Level 3:
CO 2
life. Apply
Solve different decision-making problems using Level 3:
CO 3
optimization techniques. Apply
Use PERT and CPM to analyse project network Level 3:
CO 4
management. Apply
Identify suitable queuing model and solve queuing Level 3:
CO 5
problems. Apply

Mapping of Course Outcomes with Program Outcomes

PO PO PO PO PO PO PO PO PO PO PO PO
1 2 3 4 5 6 7 8 9 10 11 12
CO 1 3 3 1 - - - 2 - - - - -
CO 2 3 3 3 - - - 2 - - - - -
CO 3 3 3 3 - - - 2 - - - - -
CO 4 3 3 1 1 - - 2 2 - - - -
CO 5 3 3 3 - - - 2 - - - - -
3/2/1: High/Medium/Low

20
Assessment Pattern

Continuous
Bloom’s Category Assessment End Semester
Levels Tests Examination
1 2
Level 1: Remember 10 10 10
Level 2: Understand 20 20 20
Level 3: Apply 20 20 30
Level 4: Analyse
Level 5: Evaluate
Level 6: Create

Mark Distribution

End Semester
Total Continuous Internal
Examination ESE Duration
Marks Evaluation (CIE)
(ESE)

100 40 60 3 hours

Continuous Internal Evaluation Pattern:

Attendance : 8 marks
Continuous Assessment Test (2 numbers) : 20 marks
Assignment/Quiz/Course project : 12 marks

End Semester Examination Pattern: There will be two parts; Part A and Part B. Part A
contain 10 compulsory short answer questions, 2 from each module. Each question carries 3
marks. Part B contains 2 questions from each module of which student should answer any one.
Each question can have maximum 2 sub-divisions and carry 6 marks

Sample Course Level Assessment Questions

Course Outcome 1 (CO 1):

1. Define slack variable, surplus variable and optimal basic feasible solution.
2. Obtain all basic feasible solution of the set of equations:
a) 2𝑥1 + 3𝑥2 + 4𝑥3 + 𝑥4 = 2
b) 𝑥1 + 𝑥2 + 7𝑥3 + 𝑥4 = 4
3. Solve by Big M method
Maximise 𝑍 = 6𝑥1 − 3𝑥2 + 2𝑥3
Subject to 2𝑥1 + 𝑥2 + 𝑥3 ≤ 16
3𝑥1 + 2𝑥2 + 𝑥3 ≤ 18

21
 𝑥1 − 2𝑥2 ≥ 8
𝑥1 , 𝑥2 , 𝑥3 ≥ 0

Course Outcome 2 (CO 2):

1. Construct the dual of
Maximise 𝑍 = 3𝑥1 + 17𝑥2 + 9𝑥3
Subject to 𝑥1 − 𝑥2 + 𝑥3 ≥ 3
−3𝑥1 + 2𝑥2 ≤ 1
𝑥1 , 𝑥2 , 𝑥3 ≥ 0
2. Prove that the dual of the dual is the primal
3. Solve using the principle of duality
Minimise 𝑍 = 3𝑥1 + 5𝑥2
Subject to 2𝑥1 + 8𝑥2 ≥ 40
3𝑥1 + 4𝑥2 ≥ 50
𝑥1 , 𝑥2 ≥ 0

Course Outcome 3 (CO 3):

1. Explain North West Corner method
2. Solve the following transportation problem
1 2 3 Supply

1 2 7 4 5

2 3 3 1 8

3 5 4 7 7

4 1 6 2 14

Demand 7 9 18 34

3. Solve the assignment problem

I II III IV

A 16 10 14 11

B 14 11 15 15

C 15 15 13 12

D 13 12 14 15

22
Course Outcome 4 (CO 4):

1. Explain critical path analysis.

2. A project consists of series of tasks labelled A, B, …, H, I with the following
relationships (W < X, Y means X and Y cannot start until W is completed; X, Y < W
means W cannot start until both X and Y are completed). With this notation construct
the network diagram having the following constraints:
A < D, E; B, D < F; C < G; B, G< H; F, G < I.
Find also the minimum time of completion of the project, when the time (in days) of
completion of each task is as follows:
Task : A B C D E F G H I

Time : 23 8 20 16 24 18 19 4 10

3. A project consists of eight activities with the following relevant information.

Immediate Estimated duration (days)

Activity
predecessor Optimistic Most likely Pessimistic
A -- 1 1 7
B -- 1 4 7
C -- 2 2 8
D A 1 1 1
E B 2 5 14
F C 2 5 8
G D, E 3 6 15
H F, G 1 2 3

(i) Draw the PERT network and find out the expected project completion time.
(ii) What duration will have 95% confidence for project completion?
(iii) If the average duration for activity F increases to 14 days, what will be its
effects on the expected project completion time which will have 95%
confidence?
(For standard normal Z = 1.645, area under the standard normal curve from 0 to Z is
0.45)

Course Outcome 5 (CO 5):

1. Explain Birth-death process.
2. In a railway marshalling yard, goods trains arrive at a rate of 30 trains per day.
Assuming that the inter-arrival time follows an exponential distribution and the

23
 service time distribution is also exponential with an average 36 minutes. Calculate
the following:
i. The mean queue size (line length), and
ii. The probability that the queue size exceeds 10.
iii. If the input of trains increases to an average 33 per day, what will be the change in
(i) and (ii)?
3. At a railway station, only one train is handled at a time. The railway yard is sufficient
only for two trains to wait while other is given signal to leave the station. Trains
arrive at the station at an average rate of 6 per hour and the railway station can handle
them on an average of 12 per hour. Assuming Poisson arrivals and exponential service
distribution, find the steady-state probabilities for the various number of trains in the
system. also find the average waiting time of a new train coming into the yard

Model Question Paper

Course Code: 20MCA261
Course name: Operations Research

Max. Marks: 60 Duration: 3hrs

Part A
Answer all questions, each carries 3 marks (10×3 = 30)

1. Write down the basic structure of a linear programming problem in the mathematical
form.
2. Define slack and surplus variables in LPP.
3. State the fundamental theorem of duality.
4. Write the dual of the following
𝑀𝑎𝑥 𝑍 = 𝑥1 − 𝑥2 + 3𝑥3
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 𝑥1 + 𝑥2 + 𝑥3 ≤ 10
2𝑥1 − 𝑥3 ≤ 2
2𝑥1 − 2𝑥2 + 3𝑥3 ≤ 6
𝑥1 , 𝑥2 , 𝑥3 ≥ 0
5. Obtain the IBFS using north west corner method

D1 D2 D3 D4 Supply

O1 2 4 3 6 20

O2 7 3 8 2 10

O3 2 2 9 11 15

Demand 15 15 8 7

24
6. Describe the Matrix Minima method.
7. What is queue discipline?
8. Explain single serve Poisson queuing model with infinite capacity.
9. Activities P, Q and R instantly follow activity M, and their current starting times are
12, 19 and 10. So, what is the latest finishing time for activity M?
10. What is the difference between PERT and CPM.

Part B
Answer all questions, each carries 6 marks (5×6 = 30)
11. Solve the following problem by Simplex method
𝑀𝑎𝑥 𝑍 = 5𝑥1 + 3𝑥2
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 4𝑥1 − 𝑥2 ≤ 10
2𝑥1 + 2𝑥2 ≤ 50
𝑥1 , 𝑥2 ≥ 0
or
12. Solve by Big-M method
𝑀𝑎𝑥 𝑍 = 6𝑥1 − 3𝑥2 + 2𝑥3
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 2𝑥1 + 𝑥2 + 𝑥3 ≤ 16
3𝑥1 + 2𝑥2 + 𝑥3 ≤ 18
𝑥2 − 2𝑥3 ≥ 8
𝑥1 , 𝑥2 , 𝑥3 ≥ 0
13. Prove that the dual of a dual is the primal.
or
14. Solve the following by using the dual principle
𝑀𝑎𝑥 𝑍 = 40𝑥1 + 35𝑥2
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 2𝑥1 + 3𝑥2 ≤ 60
4𝑥1 + 3𝑥2 ≤ 96
𝑥1 , 𝑥2 ≥ 0
15. Solve the following Assignment problem

I II III IV

A 2 3 4 5

B 4 5 6 7

C 7 8 9 8

D 3 5 8 9

25
 or
16. Solve the following transportation problem

D1 D2 D3 D4 Supply

O1 5 2 4 3 22

O2 4 5 1 6 15

O3 4 6 7 5 8

Demand 7 12 17 9

17. Explain critical path analysis.

or
18. A project consists of eight activities with the following relevant information.

Immediate Estimated duration (days)

Activity
predecessor Optimistic Most likely Pessimistic
A -- 1 1 7
B -- 1 4 7
C -- 2 2 8
D A 1 1 1
E B 2 5 14
F C 2 5 8
G D, E 3 6 15
H F, G 1 2 3

(iv) Draw the PERT network and find out the expected project completion time.
(v) What duration will have 95% confidence for project completion?
(vi) If the average duration for activity F increases to 14 days, what will be its effects
on the expected project completion time which will have 95% confidence?
(For standard normal Z = 1.645, area under the standard normal curve from 0 to Z is
0.45)

19. Explain birth-death process.

or
20. At a railway station, only one train is handled at a time. The railway yard is sufficient
only for two trains to wait while other is given signal to leave the station. Trains arrive
at the station at an average rate of 6 per hour and the railway station can handle them
on an average of 12 per hour. Assuming Poisson arrivals and exponential service
distribution, find the steady-state probabilities for the various number of trains in the
system. also find the average waiting time of a new train coming into the yard.

26
 Syllabus

Module 1: (9 Hours)
Linear programming problem- Slack and surplus variable- Standard form- Solution of Linear
programming problem- Basic solution- Basic feasible solution- Degenerate- and Non-
degenerate solutions- Optimal solution- Solution by simplex method- Artificial variables-
Big- M method.

Module 2: (9 Hours)
Duality in Linear Programming Problem- Statement of duality theorem- Statement of
complementary slackness theorem. The primal- Duality solutions using simplex method-
Revised simplex method

Module 3: (9 Hours)
Transportation problem- Solution of Transportation problem- Finding an initial basic feasible
solution- North West Corner method- Matrix minima method- Vogel’s Approximation
method- Test for Optimality- Modi method- Unbalanced Transportation problem-
Maximisation in Transportation problem. Assignment problem- Optimal solution- Hungarian
method of assignment- Maximization in assignment problem.

Module 4: (9 Hours)
Network analysis- Project scheduling- Construction of project networks- Critical path
method (CPM)- Identification of critical path using CPM- Estimation of Floats- Total float-
Independent float- Project Evaluation and Review Technique (PERT) - Computation of
expected completion times by PERT.

Module 5: (9 Hours)
Queuing theory- Elements of Queuing System- Kendall’s notation- Operating characteristics-
Poisson process- Exponential distribution- Mean and variance- Birth and Death process.
Queuing models based on Poisson process- Single server models with finite and infinite
capacity- Multi server model with finite and infinite capacity.

Note:
• Programming Assignments using Python and appropriate Case Studies may be given at
the end of each module.

• Linear Programming Problems in module 1 and module 2 and Transportation problems

in module 3 can be solved using Python library PuLP. Using Numpy, PERT/CPM
problems in module 4 can be solved.

Text Book
1. KantiSwarup, P.K. Gupta and Man Mohan, Operation Research, Sultan Chand (2010)

27
Reference Books

1. Hamdy A Taha, Operations Research- an introduction, Eighth Edition, Prentice Hall of

India.
2. Ravindran, Philips and Solberg, Wiley, Operation Research, Second edition (2007)

Web References
1. https://pypi.org/project/PuLP/
2. https://numpy.org/

Course Contents and Lecture Schedule

Sl. No. of
Topic
No. Lectures
1 Module 1 9 Hours
Linear programming problem- Slack and surplus variable- Standard 1
1.1
form
Solution of Linear programming problem- Basic solution- Basic
1.2 feasible solution- Degenerate- and Non-degenerate solutions- 2
Optimal solution
1.3 Solution by simplex method 3
1.4 Artificial variables- Big- M method 3
2 Module 2 9 Hours
2.1 Duality in Linear Programming Problem 1
Statement of duality theorem- Statement of complementary
2.2 2
slackness theorem
2.3 The primal- Duality solutions using simplex method 3
2.4 Revised simplex method 3
3 Module 3 9 Hours
Transportation problem- Solution of Transportation problem-
3.1 2
Finding an initial basic feasible solution- North West Corner method
3.2 Matrix minima method- Vogel’s Approximation method 1
Test for Optimality- Modi method- Unbalanced Transportation
3.3 3
problem- Maximisation in Transportation problem
Assignment problem- Optimal solution- Hungarian method of
3.4 3
assignment- Maximization in assignment problem
4 Module 4 9 Hours
Network analysis- Project scheduling- Construction of project
4.1 1
networks
Critical path method (CPM)- Identification of critical path using
4.2 2
CPM
4.3 Estimation of Floats- Total float- Independent float 3
4.4 Project Evaluation and Review Technique (PERT) 2
4.5 Computation of expected completion times by PERT 1

28
5 Module 5 9 Hours
Queuing theory- Elements of Queuing System- Kendall’s notation-
5.1 1
Operating characteristics- Poisson process
Exponential distribution- Mean and variance- Birth and Death
5.2 2
process
5.3 Queuing models based on Poisson process 3
5.4 Single server models with finite and infinite capacity 1
5.5 Multi server model with finite and infinite capacity 2

29