Operations Research

Paper Code: 
MBB 226
Credits: 
4
Contact Hours: 
60.00
Max. Marks: 
100.00
Objective: 

Course Outcomes (COs)

Courseoutcomes

Learningandteaching strategies

AssessmentStrategies

  

On completion of this course, the students will be able to;

CO 83.Develop linear programming (LP) models and perform sensitivity analysis

CO 84.Propose the best strategy using decision making methods under uncertainty and game theory

CO 85.Analyze the mathematical tools that are needed to solve optimization problems

CO 86.Compare the characteristics of different types of decision-making environments

CO 87.Apply the appropriate decision making approaches in a given problem.

CO 88.Compare and analyze different approaches in a given problem

Approach inteaching:Interactive Lectures,Group Discussion,Tutorials,CaseStudy

 

Learning activitiesfor the students:Self-learningassignments,presentations

Class test,Semester endexaminations,Quiz,Assignments,Presentation

  
 

 

 

12.00

Operations Research- Meaning, Nature, Scope and Role of Operations Research, Scientific approach in decision-making, Techniques of OR, Limitations of OR

Linear Programming-Mathematical formulation of Linear Programming problems and their solution using Graphic approach. Simplex method.

 

12.00

Linear Programming- Special Cases- Unbounded solution, Multiple Solutions, Non-Feasible solutions, Degenerate solutions,  Primal and its dual. Introduction to Sensitivity Analysis

Transportation-General structure of transportation problem, methods of finding initial basic feasible solution (NWCM, LCM & VAM), test for optimality (MODI Method), Cases of unbalanced problems, Degeneracy, Multiple solutions and Prohibited Routes.

 

12.00

Assignment- Solving the problem. Cases of unbalanced problems, multiple optimum solutions, maximization objective and unacceptable assignments

Sequencing Problems- General Assumptions, Basic Terminology, Processing n-jobs through two machines, Processing n-jobs through three machines, Processing n-jobs through m- machines

 

12.00

Decision Theory-Decision-Making under certainty, uncertainty and risk, Decision tree analysis, Queuing theory-Introduction, elementary queuing system, single channel queuing model ( with Poisson arrivals and exponential service times.)

 

12.00

Theory of Games-Two persons Zero Sum games. Markov’s analysis-Introduction, application, state transition matrix, n steps transition probabilities, Markov Chain Algorithm.

 

Essential Readings: 
  • ShrivastavaShenoy Sharma, Quantitative Techniques in Management, New Age Publications
  • J. K. Sharma, Operations Research”, McMillan India
  • N. D. Vohra, Quantitative Techniques in Management”,  Tata McGraw Hill Publications
  • Anderson Williams ,Quantitative Methods for Business,  10th Edition Thopson

 

 

References: 

Suggested readings

  • Tulisian, Quantitative Techniques Theory and Problems, Pearson Education.
  • S. D. Sharma, Operations Research, KedarNath and Ram Nath& Co. Ltd.

E resources

Journals

  • Gyan Management
  • Indian Journal of Marketing

 

Academic Year: 
2022-2023
  • Printer-friendly version
  • PDF version