OBJECTIVE: To understand the general concept of operations research relating to the optimization criteria in computer applications and helps software in this area.
1. CONSTRAINED AND UNCONSTRAINED OPTIMIZATION [10]
Use of Optimization Techniques in computer applications. One dimensional unconstrained optimization — Fibonacci method — Golden section method — Quadratic approximation method — constrained optimization with Lagrangian multipliers — simple problems.
2. LINEAR PROGRAMMING [10]
Formulation of linear programming problems — Simplex method — BIG M method — Two Phase method — Primal Dual problems, Sensitivity Analysis. Transportation problem — Assignment problem.
3. DYNAMIC PROGRAMMING [10]
DPP Formulation — Investment problem — General allocation problem — Stage coach problem — Production scheduling - LPP.
4. INVENTORY CONTROL [10]
Functions of inventories — Infinite delivery rate with no backordering — Finite delivery rate with no backordering — Infinite delivery rate with ordering — Finite delivery rate with backordering Probabilistic models — Single period models.
5. QUEUEING THEORY [10]
Notation and assumption — Characteristics of Queue — Poisson input process — exponential service times — Queuing models — M/M/C — MIM/S — MIMI1.IN — MIM/SIN — Simple problems.
TEXT BOOKS:
1. Billy.E.Gillet, “Introduction to Operations Research — A Computer Oriented Algorithmic Approach”, 1976, McGraw Hill.
2. Rao.S.S, “Optimization Theory and Applications”, 1981, Wisely Eastern.
3. Taha .H.A, “Operations Research an Introduction”, 3 Edition, 1982, Macmillan Pub.
REFERENCES:
1.. Ackoff Sasieni M.V, “Fundamentals of Operations Research”, 1968, Wisely Eastern.
2. Bunday D.Bruab, “Basic Optimization on Methods”, 1984, Edward Arnold Pub.
3. Kanti Swaroop et al, “Operations Research”, 1995, Sultan Chand.
