OA4201 Nonlinear Programming.

(Same as MA4301.) Convex sets, convex functions, and conditions for local and global optimality. Elements and convergence of algorithms for solving constrained and unconstrained optimization problems. Introduction to algebraic modeling languages. Many applications of integer and nonlinear programming to military and civilian problems, such as weapons assignments, force structuring, parameter estimation for nonlinear or constrained regression, personnel assignment and resource allocation.

Prerequisite

OA3201

Lecture Hours

4

Lab Hours

0