CIVL 8263 - Intro. to Num. Opt. for Eng **

Credit Hours: (3)

Description Introduce the concepts, modeling and solution methods of unconstrained optimization and linear and integer programs. Topics include: convex analysis and polyhedral sets, unconstrained optimization methods (line search, trust region), the simplex method, duality theory, and decomposition principles.