IE 303 Operations Research II: Nonlinear Models

Credit Information: 
(3+0+2) 4
Description: 
Nonlinear programming; optimization in one variable, convexity, unconstrained and constrained optimization in many variables, Kuhn-Tucker optimality conditions, direct search and gradient methods; computational complexity; major heuristic approaches: simulated annealing, neural networks, tabu search, genetic algorithms.
Prerequisite: 
IE 202 or equivalent.
Offered by: