15ME561 Optimization Techniques syllabus for ME



A d v e r t i s e m e n t

Module-1 8 hours

Introduction to Classical Optimization Techniques

Statement of an Optimization problem – design vector – design constraints – constraint surface – objective function – objective function surfaces – classification of Optimization problems.

Classical Optimization Techniques

Single variable Optimization, Multi variable Optimization with and without constraints, Multivariable Optimization with equality constraints - solution by method of Lagrange multipliers, Multivariable Optimization with inequality constraints - Kuhn – Tucker conditions.

Module-2 10 hours

Linear Programming

Various definitions, statements of basic theorems and properties, Advantages, Limitations and Application areas of Linear Programming, Graphical method of Linear Programming problem.

Simplex Method – Phase I and Phase II of the Simplex Method, The Revised Simplex method, Primal and Dual Simplex Method, Big – M method.

Module-3 8 hours

Transportation Problem

Finding initial basic feasible solution by north – west corner rule, least cost method and Vogel’s approximation method – testing for optimality of balanced transportation problems. (Including assignment and travelling salesman problems) (No degeneracy problems)

Queuing Queuing

Models : Essential features of queuing systems, operating characteristics of queuing system, probability distribution in queuing systems, classification of queuing models, solution of queuing M/M/1 :  /FCFS, M/M/1 : N/FCFS, M/M/C : /FCFS, M/M/C : N/FCFS.

Module-4 8 hours

Dynamic Programming

Dynamic programming multistage decision processes – types – concept of sub optimization and the principle of optimality – computational procedure in dynamic programming – examples illustrating the calculus method of solution - examples illustrating the tabular method of solution.

Integer Programming

Pure and mixed integer programming problems, Solution of Integer programming problems – Gomory’s all integer cutting plane method and mixed integer method, branch and bound method, Zero-one programming.

Module-5 8 hours

Simulation Modeling

Introduction, Definition and types, Limitations, Various phases of modeling, Monte Carlo method, Applications, advantages and limitations of simulation

Inventory Models

Role of demand in the development of inventory models, objectives, inventory costs, quantity discount, Economic Order Quantity (EOQ), EOQ when stock replenishment is not instantaneous, Economic lot size when shortages are allowed, economic lot size with different rate of demand in different cycles (Instantaneous replenishment). (No Dynamic EOQ Models)

Last Updated: Tuesday, January 24, 2023