Advanced Operations Research-I

Paper Code: 
24MAT323(A)
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: 

Course

Learning outcomes

(at course level)

Learning and teaching strategies

Assessment

Strategies

Course Code

Course Title

 

 

 

 

 

 

 

 

24MAT

323(A)

 

Advanced Operations Research-I

 (Theory)

 

 

 

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

CO84: Explain the concepts of integer programming and discuss different methods of finding solution.

CO85: Outline 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.

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

CO87: Develop probability inventory models and setting safety stocks 

CO88: Contribute effectively in course - specific interaction.

 

Approach in teaching:

Interactive Lectures, Discussion, Informative videos

 

Learning activities for the students:

Self learning assignments, Effective questions,  Topic  presentation, Assigned tasks

 

 

 

Quiz, Class Test, Individual projects,

Open Book Test, Continuous Assessment, Semester End Examination

 

 

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

 

Unit I: 
Revised simplex method and Bounded variable Method :
15.00

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

 

 

Unit II: 
Integer linear programming:
15.00

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

 

Unit III: 
Goal programming:
15.00

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

 

Unit IV: 
Inventory Models:
15.00

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

 

Unit V: 
Probabilistic inventory models:
15.00

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: 
  • B.S. Goel and S.K. Mittal, Operation Research, Pragati Prakashan, 2014.
  • Hamady A. Taha, Operations Research an Introduction, Prentice Hall, 2007.
  • Kanti Swarup, P.K. Gupta and Manmohan, Operations Research, S. Chand & Company, New Delhi, 2007.
  • S. D. Sharma, Operations Research, Kedar Nath Ram Nath and Co., 2012.

SUGGESTED READING

                  

  • F.S. Hiller and G.J. Lieberman, Introduction to Operations Research, Addison Wesley, 2011.
  • 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.
  • R.S. Garfinkel and G.L. Nemhauser, Integer Programming, Wiley, New York, 1972.
  • S. I. Gauss, Linear Programming, McGraw Hill Book Co., 1965.

 

e- RESOURCES

 

 

JOURNALS

 

 

Academic Year: 
2024-2025
  • Printer-friendly version
  • PDF version