Mathematical Programming (Optional Paper)

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

Convex and concave sets. Separating and supporting hyper plane theorems. Revised simplex method to solve Linear Programming problems, Bounded variable problems.

Integer programming: Integer & mixed integer programming problems, Gomory’s algorithm, Branch and Bound algorithm, Cutting plane Method.

Goal programming: Graphical goal attainment method, Simplex method for GPP. Ranking and weighting of multiple goals, Applications of Goal programming.

Separable programming, Piece-wise Linear approximations to non-linear functions, Reduction to separable programming problem to LPP, Quadratic Programming.

Dynamic programming: Introduction, Bellman principle of optimality, solution of problems with finite number stages, solution of LPP. by dynamic programming.

Essential Readings: 

1. S. D. Sharma: Operations Research, Kedar Nath Ram Nath and co. (1992).

2. Kanti Swarup, P.K.Gupta and Manmohan : Operations research, S.Chand and Company Ltd, New Delhi, Reprint 2007.

3. Hamady A. Taha, Operations Research an Introduction , Prentice Hall.

4. G. Hadley: Linear programming, Oxford and IBH Publishing New Delhi , 1962.

References: 

1. S. I. Gass: Linear Programming, Mc Graw Hill Book Co.

2. F.S.Hiller And G.J. Lieberman: Introduction to Operations Research, Addison Wesley.

3. R.S.Garfinkel and G.L. Nemhauser, Integer Programming, Wiley , New York (1972).

Academic Year: 
2016-2017
  • Printer-friendly version
  • PDF version