Course Syllabus

SIE 440 - Survey of Optimization Methods

Spring Semester 1998

 

1997-98 Catalog Data:

SIE 440/540 - Survey of Optimization Methods (3) Survey of methods including network flows, integer programming, nonlinear programming, and dynamic programming. Model development and solution algorithms are covered. 3ES. P, 340.

Text Book:

Winston, W.L., Introduction to Mathematical Programming (2nd ed.), Duxbury Press, 1995.

References: None

Instructor:

J. L. Higle, Associate Professor of Systems and Industrial Engineering

Prerequisites by Topic:

  1. Linear programming models
  2. Duality theory
  3. Simplex algorithm.

Method for Assessing Student Knowledge of Prerequisite Topics:

On the first day of class, an assignment designed to test facility with prerequisite material is distributed. Results are evaluated and the instructor consults with individual students, if necessary.

Goals:

Overall Educational Goal:

This course provides a survey of optimization models and methods. Particular emphasis will be placed on network flow problems, dynamic programming models, integer programs, and nonlinear programs. The objective of this course is the development and application of a variety of mathematical programming methodologies within a number of potential application areas. Due to its "survey" nature, this course is not appropriate for those students desiring an in-depth presentation of the various methodologies covered.

Specific Instructional Goals:

  1. Be able to draw upon a variety of mathematical programming modeling approaches when faced with an optimization problem.
  2. Be able to suggest and implement solution procedures for such problems.

Course Topics:

  1. Linear Programming Review: Formulations, duality, complimentary slackness (6 classes)
  2. Network Flow Models: Formulations (transportation and general network models), network simplex, other network based problems (12 classes).
  3. Dynamic Programming: DP "approach", recursive formulation, resource allocation, equipment replacement (9 classes).
  4. Integer Programming: Formulation, branch and bound, implicit enumeration (12 classes)

Class Requirements:

  1. Three lecture sessions per week.
  2. Approximately seven homework assignments
  3. Two midterm examinations
  4. Final examination

Computer Usage:

Student will use mathematical programming software, such as LINDO, LINGO, and GINO to explore solution techniques.

Laboratory Projects: None

Assessment of Course Goals:

  1. Homework - 25%
  2. Two midterm examinations - 25% each
  3. Final examination - 25%

Contribution to professional component:

1.

Mathematics or Basic Science

0

credits

2.

Engineering Science or Design

3

credits

3.

General Education Requirements

0

credits

4.

Major Design Experience

0

credits

Contribution to program objectives: Goals

Prepared by: J. L. Higle   Date: April 14, 1998

 


to Course List

SIE ABET Information Site
The University of Arizona
October 30, 1998
Systems and Industrial Engineering

http://www.sie.arizona.edu
Web Maintainence:webmaster@sie.arizona.edu
All contents copyright © 1998. All rights reserved.