Current Semester

SSCM 3843 Optimization Methods

Comprises of two parts.  The first part covers topics on unconstrained optimisation such as one-dimensional and n-dimensional search methods, interpolation method and gradient methods. The second part covers topics on constrained optimisation such as the Kuhn Tucker method, modified Hooke and Jeeves search method, complex method, penalty function methods, and the Sequential Unconstrained Minimization Technique (SUMT).

Skip to toolbar