Coming soon
Optimization Techniques
This paper aims at teaching the students various optimization techniques and to introduce them with the concept of operational research.
History and scope of operation research limitations and advantages concept of basis, basic feasible solutions, convex sets and extreme points. Definition of General L.P.P., formulation problems of L.P.P,
Graphical Method of solving L.P.P., bounded and unbounded solutions, Simplex Method: Theory of Simplex Method, M-Charne’s simplex method. Degeneracy in linear programming.
Two-Phase simplex method, Duality in linear programming. Assignment problem
North West Corner rule, Least-Cost method, and Vogel’s approximation method (VAM) to find the starting solution (initial basic feasible solution). Procedure to find the optimal solution using MODI method.
Introduction, description and characteristics of game theory, two person zero sum game, solution of pure and mixed strategy problems-principle of dominance. solution of mix game by linear programming method.
1 Taha, H.A. (1998): Operation Research: An Introduction, Prentice Hall of India Ltd
2 Sharma, S.D. (1997): Operation Research, Kedar nath Ramnath and Co. (Publishers)
3 Khandelwal R.S.: Quantitative technique
1 Garvin, W.W.(1960): Introduction to Linear Programming, McGraw Hill.
2 Rao, S.S.(1984): Optimization Technique and Applications, Wiley Eastern.
