Linear Programming, Introduction, formulation of linear programming problem, Standard and matrix from, graphical solution, simplex method, computational procedure, Big-M method, Two-phase simplex method.
Special cases, Degeneracy, alternative optimal solutions, unbounded solutions, Non-existing optimal solutions. Duality in LPP, primal-dual relation, Formulation of dual problem, primal-dual optimal solution,limitations of LPP.
Revised simplex method,dual simplex method,parametric programming.
Assignment problems, Introduction, Formulation, Hungarian method of solving assignment problem, special cases, Traveling salesman problem.
Basic feasible solution by different methods, fixing optimal solutions-stepping stone methode, MODI method, degenerasity.
Introduction to optimal strategies, solution of 2 x 2, 2 x n, m x 2 games. Concept of dominance, Graphical method of solving. Sequencing problems, n-jobs and one machine. Heuristic problem solving (Continued) n-jobs and two machines, n-jobs and three machines, two jobs and m machines. N-jobs and m-machines.
Network construction, determining critical path, floats, scheduling by network,project duration, variance under probabilistic modes, prediction of date of completion, crashing of a simple networks, resource leveling by network techniques.
Replacement theory, Introduction, Economic life of equipments, Replacement considering both the cases with and without tie value of money, group replacement policy.