IOE 510 - Linear Programming I
Section: 001
Term: WN 2008
Subject: Industrial and Operations Engineering (IOE)
Department: CoE Industrial and Operations Engineering
Credits:
3
Requirements & Distribution:
BS
Advisory Prerequisites:
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.
Primary Instructor:

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.

Alternatives: Cross-listed as IOE 510.

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

IOE 510 - Linear Programming I
Schedule Listing
001 (LEC)
P
10977
Closed
0
 
-
MW 9:00AM - 10:30AM
NOTE: Data maintained by department in Wolverine Access. If no textbooks are listed below, check with the department.
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.

No Syllabi are on file for IOE 510. Click the button below to search for a different syllabus (UM login required)

Search for Syllabus
The CourseProfile (ART) system, supported by the U-M Provost’s 3rd Century Initiative through a grant to the Digital Innovation Greenhouse, provides additional information about: course enrollments; academic terms and instructors; student academic profiles (school/college, majors), and previous, concurrent, and subsequent course enrollments.

CourseProfile (ART)