ADVANCED OPERATIONS RESEARCH-I (Optional Paper)

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 .

Learning Outcomes

Learning and teaching strategies

Assessment

After the completion of the course the students will be able to:

CLO63- Identify the optimization techniques suitable for the real time problems.

CLO64- Solve linear programming by Revised simplex method and solve integer programming also.

CLO65- Solve goal programming problems, multi-objective programming problems.

CLO66- Compare Determine the inventory level of an industry for the  smooth functioning.

CLO67- Understand the concept of probability inventory problems.

Approach in teaching:

Interactive Lectures, Discussion, Tutorials, Reading assignments, Demonstration, Team teaching

Learning activities for the students:

Self learning assignments, Effective questions, Simulation, Seminar presentation, Giving tasks, Field practical

 

 

 

 

Presentations by Individual Students.

Class Tests at Periodic Intervals.

Written assignment(s)

Semester End Examination

 

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’scutting 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 (IVand 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, Multiperiod probabilistic model with constant lead time.

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

 

Academic Year: 
2019-2020
  • Printer-friendly version
  • PDF version