Advanced Operations Research-I

Paper Code: 
MAT323A
Credits: 
5
Contact Hours: 
75.00
Max. Marks: 
100.00
Objective: 

This course will enable the students to -

  1. To teach the methods to solve linear programming problems, integer programming problems as well as the methods to solve goal programming problems and Inventory problems.

Course Outcomes (COs):

Course

Learning outcomes

(at course level)

Learning and teaching strategies

Assessment

Strategies

Course Code

Course Title

 

 

 

 

 

 

MAT 323A

 

 

Advanced Operations Research-I

 (Theory)

 

 

 

The students will be able to –

 

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

CO82: Describe the theoretical
workings of the solution
methods for specialized linear programming problems
like Revised simplex method and dual simplex method

CO83: Explain the concepts of integer programming and discuus different methods of finding solution.

CO84: Define the goal programming technique concepts and demonstrate the formulations of real-world situations as linear goal programming problems and describe the solution methods for linear goal programming problems..

CO85: Determine the inventory level of an industry for the smooth functioning for deterministic model with price breaks.

CO86: Understand and develop probability inventory models and setting safety stocks 

 

Approach in teaching:

 

Interactive Lectures, Discussion, Power Point Presentations, Informative videos

 

Learning activities for the students:

Self learning assignments, Effective questions, presentations, Field trips

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 is permitted)

 

Unit I: 
I
15.00

Revised simplex method: Standard form I and II, Computational procedure, Bounded variable problems in linear programming, Dual simplex method. 

Unit II: 
II
15.00

Integer linear programming: Gomory’s cutting plane method for all integer and mixed integer, Branch and bound algorithm.

Unit III: 
III
15.00

Goal programming: Definition, Formulation and graphical solution of goal programming models, Methodology of solution procedure of goal programming algorithm, Extended simplex method.

Unit IV: 
IV
15.00

Dynamic demand models (IV and V), Deterministic model with price break: one, two and any price break.

Unit V: 
V
15.00

Probabilistic inventory models: Instantaneous demand and no set up cost model, Uniform demand and no setup cost model, Probabilistic order level system with constant lead time, Multi period probabilistic model with constant lead time.

Essential Readings: 
  • S. D. Sharma, Operations Research, Kedar Nath Ram Nath and Co., 2012.
  • Kanti Swarup, P.K. Gupta and Manmohan, Operations Research, S. Chand & Company, New Delhi, 2007. 
  • Hamady A. Taha, Operations Research an Introduction, Prentice Hall, 2007.
  • B.S. Goel and S.K. Mittal, Operation Research, Pragati Prakashan, 2014.
References: 
  • S. I. Gauss, Linear Programming, McGraw Hill Book Co., 1965.
  • F.S.Hiller and G.J. Lieberman, Introduction to Operations Research, Addison Wesley, 2011.
  • R.S. Garfinkel and G.L. Nemhauser, Integer Programming, Wiley, New York, 1972.
  • G. Hadley, Linear Programming, Oxford and IBH Publishing, New Delhi, 2002.
  • P.K. Gupta and D.S. Hira, Problem in Operation Research, S. Chand & Co., 2010.
Academic Year: 
2023-2024
  • Printer-friendly version
  • PDF version