Course Details
Subject {L-T-P / C} : CS4107 : Optmization Techniques { 3-0-0 / 3}
Subject Nature : Theory
Coordinator : Prof. Anup Nandy
Syllabus
Origin, Characteristics and Techniques, operations research Modeling, Linear Programming Constraints with less than
equal to, equal to and greater than equal to types. The Simplex method, Dual simplex method, Revised simplex
method, Duality theory and sensitivity analysis. Transportation and Assignment problems, Traveling Salesman
problem using branch and bound method, Network analysis including PERT-CPM, Integer programming, Non-linear
programming problem solving using Fibonnacci search method, Golden ratio method, Gradient search method,
Gradient projection method and Hessian matrix method, Queuing theory and applications for different M/M/I and
M/M/C models. Inventory models considering holding cost, ordering cost and penalty costs.
Course Objectives
- To discuss the importance and usage of this course with real life examples.
Course Outcomes
The students will know the scope of different optimization techniques.
Essential Reading
- H. A. Taha, Operations Research an Introduction, Prentice Hall of India
- F. S. Hillier, G. J. Lieberman, Introduction to Operation Research, Mc-Graw-Hill
Supplementary Reading
- S. S. Rao, Optimisation Theory and applications, Wiley Eastern Ltd
- B. E. Gillet, Introduction to Operation Research: a computer oriented algorithmic approach, Tata McGraw Hill