2016-2017 Undergraduate Catalog 
    
    Aug 05, 2020  
2016-2017 Undergraduate Catalog [ARCHIVED CATALOG]

MAT 360 - Optimization Methods


The objective of this course is to introduce the students to fundamental notions of convex analysis and methods of linear optimization.  Topics discussed include: properties and representation of convex sets, properties of convex functions, convexity criteria, necessary and sufficient conditions of optimality for linear optimization problems with constraints, the simplex method and duality theory. Numerical methods for optimization problems with differentiable functions will be presented. Some emphasis will be put on development of optimization models relevant to statistics and business.

Prerequisite:  MAT 356  
Offered when there is sufficient student demand.
1 semester 3 credits.