1: Introduction: Operation Research Introduction: Definition, Evolution and Classification of Quantitative Methods and Operations Research Techniques, Methodology, Advantages and Limitations. Linear Programming Problem: Introduction, Formulation of LPP, Solution of LPP by Two Phase Method only. Decision Theory: Meaning and Steps in Decision Making, Types of Management Decisions, Decision under Certainty, under Risk, under Uncertainty, Decision Trees. 2: Transportation and Assignment Model Introduction, Formulation, Basic Method of Solving Transportation Problem, Optimization Methods like UV and Stepping Stone Method, Assignment Problem- Hungarian Method to solve Assignment Problem. 3: Theory of Games and Linear Programming Theory of Games: Introduction, Minimax and Maximin Principle, Solution of Game with Saddle Point, Solution by Dominance, Solution by Graphical Method, m × n size Game Problem, Iterative method, Introduction to formulation of games using Linear Programming.Replacement Analysis: Replacement of Items that Deteriorate, Replacement of Items that Fail Suddenly. 4: Project Management Network Models: Fulkerson‘s rule, concept and types of floats, CPM and PERT, Crashing Analysis and Resource Scheduling. Simulation: Introduction, Monte-Carlo Simulation method, Simulation of Inventory and Queuing Problems. 5: Queuing Theory and Sequencing Models Queuing Theory: Introduction, Basis Structure, Terminology (Kendal‘s Notations) and Applications.Queuing Model M/M/1: /FIFO, M/M/c. Sequencing models: Solution of sequencing Problem - Processing of n jobs through two machines, Processing of n jobs through three machines, Processing of two jobs through m Machines, Processing of n jobs through m Machines. 6: Integer and Dynamic Programming Integer Programming : Introduction to Integer Programming, Cutting plane method and Branch and Bound Method. Dynamic Programming: Introduction, DP Model, Applications of DP Model to shortest route problems.
