Lecture 3 hours; 3 credits.
Prerequisite: Math 315U, and CS 600.
Optimization techniques for discrete and continuous
functions are studied. Topics to be covered include
simplex method, dual simplex method, cutting plane,
branch-and-bound, dynamic programming, genetic
algorithms, simulated annealing, penalty function methods
and neural nets.