Syllabus ,AOT Question papers, Answers, important Question Advanced Optimization Techniques, R13 Regulation, B.Tech , JNTUK,Syllabus, download,
INTRODUCTION TO OPTIMIZATION: Engineering applications of optimization- statement of an optimization problem- classification of optimization problem- optimization techniques. CLASSICAL OPTIMIZATION TECHNIQUES: Single variable optimization- multivariable optimization with equality constraintsmultivariable optimization with inequality constraints.
UNCONSTRAINED OPTIMIZATION TECHNIQUES: pattern search method- rosenbrock's method of rotating coordinates- the simplex methoddescent methods- gradient of function- steepest descent method.
CONSTRAINED OPTIMIZATION TECHNIQUES: characteristics of a constrained problem- methods of feasible directions - basic approach in the penalty function method- interior penalty function method- convex programming problem- exterior penalty function method.
GEOMETRIC PROGRAMMING (G.P): Solution of an unconstrained geometric programming, differential calculus method and arithmetic method. primal dual relationship and sufficiency conditions. Solution of a constrained geometric programming problem (G.P.P). Complimentary geometric programming (C.G.P).
DYNAMIC PROGRAMMING (D.P): Multistage decision processes. concepts of sub optimization, computational procedure in dynamic programming calculus method and tabular methods. Linear programming as a case of D.P., Continuous D.P.
INTEGER PROGRAMMING (I.P): Graphical representation. Gomory's cutting plane method. Bala's algorithm for zero-one programming problem. Integer non linear programming.