Introduction to optimization problems and algorithms emphasizing problem formulation, basic methodologies, and underlying mathematical structures. Topics include the simplex method, duality theory, sensitivity analysis, large-scale optimization, integer programming, interior-point methods, and nonlinear programming optimality conditions with gradient and conjugate-direction methods; applications and case studies included.

Level

grad

Department

ENG

Credits

4

Prerequisites

EK 103 or MA 142