0% found this document useful (0 votes)
13 views1 page

Operations Research

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
13 views1 page

Operations Research

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
Course Name OPERATIONS RESEARCH Course Code PR1009° Credits 3 LTP 21-0 Course Objectives: 1 At the end of the course, the students should be able to analysing different situations in the industrial/ business scenario involving limited resources and finding the optimal solution within constraints 2] At the end of the course, the students should be able use operations research fundamentals and methodology in industries Total Number of Lectures — 28 S.No. | Course Content Number of Lectures INTRODUCTION Origin and Development of Operations Research, Scope Of Operations 1. | Research (OR), General Methodology Of OR, OR And Managerial Decision 3 Making, OR Applications In Industrial And Non-Industrial Fields. Classification Of Optimization Problems; Optimization Techniques. LINEAR OPTIMIZATION MODELS Formulation Of Linear Programming Problem, Graphical Solution, Sensitivity Analysis In Graphical Solution, Comparison Of Graphical And Simplex 2. | Algorithm, Simplex Algorithm, Computational Procedure In Simplex, Big M 9 Method, Two Phase Method, Degeneracy, Duality And Its Concept, Application Of LP Model To Product Mix And Production Scheduling Problems, THE TRANSPORTATION MODEL Solution Methods, Balanced and Unbalanced Problems, Vogel's Approximation Method, Degeneracy in Transportation Problems. Assignment Problem, Methods for Solving Assignment Problems. The Traveling Salesman 5 Problem. Numerical On Transportation, Assignment and Traveling Salesman Method. Computer Algorithms For Solution To LP Problems 4,_ | DYNAMIC PROGRAMMING PROBLEMS 3 Model Formulation, Computational Procedures, Solution In Different Stages. 3 GAME PROBLEMS 5. | Minimax Criterion And Optimal Strategy; Two Person Zero Sum Game; 4 Games By Simplex Dominance Rules. PERT AND CPM 6, _ | Network Representation. Critical Path Computations. Construction of The 4 Time Schedule. Linear Programming Formulation of CPM. PERT Calculations. Course Outcome 1__| Analyse any real life system with limited constraints and depict it in a model form, 2__| Convert the industry/ real life problem into a mathematical model using basic software. 3 _| Apply the PERT/CPM for a constraint based problem of service/ manufacturing 4 _ | Understandand solve variety problems of assignment, transportation, travelling salesmanand sequencing Bibliography:

You might also like