MATHEMATICAL PROGRAMMING (optional paper)

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

Convex and concave sets. Separating and supporting hyperplane 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. Separable programming: Piece-wise Linear approximations to non-linear functions, Reduction to separable programming problem to LPP.

15.00

Separable programming Linear Complementary problem (LCP), Quadratic Programming and use of LCP for solving Quadratic Programming , Goal programming, Ranking and weighting of multiple goals, Simplex method for GPP, Goal programming Applications.

15.00

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 Noth and co.
  2. Kanti Swarup, P.K.Gupta and Manmohan : Operations research, S. Chand & Co.
  3. Hamady Taha: Operations Research, Mac Millan Co.
References: 
  1. G. Hadley: Linear programming, Oxford and IBH Publishing Co.
  2. S. I. Gass: Linear Programming, Mc Graw Hill Book Co.
  3. F.S.Hiller And G.J. Lieberman: Introduction to Operations Research, Addison Wesley.

 

  • Printer-friendly version
  • PDF version