Course Content:
Sr. Teaching
Topics
No Hrs.
.
1 Introduction to Optimization: 02
Unimodal function
Elimination Methods: unrestricted search, exhaustive search.
Dichotomous search, Interval halving method, Fibonacci method,
Golden section method
Interpolation Methods: Quadratic and cubic interpolation methods.
Direct Root methods: Newton method, Quasi-Newton method,
Secant method.
6 Geometric Programming: 06
Introduction, posynomials
Unconstrained Geometric Programming Problem: Arithmetic
Geometric inequality, PrimalDual relationship and Sufficiency
conditions.
Constrained Geometric Programming problem
Applications of Geometric Programming