[Previous Page] [Next Page] [Up] [Home Page] [Mail] [Contents]

MAT 557 : Mathematical Programming I


An introductory graduate level course for computer science, mathematics, forestry, and business students. Topics covered include linear programming, the duality principle, convex polytopes, the simplex algorithm, the ellipsoid method of Khachiyan, the Karmarkar algorithm, and the primal-dual theory of linear programming. Prerequisite: MAT 425 or MAT 456 or permission. Credits 3.

[Previous] MAT 487 : Numerical Analysis
[Next] MAT 558 : Mathematical Programming II
[Up] Applied Math, Operations Research, Mathematical Modeling
[Home] Home Page
[Mail] Send EMail to Maine Math Talent Search
[Contents] Maine Math Talent Search Contents

Last modified on Tuesday, January 12, 1999