{"product_id":"9789333220798","title":"Operation Research  for SPPU 15 Course (BE - I - Mech. - 402045B) (OLD EDITION)","description":"\u003cp\u003eUNIT 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.  (Chapters - 1, 2, 3) UNIT 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.  (Chapters - 4, 5) UNIT 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 x 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.   (Chapters - 6,7) UNIT 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.  (Chapter - 8) UNIT 5 :    Queuing Theory and Sequencing Models Queuing Theory : Introduction, Basic 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. (Chapters - 9, 10) UNIT 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. Solution of LPP by Dynamic Programming.  (Chapters - 11, 12)\u003c\/p\u003e","brand":"Technical Publications","offers":[{"title":"Default Title","offer_id":44085572895012,"sku":"9789333220798","price":105.0,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0671\/3661\/8788\/files\/9789333220798__2__Operation_Research.jpg?v=1694686775","url":"https:\/\/bookstation.in\/products\/9789333220798","provider":"BookStation","version":"1.0","type":"link"}