Page no:88
MT41-Optimization Techniques Objective : To introduce linear programming, dynamic programming and related optimization theories to solve real life / simulated problems.
Sr. No. 1 Chapter Details Linear Programming Various definitions, statements of basic theorems and properties, Advantages, Limitations and Application areas of Linear Programming Linear Programming – The Graphical method – Graphical Solution methods of Linear Programming problem, Maximization Linear Programming problem, Maximization Problem. Linear Programming – Simplex Method – Phase I and Phase II of the Simplex Method, The Revised Simplex method, Primal and Dual Simplex Method, Simplex Algorithm for maximization case, Simplex Algorithm for minimization case – Two phase method and the Big –M method. Transportation Problem and its solution, Assignment Problem and its solutions by Hungarian Method Integer Programming Gomory Cutting Plan Methods – Branch and Bound Method Queuing Theory Characteristics of Queuing Models. Transient and Steady states of the System. Model – I [ (M/M/1) : (FCFS / ? /? ) ] Model II – Generalization of Model [ (M/M/1) : (FCFS / ? / ? ) ] (Birth- Death Process) [(M/M/1) : (FCFC / N/ ? ) (Finite Queue Length Model) Replacement Theory Replacement of items that deteriorates. Replacement of items that fails suddenly, Individuals and Group Replacement- Policy Nos. of Session Reference Books
15
5,8,6
2
5
2,5
3
8
2,5
4
04
3,1