Skip to content

Course Outline

Course Identification

Field Detail
Course Title Optimization Methods
L–T–P 3 – 0 – 1
Total Credits 4
Lecture Credits 3
Tutorial Credits 0
Practical / Practice Credits 1
Eligibility Criteria Graduation
Pre-requisite NIL
Total Lecture Hours 45 (10 + 10 + 15 + 10)
Total Practical Hours 30

Course Objectives

The course aims to impart comprehensive knowledge about operations research and optimization techniques. Its objectives are to help students understand the fundamental concepts of operations research, to discuss and analyze the need for various optimization techniques, to design and develop appropriate mathematical models, and to formulate and optimize real-world problems using these models.

Course Learning Outcomes

On completing this course, the student will be able to:

  1. Understand the operations research concepts.
  2. Analyse the need of optimisation techniques.
  3. Able to design and develop mathematical models for real applications.
  4. Inculcate modeling skills necessary to describe and formulate optimization problems.

Units

Unit I (10 Hours)

Introduction to the modelling approach of operation research, introduction to linear programming, formulating and solving linear programming models, graphical method, simplex methods. Transportation problems: mathematical formulation, balanced transportation problem, unbalanced transportation problem. Assignment problem — mathematical formulation, Hungarian assignment method, travelling salesman problem.

Unit II (10 Hours)

Game theory: Formulation of two-person, zero-sum games and games with mixed strategies. Sequencing problems: processing of n jobs through 2 machines, processing of 2 jobs through m machines. Integer Programming: Gomory's method, branch and bound method. Network Scheduling: Basic terms, critical path methods (CPM), program evaluation and review technique (PERT).

Unit III (15 Hours)

Queuing Theory: Characteristics of queuing systems, Poisson process and exponential distribution, steady state M/M/1, M/M/C (Models I, II, IV, V), applications of queuing theory. Inventory Control: Inventory Costs, economic order quantity, deterministic inventory problems, EOQ problems with no shortage, with shortage, production problem with no shortage, with shortage.

Unit IV (10 Hours)

Search methods: one dimensional minimisation methods, fibonacci and golden section methods. Non-linear programming: One dimensional minimization method: unconstrained optimization techniques, constrained optimization techniques, graphical solution, Kuhn–Tucker conditions, quadratic programming problems.

Readings

  1. Frederick S. Hillier and Gerald J. Lieberman. Introduction to Operations Research. McGraw-Hill, 2015.
  2. Hamdy A. Taha. Operations Research: An Introduction. Pearson Education India, 2013.
  3. S. S. Rao. Engineering Optimization: Theory and Practice. New Age International, 3rd edition, 2013.
  4. K. Deb. Optimization for Engineering Design: Algorithms and Examples. PHI, 2nd Edition, 2012.
  5. J. S. Arora. Introduction to Optimum Design. Academic Press, 4th Edition, 2017.

List of Practicals (30 hours)

  1. Formulation and graphical solution of linear programming problems. (2 hours)
  2. Solving linear programming problems using simplex method. (2 hours)
  3. Transportation problems: balanced/unbalanced cases. (2 hours)
  4. Assignment problem: Hungarian method and travelling salesman problem. (2 hours)
  5. Game theory: solving two-person zero-sum games with pure and mixed strategies. (2 hours)
  6. Sequencing problems: n jobs through 2 machines, 2 jobs through m machines. (2 hours)
  7. Branch and bound method for integer programming. (2 hours)
  8. Network scheduling: CPM and PERT analysis. (2 hours)
  9. Queuing theory: simulation of M/M/1 queue with Poisson arrivals and exponential service. (2 hours)
  10. Analysis of M/M/C queues (Models I, II, IV, V). (2 hours)
  11. Inventory control: EOQ problems with and without shortages. (2 hours)
  12. Replacement problems: deteriorating items, group vs individual replacement. (2 hours)
  13. Information theory: entropy, mutual information, uncertainty measures. (2 hours)
  14. Search methods: one-dimensional minimization using Fibonacci and golden section methods. (2 hours)
  15. Non-linear programming: unconstrained optimization techniques and graphical solutions. (2 hours)