Indian Institute of Management Rohtak

Course Outline

Course Title : Quantitative Methods I

Credits : Three
Type : Compulsory
Session Duration : 75 minutes
Term : I
Year : 2017
Faculty : Amol Singh
________________________________________________________________________
Introduction
This course has been designed to provide a solid foundation to the PGP students in
quantitative methods. After going through the course, they should be able to know how to
develop an OR based model (linear programming, goal programming, transportation,
assignment, integer programming, and dynamic programming etc.) to find out the
optimum solution of several business problems.

Course Objectives
The specific objectives of the course are:

1) To illustrate the applicability and use of quantitative methods in managerial

decision making.
2) To encourage logical processes within business systems.
3) To focus on managerial decision making and how scientific methodology can be
used to make better decisions in the business environment.

Pedagogy
The pedagogy would be a mix of Lecture, Group exercises in class, Case Analysis,
Assignments, and Quizzes.

Evaluation Scheme
Mid Term 35%
End Term 35%
Quizzes 20%
Cases Presentation / Participation 10%

Brief Outline
The main modules of the course are given as below:
Linear Programming
Transportation Models
Assignment Models
Goal Programming
Integer Programming
Dynamic Programming

1
 Decision Analysis
Game theory
Simulation

References
Text Book
1. Anderson Sweeney, Williams, Martin, An Introduction to Management Science,
Quantitative approaches to decision making, 13 Edition, Cengage.
Others reference Books
2. Taha, H.A. (2013).Operations Research-An Introduction (Eighth Edition). Prentice
Hall, India.
3. Hiller, F. S., Liberman, G. J., Nag, B. and Basu P., Operations Research 9th edition,
McGraw Hill.
4. Render, B., Stair, R.M., Hanna, M.E. and Badri, T.N. (2010). Quantitative Analysis
for Management (Tenth Edition). Pearson, New Delhi.
5. Hillier,F.S. and Hillier, M.S. (2010). Introduction to Management Science-A
Modeling and Case Studies Approach with Spreadsheets (Third Edition). Tata
McGraw-Hill.
6. Bowerman, B.L., OConnell, R.T. and Murphree, E. S. (2010). Business Statistics in
Practice (Fifth Edition). Tata McGraw Hill.
7. Taylor III, B.W. (2010). Introduction to Management Science (Tenth Edition).
Pearson

Special Instructions
Please read and prepare well in advance for case presentation & discussion in the class.
Case for each session is indicated in the Session Plan. The sessions will be of 75 minutes
duration. R indicates additional readings. C indicates cases.

Session Plan
Topic Session Topic and Sub-topics Reference Case / Exercise / Instructor
No. No. (Book Assignment
chapter /
Page
numbers
from the
book/Additi
onal
readings)
1 1 Linear programming model Chapter 2 Workload
formulation pp 31-69 balancing
(Maximization/minimization) Production
Graphical solution strategy
Slack variable Hart Venture
Special cases of Linear capital
programming: Alternate
optimal solutions,
infeasibility, unbounded
2 2 Computer solution of Linear Chapter 3 Product Mix

2
 programming Models pp 94 - 128 Investment
Sensitivity Analysis strategy
Truck Leasing
Strategy
3 Linear Programming Chapter 4 Planning and
application in Marketing, pp 160-194 advertising
Finance, and Operations Campaign
Management Phoenix
computer
Textile mill
scheduling
Duke energy
coal allocation
4 Transportation Models Chapter 6 Solution plus
pp 261 - 267
5 Transshipment model Chapter 6 Distribution
pp 273 - 280 system design
6 Shortest route problem, Chapter 6 Airline crew
maximal flow problem, pp 268 - 273 scheduling
Assignment model
(minimization)
7 Assignment model Chapter 6 Chandigarh to
(maximization) pp 268 - 273 Delhi Bus
scheduling
8 Goal Programming, Model Chapter 14 DJS investment
formulation, pp 651-670 services
Youngs & sons
Michigan
motor
corporations
9 Computer solution of Goal Chapter 14 Industrial
programming Models chemicals
Morley
company
EZ Trailers
INC
10 Integer programming (B&B Refer
Methods) operations
research by
Taha
11 Zero one Integer Chapter 7 Capital
programming models pp 319 - 327 budgeting
models
Text book
publishing
12 Mixed Integer programming Chapter 7 Distribution
models pp 328 - 346 system
design
Yeager

3
 national bank
13 Set covering models Chapter 7 Bayside art
pp 328 - 346 gallery
CHB Inc. Bank
14 Dynamic Programming Refer
operations
research by
Taha
15 Dynamic Programming Refer
Operations
Research by
Taha
16 Analytic Hierarchy process Chapter 14
(AHP) pp 670-681
17 Decision making under Chapter 13 Property
uncertainty & Risk pp 596-626 purchase strategy
Lawsuit defense
strategy

18 Game Theory (Pure strategy) Refer

Operations
Research by
Taha
19 Game Theory (Mixed Refer
strategy) Operations
Research by
Taha
20 Simulation Chapter 12 County beverage
pp 537-570 Drive-Thru