MA 419 - Intro to Non-Linear Optimization

Lecture Hours: 3
Lab Hours: 0
Credit Hours: 3

This course is a continuation of MA-319 to include a review of linear programming using the Simplex algorithm, an industry standard programming language and solvers; review of multivariable calculus topics; and a survey of various techniques for optimizing functions that are not in the realm of linear programming. The Kuhn-Tucker conditions of optimality are discovered. Techniques including branch & bound for integer programming and search methods for quadratic programming and other non-linear problems are covered. Specific techniques for formulations for integer programming problems, including network models, are covered. Prerequisite(s): MA 319 and MA 215