IE 425
INDUSTRIAL SYSTEMS OPTIMIZATION

Information
4 Credits
Available Fall term
Lecture only
OSU Catalog
 Prerequisites
ST 314
MTH 306		 Contact
David S. Kim
(541) 737-8858
Covell 121

Course Description

Techniques of analysis, and solution of problems in industrial and management systems.  Emphasis on applications of linear programming, integer programming and queuing analysis.

Topics

  • Mathematical Programming Formulations
  • Using the Computer to Solve Mathematical Programs
  • Simplex Method for Solving Linear Programs
  • Special Network Optimization Algorithms
  • Metaheuristics
  • Probability Concepts, Queuing Models

Learning Outcomes

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

  • Formulate mathematical programming models for a variety of written case problems.
  • Solve small linear programs manually using the simplex method.
  • Identify different types of mathematical programming formulations such as linear, integer, and nonlinear models, and an understanding of their characteristics that determine solution approaches and feasibility.
  • Apply specialized network algorithms to solve specific network optimization problems.
  • Apply metaheuristic algorithms to difficult optimization problems.
  • Utilize conditional expectation and probability concepts to derive expectations and probabilities in simple word problems.