April, 1999

MATH 480 Operations Research

Course Outline

1. The Nature of Operations Research

A. The History of Operations Research

B. Formulating Models

2. Linear Programming

A. Introduction

B. The Simplex Method - Algorithm

C. The Simplex Method - Theory

D. Duality and Sensitivity Analysis

3. Project Scheduling

A. network Analysis with PERT and CPM

4. Dynamic Programming

A. Deterministic Dynamic Programming

B. Probabilistic Dynamic Programming

5. Integer Programming

A. The Simplex Method Again

B. Binary Variables

6. Queuing Theory

A. Basic Structure of Queuing Models

B. The Birth and Death Process

7. Stochastic Stimulation

A. Experimental Design for Simulation

B. The Regenerative Method of Statistical Analysis

Prerequisites: MATH 311 and 320 with grades of "C" or better.

Click Here to return to courses offered.