MATHEMATICAL PROGRAMMING (Optional Paper)
Paper Code:
MAT323A
Credits:
5
Contact Hours:
75.00
Max. Marks:
100.00
15.00
Convex and concave sets. Separating and supporting hyper plane theorems, Revised simplex method to solve Linear Programming problems, Bounded variable problems.
15.00
Integer programming: Integer & mixed integer programming problems, Gomory’s algorithm, Branch and Bound algorithm, Cutting plane Method.
15.00
Goal programming: Graphical goal attainment method, Simplex method for GPP, Ranking and weighting of multiple goals, Applications of Goal programming.
15.00
Separable programming, Piece-wise Linear approximations to non-linear functions, Reduction to separable programming problem to LPP.
15.00
Dynamic programming: Introduction, Bellman principle of optimality, solution of problems with finite number stages, solution of LPP by dynamic programming.
Essential Readings:
- S.D.Sharma: Operations Research, Kedar Nath Ram Nath and co. (1992).
- Kanti Swarup, P.K.Gupta and Manmohan : Operations research, S.Chand and Company Ltd, New Delhi, Reprint 2007.
- Hamady A.Taha, Operations Research an Introduction , Prentice Hall.
- G. Hadley: Linear programming, Oxford and IBH Publishing New Delhi , 1962.
References:
- S.I.Gass: Linear Programming, Mc Graw Hill Book Co.
- 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.
Academic Year:
