Credit Weight: 0.5 Prerequisite(s): One of Mathematics 1071, 2255 or 2070; or permission of the Chair of the Department Description: Linear programming including simplex methods, sensitivity analysis, the duality theorem, complementary slackness, and the dual simplex method. Integer programming. Selected topics from: interior point method, quadratic programming, network flows, transportation algorithms, and two-person zero-sum games. Offering: 3-0; 0-0

Mathematics 3331 Linear Programming and Applications

Credit Weight: 0.5 Prerequisite(s): One of Mathematics 1071, 2255 or 2070; or permission of the Chair of the Department Description: Linear programming including simplex methods, sensitivity analysis, the duality theorem, complementary slackness, and the dual simplex method. Integer programming. Selected topics from: interior point method, quadratic programming, network flows, transportation algorithms, and two-person zero-sum games. Offering: 3-0; 0-0




There are no comments for this course.