ADVANCED OPERATIONS RESEARCH-I (Optional Paper)
Revised simplex method: Standard form I and II, Computational procedure, Bounded variable problems in linear programming, Dual simplex method.
Integer linear programming: Gomory’s cutting plane method for all integer and mixed integer, Branch and bound algorithm.
Goal programming: Definition, Formulation and graphical solution of goal programming models, Methodology of solution procedure of goal programming algorithm, Extended simplex method.
Dynamic demand models (IV and V), Deterministic model with price break: one, two and any price break.
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.
1. S. D. Sharma, Operations Research, Kedar Nath Ram Nath and Co., 1992.
2. Kanti Swarup, P.K. Gupta, Manmohan, Operations Research, S. Chand & Company, New Delhi, 2007.
3. Hamady A. Taha, Operations Research an Introduction, Prentice Hall, 2007.
4. B.S. Goel, S.K. Mittal, Operation Research, Pragati Prakashan, 2014.
1. S. I. Gauss, Linear Programming, McGraw Hill Book Co.1958.
2. F.S. Hiller, G.J. Lieberman, Introduction to Operations Research, Addison Wesley, 2011.
3. R.S. Garfinkel, G.L. Nemhauser, Integer Programming, Wiley, New York, 1972.
4. G. Hadley, Linear Programming, Oxford and IBH Publishing, New Delhi, 1962.
5. P.K. Gupta, D.S. Hira, Problem in Operation Research, S. Chand & Co., 2010.
