MATH233 - Linear Programming

[ Wesleyan Home Page ] [ WesMaps Home Page ] [ WesMaps Archive ] [ Course Search ] [ Course Search by CID ]
Academic Year 2004/2005

Linear Programming
MATH 233 FA

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.

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.

COURSE FORMAT: Lecture

REGISTRATION INFORMATION

Level: UGRD Credit: 1 Gen Ed Area Dept: NSM MATH Grading Mode: Graded

Prerequisites: NONE

SECTION 01

Instructor(s): Scowcroft,Philip H.

Times: .M.W... 02:40PM-04:00PM; Location: SCIE139;

Reserved Seats: (Total Limit: 25)

SR. major: 6 Jr. major: 6

SR. non-major: 2 Jr. non-major: 2 SO: 6 FR: 3

Special Attributes:

Curricular Renewal: Quantitative Reasoning

Links to Web Resources For This Course.

Last Updated on MAR-21-2005