10ME74 Operations Research syllabus for ME


Part A
Unit-1 Introduction 4 hours

Evolution of OR, definition of OR, scope of OR, application areas of OR, steps (phases) in OR study, characteristics and limitations of OR, models used in OR, linear programming (LP) problem-formulation and solution by graphical method.

Unit-2 Solution Of Linear Programming Problems 8 hours

The simplex methodcanonical and standard form of an LP problem, slack, surplus and artificial variables, big M method and concept of duality, dual simplex method.

Unit-3 Transportation Problem 8 hours

Formulation of transportation problem, types, initial basic feasible solution using different methods, optimal solution by MODI method, degeneracy in transportation problems, application of transportation problem concept for maximization cases. Assignment Problem-formulation, types, application to maximization cases and travelling salesman problem.

Unit-4 Integer Programming 6 hours

Pure and mixed integer programming problems, solution of Integer programming problems-Gomory’s all integer cutting plane method and mixed integer method, branch and bound method, Zero-One programming.

Part B
Unit-5 Pert-CPM Techniques 8 hours

Introduction, network construction - rules, Fulkerson’s rule for numbering the events, AON and AOA diagrams; Critical path method to find the expected completion time of a project, floats; PERT for finding expected duration of an activity and project, determining the probability of completing a project, predicting the completion time of project; crashing of simple projects.

Unit-6 Queuing Theory 6 hours

Queuing systems and their characteristics, Pure-birth and Pure-death models (only equations), empirical queuing models – M/M/1 and M/M/C models and their steady state performance analysis.

Unit-7 Game Theory 6 hours

Formulation of games, types, solution of games with saddle point, graphical method of solving mixed strategy games, dominance rule for solving mixed strategy games.

Unit-8 Sequencing 6 hours

Basic assumptions, sequencing ‘n’ jobs on single machine using priority rules, sequencing using Johnson’s rule-‘n’ jobs on 2 machines, ‘n’ jobs on 3 machines, ‘n’ jobs on ‘m’ machines. Sequencing 2 jobs on ‘m’ machines using graphical method.

Last Updated: Tuesday, January 24, 2023