Nonlinear programming problems, unconstrained optimization search techniques. Kuhn-Tucker theorems, quadratic programming, separable programming, meta heuristics, goal programming, and dynamic programming. Course Information: 3 undergraduate hours. 4 graduate hours. Prerequisite(s): CS 107 or CS 109, and IE 471 or graduate standing.