IE 521
INDUSTRIAL SYSTEMS OPTIMIZATION I

Information
521 Credits
Available select Fall terms
Lecture only
OSU Catalog
 Prerequisites
MTH 341
 Contact
Logen Logendran
(541) 737-5239
Rogers 204

Course Description

Techniques for analysis and solution of problems in industrial and management systems. Emphasis on application of linear and integer programming and extensions.

Topics

  • Introduction to linear programming (LP)
  • The simplex method
  • The two-phase and big-M methods for LP problems
  • Duality and sensitivity analysis
  • Integer programming

Learning Outcomes

The student, upon completion of this course, will be able to:

  • Describe (identify/write) the underlying concepts of linear programming that can be used to model complex decision problems for identifying an optimal solution.
  • Develop the theory behind simplex method for solving linear programming problems.management, including those for quantity discounts, safety stocks, and order quantity and reorder point interactions.
  • Show how the two-phase and big-M methods can be used to solve linear programming problems that involve equality and/or greater-than-or-equal to constraints.
  • Develop the theory for dual problems, and establish the relationships to its primal counterpart.
  • Show how sensitivity analysis can be used to investigate into the changes to one or more model parameters.
  • Demonstrate the importance of general, binary, and mixed-integer problems, and show how they can be implicitly solved using branch-and-bound algorithms.