Operations Research

Paper Code: 
CMAT 613
Credits: 
4
Contact Hours: 
60.00
Max. Marks: 
100.00
Objective: 

This course will enable the students to -

  1. Understand the ideas underlying the Simplex Method for Linear Programming Problem, as an important branch of Operations Research.
  2. Understand the concept of Linear programming problem with applications to transportation, assignment and game problems. Such problems arise in manufacturing resource planning and financial sectors.

Course Outcomes (COs):

 Course

Learning outcomes

(at course level)

Learning and teaching strategies

Assessment

Strategies

Course Code

Course Title

CMAT 613

 

 

 

 

 

 

 

Operations Research

(Theory)

 

 

 

 

 

 

The students will be able to –

 

CO96: Get the knowledge of formulating mathematical models for quantitative analysis.

CO97: Describe the applications of linear programming problems like transportation, assignment problems etc.

CO98: Explain the concepts of game theory and discuss different types of methods to find solutions.

CO99: Describe how inventory management provides the desired level of customer service, to allow cost-efficient operations, and to minimize the inventory investment.

CO100: Apply the knowledge of queueing theory in real life problems like hospital management, Banking, telecommunication etc.

CO101:Identify the optimization techniques suitable for the real time problems.

Approach in teaching:

 

Interactive Lectures, Discussion, Power Point Presentations, Informative videos

 

Learning activities for the students:

Self learning assignments, Effective questions, presentations, Giving tasks

 

Quiz, Poster Presentations,

Power Point Presentations, Individual and group projects,

Open Book Test, Semester End Examination

 

 

 

(Note: Non-Programmable scientific calculator up to 100 MS are permitted.)

 

 

Unit I: 
I
9.00
Introduction, Objective of Operation Research, Scope of Operation Research, General L.P.P.: Formulation of the problem, Graphical method, Simplex Method, Big M method, Two-phase method. 
 
Unit II: 
II
9.00

Duality in L.P.P., Transportation problem: Optimality test, Degeneracy in transportation problem, unbalanced transportation problem, Assignment problem.

Unit III: 
III
9.00

Theory of Games: Introduction, Description and characteristics of game theory, Two-person zero sum game, Solution of mixed strategy problems, Principle of dominance, Solution of mix game by linear programming method.

Unit IV: 
IV
9.00

Inventory control: Introduction, EOQ models with and without shortages.

Unit V: 
V
9.00

Queuing theory: Definition, Pure birth model, Pure death model, Single server model with finite and infinite capacity.

Essential Readings: 
  • Kanti Swaroop, P.K. Gupta and Manmohan, Operations Research, Sultan Chand and Sons, 2014.
  • G. C. Sharma and Madhu Jain, Operations Research, Students Friends and Co. Agra, 2013.
  • S.D. Sharma, Operations Research Theory, Methods and Applications, Kedarnath and Ramnath Co., Meerut, 2012.
  • B. S. Goel and S. K. Mittal, Operations Research, Pragati Prakashan, 2014.
References: 
  • Saul and Gauss, Linear Programming Methods and Applications, Mc-Graw Hills Book Company, 2011.
  • P. K. Gupta and D. S. Hira, Problems in Operations Research, S. Chand and Co. New Delhi, 2010.
  • Frederick S. Hillier and Gerald J. Lieberman, Introduction to Operations Research, Mc-Graw Hills, 2017.
  • H. A. Taha, Operations Research an Introduction, Macmillan Publishing Company, New York, 2017.
  • Wayne L. Winston, Operation Research Applications and Algorithm, Duxbury Press USA, 2004.
Academic Year: 
2023-2024
  • Printer-friendly version
  • PDF version