List of all IE courses

Information
4 Credits
Available fall term
Lecture only

OSU catalog link

Prerequisites
ST 314;
MTH 306 or MTH 341
Contact
Hector Vergara
541.737.0955
422 Rogers Hall

Course Description

A first course in operations research. Topics include mathematical programming formulations and solutions, the simplex method, network optimization, introduction to metaheuristics, and linear programming under uncertainty.

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:

  1. Formulate mathematical programming models for a variety of written case problems.
  2. Solve small linear programs manually using the simplex method.
  3. 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.
  4. Apply specialized network algorithms to solve specific network optimization problems.
  5. Apply metaheuristic algorithms to difficult optimization problems.
  6.  Apply sensitivity analysis to deal with uncertainty in linear programs, and identify different techniques that can be used to solve optimization problems under uncertainty.