COURSE OUTLINE
Course Name
Operations Research-I
Prepared On
22 Jan 2023
Course Code
BSCS-507
Credit Hours
2+1
Prerequisite Course
Revised On
Course Type
□ Core Course
□ Elective
Program
BSCS
Semester
Third Year (Semester-I )
Course Instructor(s)
Kamlesh Narwani
Course Content
Operations Research is the study of scientific approaches to decision-making. Through mathematical modeling,
it seeks to design, improve and operate complex systems in the best possible way. The mathematical tools used
for the solution of such models are either deterministic or stochastic. Students will learn very powerful
modeling and solution techniques for decision-making problems that are used today by many successful
companies to help them save/earn millions of dollars.
Course Learning Outcomes
CLO #
By the end of the semester, students should be able to:
1
Understand the characteristics of different types of decision-making environments and the
appropriate decision making approaches and tools to be used in each type.
2
Build and solve Transportation Models and Assignment Models.
3
Design new simple models, like: CPM, MSPT to improve decision –making and develop critical
thinking and objective analysis of decision problems.
4
Implement practical cases, by using TORA, WinQSB
Teaching & Learning Methodology


Topics covered from textbook and available literature,
Use of multimedia presentations
Classroom discussion &Quizzes

Textbook(s)
Frederick S. Hiller, Gerald J. Lieberman, Introduction to Operations Research (Ninth Edition)(English),
Mc-Graw Hill 2010.
Reference Book(s)
W. Winston, Operations Research, Duxbury Press. Operations Research: Applications and Algorithms,
Wayne L Winston, Indian University, 7th edition, 2014.
Taha, H.A. (1992). Operations Research: An Introduction. 5 th edition. Prentice-Hall, New York.
Grading Policy
Assessment Instruments
Lab
Quiz / Assignment
Mid Term Exam
Final AIMS Exam
Percentage
20%
20%
20%
40%
1
Week-wise Course Outline
Week
1
Theory
Lab
Wee
k
9
Introduction to operations research
Lab
The transportation and assignment
problems
oThe transportation problem,
Introduction to Operations Matrix
Research, History of operations Operations
research and its applications
2
Theory
Sequencing
A
streamlined
simplex Problem
method for transportation
problem
10 The transportation and assignment
Introduction to operations research
problems
Modeling
the
programming
3
linear Matrix
Operations
(Cont..)
The assignment problem A Game Theory
special algorithm for the
assignment problem
11
Linear programming
Geometry, Solving the linear Minimum
programming
Cost Path
4
The Simplex method, Shadow
price, Theory of the simplex
method
5
6
Array Sorting
dynamic Assignment
Problem
Dynamic programming
Dynamic
Programming
Problem
Integer programming
Prototype examples, BIP Inventory
applications and formulation Problem
examples Some perspectives
on
solving
integer
programming problems
14
Linear
Programming
Problem
Other algorithms for linear
programming
of
Deterministic dynamic
programming
13
Duality
Sensitivity analysis
7
Finding
Maximum
Number In
An Array
Duality
Dual theory
Characteristic
programming
12
Linear programming
Dynamic programming
Integer programming
The branch-and-cut approach
to solve BIP problems The
incorporation of constraint
programming
15
REVISION
16
Final Exam
The dual simple method, Big – Queuing
M method, The tow phase Problem
method
8
Midterm
Final lab Exam
2