Description
CONTENTS : Linear Programming and examples, Convex Sets, Hyperplanes, Open and Closed half-spaces, Feasible, Basic Feasible and Optimal Solutions, Extreme Points & graphical methods. Simplex method, Charnes-M method, Two phase method, Determination of Optimal solutions, unrestricted variables, Duality theory, Dual linear Programming Problems, fundamental properties of dual Problems, Complementary slackness, Unbounded solution in Primal. Dual Simplex Algorithm, Sensitivity analysis.
Parametric Programming, Revised Simplex method, Transportation Problems, Balanced and unbalanced Transportation problems, U-V method, Paradox in Transportation problem, Assignment problems, Integer Programming problems: Pure and Mixed Integer Programming problems, 0-1 programming problem, Gomary’s Algorithm, Branch & Bound Technique, Travelling salesman Problem.
