MATH 561 - Linear Programming I
Fall 2013, Section 001
 Instruction Mode: Section 001 is (see other Sections below) Subject: Mathematics (MATH) Department: LSA Mathematics
See additional student enrollment and course instructor information to guide you in your decision making.
Page Index

#### Details

Credits:
3
Requirements & Distribution:
BS
MATH 217, 417, or 419.
Other Course Info:
F, W, Sp.
BS:
This course counts toward the 60 credits of math/science required for a Bachelor of Science degree.
Repeatability:
May not be repeated for credit.
Cross-Listed Classes:
 IOE 510 - Linear Program I, Section 001 TO 518 - Linear Program I, Section 001

#### Description

Background and Goals: A fundamental problem is the allocation of constrained resources such as funds among investment possibilities or personnel among production facilities. Each such problem has as itâ€™s goal the maximization of some positive objective such as investment return or the minimization of some negative objective such as cost or risk. Such problems are called Optimization Problems. Linear Programming deals with optimization problems in which both the objective and constraint functions are linear (the word "programming" is historical and means "planning" rather that necessarily computer programming). In practice, such problems involve thousands of decision variables and constraints, so a primary focus is the development and implementation of efficient algorithms. However, the subject also has deep connections with higher-dimensional convex geometry. A recent survey showed that most Fortune 500 companies regularly use linear programming in their decision making. This course will present both the classical and modern approaches to the subject and discuss numerous applications of current interest.

Content: Formulation of problems from the private and public sectors using the mathematical model of linear programming. Development of the simplex algorithm; duality theory and economic interpretations. Postoptimality (sensitivity) analysis; algorithmic complexity; the ellipsoid method; scaling algorithms; applications and interpretations. Introduction to transportation and assignment problems; special purpose algorithms and advanced computational techniques. Students have opportunities to formulate and solve models developed from more complex case studies and use various computer programs.

Subsequent Courses: IOE 610 (Linear Programming II) and IOE 611 (Nonlinear Programming)

#### Schedule

MATH 561 - Linear Programming I
Schedule Listing
001 (LEC)
In Person
12159
Closed
0

-
 MW 9:00AM - 10:30AM 1010 DOW
9/3/13 - 12/11/13

#### Textbooks/Other Materials

The partner U-M / Barnes & Noble Education textbook website is the official way for U-M students to view their upcoming textbook or course material needs, whether they choose to buy from Barnes & Noble Education or not. Students also can view a customized list of their specific textbook needs by clicking a "View/Buy Textbooks" link in their course schedule in Wolverine Access.

Click the button below to view and buy textbooks for MATH 561.001

#### Syllabi

Syllabi are available to current LSA students. IMPORTANT: These syllabi are provided to give students a general idea about the courses, as offered by LSA departments and programs in prior academic terms. The syllabi do not necessarily reflect the assignments, sequence of course materials, and/or course expectations that the faculty and departments/programs have for these same courses in the current and/or future terms.

Click the button below to view historical syllabi for MATH 561 (UM login required)

#### CourseProfile (Atlas)

The Atlas system, developed by the Center for Academic Innovation, provides additional information about: course enrollments; academic terms and instructors; student academic profiles (school/college, majors), and previous, concurrent, and subsequent course enrollments.