Linear Programming and Convex Algebraic Geometry
Download as PDF
Overview
Subject area
MAT
Catalog Number
347
Course Title
Linear Programming and Convex Algebraic Geometry
Department(s)
Description
Convex sets in Euclidean n-space, systems of linear inequalities, linear programming, and the simplex method. Linear matrix inequalities, spectrahedra and spectrahedral shadows, semidefinite programming. Use of computer software to solve optimization problems.Prerequisite: MAT 313.
Typically Offered
Fall, Spring
Academic Career
Undergraduate
Liberal Arts
Yes
Credits
Minimum Units
4
Maximum Units
4
Academic Progress Units
4
Repeat For Credit
No
Components
Name
Lecture
Hours
4
Requisites
036221