# 080230037 Optimization Techniques CSE 6th Semester Anna University Coimbatore Syllabus Regulation 2008

Anna university Coimbatore Syllabus

080230037 Optimization Techniques CSE 6th Semester Anna University Coimbatore Syllabus Regulation 2008

Department of Computer science and Engineering

Meant for Anna University Coimbatore,trichy,trinelveli

Syllabus
(Regulation 2008/2010)
___________________________________________________________________________________
Details:
University:Anna University
Year: third  Year
Department: B.E Computer Science and Engineering
Semester:  (VI)
Content: 080230037 Optimization Techniques CSE 6th Semester Anna University Coimbatore Syllabus Regulation 2008
Subject code: 080230037
Subject Name: Optimization Techniques
Regulation: 2008 or 2010
Post Type: Syllabus

UNIT I            INTRODUCTION                                                                                         9

Statement  of  an  optimization  problems   classification  of  optimization  problem  – classical                   optimization   techniques;   Single   variable    optimizations,    Multi    variable optimization, equality constrainst, inequality constraints, No constraints.

UNIT II
LINEAR PROGRAMMING                                                                         9

Graphical method for two dimensional problems central problems of Linear Programming Definitions Simples Algorithm Phase I and II of simplex Method – Revised Simplex Method.

Simplex Multipliers – Dual and Primal Dual Simplex Method Sensitivity Analysis Transportatioproblem and  its  solution   Assignment  problem and  its  solution  Assignment problem and its solution by Hungarian method Karmakar’s method – statement, Conversion of  thLinear Programming problem into threquired form, Algorithm.

UNIT III
NON LINEAR PROGRAMMING                                                               9

NON LINEAR PROGRAMMING (ONE DIMENSIONAL MINIMIZATION: Introduction – Unrestricted search Exhaustive search interval halving method Fibonacci method.

NON LINEAR PROGRAMMING : (UNCONSTRAINED OPRIMIZATION): - Introduction
Random search method Uni variate method – Pattern search methods Hooke and jeeves method, simplex method- Gradient of a function steepest descent method – Conjugate gradient method.

NON LINEAR PROGRAMMING (CONSTRAINED OPTIMIZATION):
Introduction Characteristics of the problem Random search method Conjugate gradient method.

UNIT IV
DYNAMIC PROGRAMMING                                                                     9

Introduction multistage decision processes – Principles of optimality Computation procedures.

UNIT V
DECISIOIN MAKING                                                                                   9

Decisions under uncertainty, under certainty and under risk Decision trees Expected value of perfect information and imperfect information.

TEXT BOOKS:
1.  Kalynamoy   Deb,    Optimization    for    Engineering  Design,   Alogorithms   and
Examples, Prentice Hall, 2004.
2.  Hamdy A Taha, Operations Research An introduction, Pearson Education ,
2002.

REFERENCES:
1.  Hillier / Lieberman, Introduction to Operations Research, Tata McGraw Hill
Publishing company Ltd, 2002.
2.  Singiresu S  Rao,  Engineering optimization Theory and  Practice, New Age
International, 1996.
3.  Mik Misniewski, Quantitative Methods for Decision makers, MacMillian Press
Ltd., 1994.

4.  Kambo N S, Mathematical Programming Techniques, Affiliated East West press, 1991.

Related Searches:

Anna University Coimbatore CSE syllabus
Anna University Coimbatore CSE  6th semester syllabus
Cse syllabus for Anna university coimbatore
080230037  Optimization Techniques  Syllabus
Syllabus for 080230037
Syllabus for Optimization Techniques
Affiliated institutions CSE 6th sem AU coimbatore syllabus
BE cse syllabus for anna university coimbatore
AU coimbatore cse syllabus
AU coimbatore cse fifth semester syllabus
CSE fifth semester syllabus for Anna university coimbatore
Blogger Comment