Operation Research

Paper Code: 
DSTT 801(B)
Credits: 
4
Contact Hours: 
60.00
Max. Marks: 
100.00
Objective: 

This paper aims at teaching the students various optimization techniques and to introduce them with the concept of operational research. 

 

Students will be able to:

 

 

Course

Learning outcomes (at course level

Learning and teaching strategies

Assessment Strategies

Paper Code

Paper Title

DSTT 801(B)

Operation Research 

CO 112: Solve the linear programming problems graphically as well as with the help of the concept of simplex and duality. 

 

CO 113: Solve the problem regarding best assignments in companies, real life situations.

 

CO 114: Obtain the optimum cost and profit in transportation of goods from different sources to destinations. 

 

CO 115: Learn the concept of game theory and solve related problems which come across in financial markets.

 

CO 116: Describe to how inventory management provides the desired level of customer service, to allow cost-efficient operations, and to minimize the inventory investment.

Approach in teaching:

Interactive Lectures,

Group Discussion,

Classroom Assignment

Problem Solving Sessions

 

Learning activities for the students:

 

Assignments

Seminar

Presentation

Subject based Activities

Classroom Quiz

Assignments

Class Test

Individual Presentation

 

 

 

12.00
Unit I: 

Linear Programming: History and scope of operation research limitations and advantages concept of basis, basic feasible solutions, convex sets and extreme points. Definition of General L.P.P., formulation problems of L.P.P, Graphical Method of solving L.P.P., bounded and unbounded solutions.

12.00
Unit II: 

Simplex Method: Theory of Simplex Method, M-Charne’s simplex method. Degeneracy in linear programming. Two-Phase simplex method, Duality in linear programming.

12.00
Unit III: 

Assignment problem: balanced and unbalanced problem. Transportation Problem: North West Corner rule, Least-Cost method, and Vogel’s approximation method (VAM) to find the starting solution (initial basic feasible solution). Procedure to find the optimal solution using MODI method. Degeneracy in transportation problems.

12.00
Unit IV: 

Theory of games: introduction, description and characteristics of game theory, two person zero sum game, solution of pure and mixed strategy problems-principle of dominance. solution of mix game by linear programming method.

12.00
Unit V: 

Inventory control: Introduction, EOQ models with and without shortages.

Essential Readings: 
  • Taha, H.A. (2007): Operation Research: An Introduction, Prentice Hall of India Ltd. 
  • Sharma, S.D. (1997): Operation Research, Kedar nath Ramnath and Co. (Publishers) 
References: 

SUGGESTED READINGS: 

  • Khandelwal R.S.: Quantitative technique, first edition 
  • Garvin, W.W.(1960): Introduction to Linear Programming, McGraw Hill. 
  • Rao, S.S.(1984): Optimization Technique and Applications, Wiley Eastern. 

e-RESOURCES:

JOURNALS:

  • Sankhya The Indian Journal of Statistics, Indian Statistical Institute
  • Aligarh Journal of Statistics, Department of Statistics and Operations Research, Aligarh Muslim University
  • Afrika Statistika, Saint-Louis Senega University
  • International Journal of Statistics and Reliability Engineering, Indian Association for Reliability and Statistic
  • Journal of the Indian Society for Probability and Statistics, Indian Society for Probability and Statistics
  • Journal of the Indian Statistical Association, Indian Statistical Association
  • Statistica, Department of Statistical Sciences Paolo Fortunato, University of Bologna
  • Statistics and Applications, Society of Statistics, Computer and Applications
  • Stochastic Modeling and Applications, MUK Publications and Distributions
Academic Year: 
2023-2024
  • Printer-friendly version
  • PDF version