Optimization Techniques

Paper Code: 
STT 502
Credits: 
3
Contact Hours: 
45.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.

Course

Learning outcomes (at course level

Learning and teaching strategies

Assessment Strategies

 

Paper Code

Paper Title

STT-502

Optimization Techniques

 

CO 54: Ability to Demonstrate the knowledge about the scope, principles and models of Operation Research, concept of  simplex, duality and able to solve linear programming problems.

 

CO 55: Ability to describe the concept of transportation and assignment problem and Discuss various methods to solve them and also obtain the optimum values for techniques.

 

CO 56: Ability to learn the concept of game theory and solve related problems.

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

 

9.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,

 

9.00
Unit II: 
UNIT II

Graphical Method of solving L.P.P., bounded and unbounded solutions, Simplex Method: Theory of Simplex Method, M-Charne’s simplex method. Degeneracy in linear programming.

9.00
Unit III: 
UNIT III

Two-Phase simplex method, Duality in linear programming. Assignment problem.

 

10.00
Unit IV: 
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.

 

8.00
Unit V: 
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.

 

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)
  • 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.

 

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