[
Wesleyan Home Page
] [
WesMaps Home Page
] [
WesMaps Archive
]
[
Course Search
] [
Course Search by CID
]
| |
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.
COURSE FORMAT: Lecture
Level: UGRD Credit: 1 Gen Ed Area Dept: NSM MATH Grading Mode: Graded
Prerequisites: NONE Links to Web Resources For This Course.
Last Updated on MAR-30-2006
Copyright Wesleyan University, Middletown, Connecticut, 06459