Linear Programming
MATH 233
Fall 2006 not offered
|
Linear programming develops practical techniques for optimizing linear functions on sets defined by systems of linear inequalities. Because many mathematical models in the physical and social sciences are expressed by such systems, the techniques developed in linear programming are very useful. This course will present the mathematics behind linear programming and related subjects. Topics covered may include the following: the simplex method, duality in linear programming, interior-point methods, two-person games, some integer-programming problems, Wolfe's method in quadratic programming, the Kuhn-Tucker conditions, geometric programming, and the Brouwer fixed-point theorem. |
|
Essential Capabilities:
Quantitative Reasoning |
| Credit: 1 |
Gen Ed Area Dept:
NSM MATH |
| Course Format: Lecture | Grading Mode: Graded |
| Level: UGRD |
Prerequisites: None |
|
Fulfills a Requirement for: None |
Major Readings:
Joel Franklin, METHODS OF MATHEMATICAL ECONOMICS
|
Examinations and Assignments:
Weekly homework, take-home midterm and final. |
Additional Requirements and/or Comments:
Students taking this course should already have taken MATH221 (or 223) and MATH222. |
| Drop/Add Enrollment Requests | | | | | |
| Total Submitted Requests: 0 | 1st Ranked: 0 | 2nd Ranked: 0 | 3rd Ranked: 0 | 4th Ranked: 0 | Unranked: 0 |
|
|