22MBA24 Operations Research syllabus for MBA

Introduction:

Evolution of OR, Definitions of OR, Scope of OR, Applications of OR, Phases in OR, Characteristics and limitations of OR, models used in OR, Quantitative approach to decision making models (Theory Only)

Linear programming:

Linear Programming Problem (LPP), Generalized LPP- Formulation of LPP, Guidelines for formulation of linear programming model, Assumption, Advantages, Limitations, Linear Programming problem (LPP), optimal and feasible Solutions by graphical method (minimization and maximization). (Theory and Problems)

Decision Theory:

Introduction, Decision under uncertainty- Maxmin &Minmax, Decision under Risk- Expected Value, Simple decision tree problems. (Only theory). Job Sequencing- ‘n’ jobs on 2 machines, ‘n’ jobs on 3 machines, ‘n’ jobs on ‘m’ machines. Sequencing of 2 jobs on ‘m’ machines. (Theory and Problems).

Transportation Problems:

Formulation of transportation problem, types, initial basic feasible solution using North-West Corner Rule (NWCR), Least Cost Method (LCM) and Vogel’s Approximation method (VAM). Optimality in Transportation problem by Modified Distribution (MODI) method. Unbalanced T.P. Maximization T.P. Degeneracy in transportation problems, application of transportation problem. (Theory and Problems)

Theory of Games:

Definition, Pure Strategy problems, Saddle point, Max-Min and Min-Max criteria, Principle of Dominance, Solution of games with Saddle point. Mixed Strategy problems (Graphical and algebraic methods).

Assignment Problem:

Formulation, Solutions to assignment problems by Hungarian method, Special cases in assignment problems, unbalanced, Maximization assignment problems. Travelling Salesman Problem (TSP). Difference between assignment and T.S.P (Theory and Problems)

Project Management:

Introduction, Construction of networks, Structure of projects, phases of project management-planning, scheduling, controlling phase, work breakdown structure, project control charts, network planning (Theory only)

Critical path method to find the expected completion time of a project, determination of floats in networks, PERT networks, determining the probability of completing a project, predicting the completion time of project; Cost analysis in networks. (Theory and Problems)

Assessment Details (both CIE and SEE)

• The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%.
• The minimum passing marks for the CIE is 50% of the maximum marks.
• Minimum passing marks in SEE is 40% of the maximum marks of SEE.
• A student shall be deemed to have satisfied the academic requirements (passed) and earned the credits allotted to each course if the student secures not less than 50% in the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination) taken together.

Continuous Internal Evaluation:

There shall be a maximum of 50 CIE Marks.

A candidate shall obtain not less than 50% of the maximum marks prescribed for the CIE.

CIE Marks shall be based on:

a) Tests (for 25Marks) and

b) Assignments, presentations, Quiz, Simulation, Experimentation, Mini project, oral examination, field work and class participation etc., (for 25 Marks) conducted in the respective course. Course instructors are given autonomy in choosing a few of the above based on the subject relevance and should maintain necessary supporting documents for same.

Semester End Examination:

The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to 50.

• The question paper will have 8 full questions carrying equal marks.
• Each full question is for 20 marks with 3 sub questions.
• Each full question will have sub question covering all the topics.
• The students will have to answer five full questions; selecting four full question from question number one to seven in the pattern of 3, 7 & 10 Marks and question number eight is compulsory.
• 40 percent theory and 60 percent problem in SEE.

Suggested Learning Resources:

Books

1. Operation research .H.A. Taha, Person Publication 2012

2. Operation research , J.K.Sharma, McMillan Publication 2014

3. Quantitative Techniques in management, N D Vohra McGraw Hill 2015.

4. Quantitative Techniques: Theory and Problems, P.C. Tulsian and Vishal Pandey, Pearson India 2006

Course outcome

At the end of the course the student will be able to :

CO1 Get an insight into the fundamentals of Operations Research and its definition, characteristics and phases L1

CO2 Use appropriate quantitative techniques to get feasible and optimal solutions L3

CO3 Understand the usage of game theory , Queuing Theory and Simulation for Solving Business Problems L2

CO4 Understand and apply the network diagram for project completion L4