Operations Research
Revised: November 2006
Course Description
Convexity, linear programming, simplex algorithm, duality, transportation problems, and integer programming. Prerequisite: MATH 254 or MATH 262, MATH 255. Three semester hours.
Objectives
1. To learn about mathematical modeling
2. To learn about the simplex algorithm and related material.
Text
Hillier, F., Liebermann, G. Introduction to Operations Research, Sixth Edition. McGraw-Hill.
Grading Procedure
Grading procedures and factors influencing course grade are left to the discretion of individual instructors, subject to general university policy.
Attendance Policy
Attendance policy is left to the discretion of individual instructors, subject to general university policy.
Course Outline
-
Chapter 1: The Nature of Operations Research (1 day)
The Origins of Operations Research.
The Impact of Operations Research. -
Chapter 2: Overview of the Operations Research Modeling Approach (3 days)
Formulating the Problem.
Constructing a Mathematical Model.
Deriving a Solution.
Testing the Model and the Solution. -
Chapter 3: Introduction to Linear Programming (6 days)
Prototype Example.
The Linear Programming Model.
Assumptions of Linear Programming. -
Chapter 4: Solving Linear Programming Problems: The Simplex Method (10 days)
Setting up the Simplex Method.
The Simplex Method in Tabular Form.
Post-optimality Analysis. -
Chapter 5: The Theory of the Simplex Method (4 days)
Foundation of the Simplex Method.
The Revised Simplex Method. -
Chapter 6: Duality Theory and Sensitivity Analysis (6 days)
The Essence of Duality Theory.
Economic Interpretation of Duality.
Primal-Dual Relationships. -
Chapter 8: The Transportation and Assignment Problems (6 days)
The Transportation Problem.
A Streamlined Simplex Method for the Transportation Problem. -
Chapter 13: Integer Programming (6 days)
Prototype Example.
The Branch and Bound Technique.