MATH 3800 Linear and Nonlinear Optimization

Iterative Algorithms, oprimization process and Linear Programming (LP), including the Graphical method and simplex method. Duality and Sensitivity analysis, LP applications in business and health. Nonlinear Unconstrained problems and various Descent methods. Nonlinear Constrained optimization, including Primal, Penalty, and Barrier methods. Prerequisite(s): MATH 2020
Credits: 3.0