Course Handout & Lecture Plan

Faculty Name Surath Roy Designation/ Dept. 1. Assistant Professor

Dept. of Basic & Applied Sciences
School of Computational &
Applied Sciences (SCAS)

Course Code Course Name L T P C

MCA305 Operation Research 3 1 0 4

Course Objective: The primary objective of the course is to give an exposure to the concepts of
Linear Programming, Game Theory as well as Network Analysis. The students will learn how to
formulate and solve linear programming problems using appropriate techniques and optimization
solvers, interpret the results obtained and translate solutions into directives for action. Game
Theory as well as formulation and solution technique of network problems using graph
optimization algorithms are also dealt with.

Pre-requisite: Linear Algebra and Vector Calculus

Module-I : Contact Hours: 6

Introduction to Linear Programming Problems: Basic LPP and Applications; Various

Components of LP Problem Formulation, Basic Solution, Basic Feasible Solution, Degenerate
and Non-degenerate B.F.S, Optimum Solution, Reduction of a Feasible Solution to Basic
Feasible Solution. Fundamental theorem of Linear Programming Problem.

Module-II : Contact Hours:10

Solution of Linear Programming Problems: Solution of LPP using Simultaneous Equations

and Graphical Method,Simplex Method, Charnes’ Big-M Method, Two phase Method. Duality
Theory.

Module-III : Contact Hours: 8

Transportation, Assignment and Travelling Salesman problem: North-West corner rule,

Matrix minima method, Vogel Approximation Method, Test of optimality by MODI method.
Hungarian Method for Solving Assignment Problem.

Module-IV : Contact Hours: 7

Game Theory : Introduction, 2-Person Zero-sum Games, Saddle Point, Mini-Max and Maxi-
Min.Theorems (statement only) and problems, Games without Saddle Point, Graphical Method,
Principle of Dominance.

Module-V : Contact Hours: 5

Network Analysis: Shortest Path: Floyd Algorithm, Maximal Flow Problem (Ford-Fulkerson),
PERT-CPM.

Page 1 of 6
Text Books :

1. Ghosh and Chakraborty, “Linear Programming and Theory of Games”, Central Book
Agency
2. Paneer Selvam, “Operation Research” ,PHI,2nd edition.

Reference Books :

1. J. K. Sharma, “Operations Research”, Macmillan Publishing Company 4th edition.

2. Hillier & Lieberman,”Operations Research”,TMH 10th (2017)
3. Dipak Kumar Jana, Tapan Kumar Roy ,“A Textbook of Engineering Operations
Research”, Chhaya Parakshani.

Mode of Evaluation: Written Examination

Course Outcomes for MCA305:

After the completion of the course, students would be able to:

1. Relate a real-world problem as a mathematical programming model (K3).

2. Identify the mathematical tools that are needed to solve optimization problems
(K2).
3. Analyze the steps of the Simplex method for Linear Programming and perform
iterations of it by hand (K4).
4. Correlate a linear program and its dual, including strong duality and complementary
slackness (K4).
5. Evaluate specialized linear programming problems like the Transportation,
Assignment and Game theory problems (K4).
6. Solve network models like the shortest path, minimum spanning tree, and maximum
flow problems (K4).

Course Outcomes (COs) assessment table:

CO’s Assessment tools

Quiz 1 Class Quiz 2 Class Assignment Attendance Term End
Test 1 Test 2 Examination
1 25 10 10 10 10
2 25 20 10 10 10
3 50 40 20 10 20 17 20
4 30 40 20 20 23 20
5 40 30 20 23 20
6 40 20 17 20
Total 100 100 100 100 100 100 100

Page 2 of 6
 It is seen that efforts are to be taken to achieve the following level of knowledge i.e., K2,
K3, K4 through this course. (K1-Remembering, K2-Understanding, K3-Applying,
K4-Analyzing, K5-Evaluating, K6-Creating)

Course Outcomes (COs) and Program Outcome (POs) Mapping

CO/PO Mapping
(S/M/W indicates strength of correlation) S-Strong, M-Medium, L-Low
Programme Outcomes(POs)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 M S S M M L L M L
CO2 M S S S M L L M L
CO3 M S S M M L L M L
CO4 M S S M M L L M L
CO5 M S S M M L L M L
CO6 M S S M M L L M L

Lesson Plan

Lecture Modul Learning Topics to be covered Reading Focus on CO

No. e Objectives References Achievement
(Book)
1 1 Introduction to Introduction to Operation T1, R1 1,2
Operation Research and Basic LPP and
Applications
2 1 Formulation of Various Components of LP T1, R1 1,2
L.P.P Problem Formulation
3 1 Continue...... LP Problem T1, R1 1,2
Formulation
4 1 Feasible Definitions: Feasible Solution, T1, R1 1,2
Solution and Basic and non-basic Variables,
Basic Feasible Basic Feasible Solution,
Solution. Degenerate and Non-
Degenerate B.F.S
5 1 B.F.S Find the B.F.S of a system of T1, R1 1,2
equations with example.
6 1 F.S to B.F.S Reduce Feasible Solution to T1, R1 1,2
Basic Feasible Solution.
Fundamental Theorem of
L.P.P
7 2 Solution of Solution of LPP: Using R1 1,2
L.P.P : Graphical Method
8 2 Graphical Continue...... Solution of LPP: R1 1,2
Method Using Graphical Method
9 2 Solution of Solution of LPP: Using R1 1,2,3
Page 3 of 6
 L.P.P : Algebraic Method
Algebraic
Method
10 2 Solution of LPP by Simplex R1 2,3
Method
11 2 Solution of LPP by Charnes’ R1 2,3
Simplex Big-M Method(Maximization
Method and Minimization problem)
12 2 Solution of LPP by two phase R1 2,3
Method(Maximization and
Minimization problem)
13 2 Termination of Termination of L.P.P using R1 1,2,3
Simplex simplex Method
14 2 Method Continue….. Termination of R1 1,2,3
L.P.P using simplex Method
15 2 Duality Theory (Reduce of a R1 2,3,4
maximization problem to
minimization problem and
minimization to maximization
16 2 Duality Continue …Duality Theory. R1 3,4
Week Duality theorem.
Optimality criterion theorem.
Main Duality theorem.
17 3 Introduction of Transportation T2,R1 2,5
Problems. Formulate of a T.P
as an LPP with two suitable
example
18 3 Transportation Find the initial B.F.S of a T2,R1 2,5
problem Transportation Problem using
North-West corner rule. Find
the initial B.F.S of a
Transportation Problem using
Matrix Minima Method
19 3 Find the initial B.F.S of a T2,R1 2,5
Transportation Problem using
VAM Method
20 3 Optimality Test Optimality Test of a solution T2,R1 2,5
using Stepping Stone method.
Optimality Test of a solution
using MODI method
21 3 Introduction of Assignment T2,R1 2,5
problem, Formulate of A.P as
an LPP
22 3 Assignment Solution technique of A.P T2,R1 2,5
problem (Balance A.P) using
Hungarian Method
23 3 Solution technique of A.P T2,R1 2,5
(Unbalance A.P, Negative
A.P, Max A.P, Impossible

Page 4 of 6
 A.P)
24 3 Traveling Solution of Traveling T2,R1 2,5
Salesman Salesman Problem
problem
25 4 Introduction to Game theory, T1, R1 2,3,5
L.P.P formulations of game
theory
26 4 2-Person Zero-sum Game, T1, R1 2,3,5
Saddle Point; Mini-Max and
Maxi-Min Theorems
(statement only), Solution of a
game with Saddle point.
27 4 Solution of Game without T1, R1 2,3,5
Saddle point: 2x2 Person
Zero-sum
28 4 Games without Saddle Point T1, R1 2,3,5
Game; 2xn Person Zero-sum
Game; nx2 Person Zero-sum
Game(Algebraic Method
method)
29 4 Game Theory Games without Saddle Point T1, R1 2,3,5
Game; 2xn Person Zero-sum
Game (Graphical method)
30 4 Games without Saddle T1, R1 2,3,5
Point :nx2 Person Zero-sum
Game(Graphical method)
31 4 Games without Saddle Point: T1, R1 2,3,5
Principal of Dominance and
solution technique of a mxn
Game
32 5 Introduction to Network and R1,R2,R3 2,3,6
formulation of Network
Problem
33 5 Shortest Path: Floyd R1,R2,R3 2,3,6
Network Algorithm
34 5 Analysis Maximal Flow Problem R1,R2,R3 2,3,6
PERT-CPM
35 5 Continue …Maximal Flow R1,R2,R3 2,3,6
Problem PERT-CPM
36 5 Continue …Maximal Flow R1,R2,R3 2,3,6
Problem PERT-CPM /
Summarizing the course
content

Page 5 of 6
Evaluation Scheme:

EC Evaluation Component Duration Marks Date Nature of

No &Time Componen
. t
1. Class Test (Two tests) 45 mins 30(15% Dates to Closed
) be Book
announce
d in class
2. Quiz (Two tests) 15 mins 20(10% Dates to Closed
) be Book
announce
d in class
3. Assignment (as per no. Home 40(20% To be Open Book
of modules in syllabus) Assignmen ) given after
t completio
n of each
module
4. Attendance Full 10(5%)
Semester
5. TEE (Term End 2 hrs. 50 As Per Closed
Examination) (50%) Academic Book
Calendar

Teaching Pedagogy:
Major part of the course shall be delivered using Markers on White board.
PPT’s may be used for Graphical representations (whenever required) as well as for
review of prerequisite topics/revision of current topics.
Online Course Material uploaded in BUIS (Student’s Forum) as well as that available
at NPTEL and other educational sites may be consulted for enhanced learning.

Web References:
https://nptel.ac.in/courses/111105041/
https://nptel.ac.in/courses/110106062/
https://www.brainwareuniversity.ac.in/buis/

Chamber Consultation Hour: Friday (3:40PM-6:10PM)

Notices: All notices concerning this course will be uploaded on BUIS /informed
through email.

Page 6 of 6