MATH 233
Spring 2009
| Section:
01
|
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, and geometric programming. |
|
Essential Capabilities:
Logical Reasoning, Quantitative Reasoning
This course will focus on the creation of formally correct inductive and deductive arguments, and will train students to formulate mathematical theories and descriptions of specific and complex objects.
|
| Credit: 1 |
Gen Ed Area Dept:
NSM MATH |
| Course Format: Lecture | Grading Mode: Graded |
| Level: UGRD |
Prerequisites: None |
|
Fulfills a Requirement for: (MATH) |
|
Past Enrollment Probability: Not Available |
|
|