ORES 601
A SURVEY COURSE IN OPERATIONS RESEARCH
Instructor Dr. Rhonda Aull Hyde
227 Townsend Hall, 831 - 1324
Office Hours 11:00am - 12:00 pm Tuesday & Thursday or by appointment
Operations Research 6th Edition by H. A. Taha
ORES 601 Supplementary Book by R. A. Hyde (available at the Copy Maven)
Optional Texts
GAMS: A User's Guide, 2nd edition (Scientific Press)
Operations Research, by Hillier and Lieberman
Applied Mathematical Programming by Bradley, Hax, & Magnanti
To expose the student to the diversity of OR application areas,
To provide the student with insight into the science and art of mathematical modeling,
To provide the student with fundamental methodological tools.
The 601/602 course sequence presents fundamental concepts, models, and techniques of operations research. The application of operations research models in disciplines such as agriculture, environmental studies, manufacturing, transportation, urban planning and various service industries, is emphasized. Selected readings from professional and academic literature that focus on the implementation/application of OR models are required. The following software will be used for computational needs: LINDO, GAMS.
Students will be evaluated on the basis of performance in the following categories:
Exam 1 (October 12) . . . . . . . . . . . . . . . . . . . 20%
Exam 2 (November 14) . . . . . . . . . . . . . . . . . 20%
Final Exam† . . . . . . . . . . . . . . . . . . . . . . . . . . 20%
Assignments . . . . . . . . . . . . . . . . . . . . . . . . . . 20%
Course LP Project . . . . . . . . . . . . . . . . . . . . . 20%
† Final Exam Date: See final exam schedule.
__________________________________________________________________________
__________________________________________________________________________
Introduction (2) The evolution of operations research; The art of modeling.
Linear Programming (5) Graphical solution; Simplex method; Interpretation of the simplex tableau; Sensitivity analysis; Formulation of LP's with applications in manufacturing, agriculture and transportation.
Integer Programming (4) Cutting plane algorithm; Branch and bound; Formulation of general integer and integer 0/1 problems with applications in urban planning, location strategy, job scheduling, labor staffing and marketing.
Transportation Models (2) Application of these specialized LP models to production planning and assignment problems.
GAMS (2) Introduction to the GAMS language; Presentation of the GAMS tutorial and transportation models.
Networks (2) Minimal spanning tree; Shortest route problem; Max flow/minimum cut problem; Applications in reliability and equipment replacement.
Dynamic Programming (3) The network model; Backward and forward recursive formulations; Applications to the shortest route problem, workforce scheduling and reliability.
Inventory Policies (2) Basic EOQ/EPL Models; Multi-item models; Adaptation of EOQ to Just-in-Time (JIT) inventory systems
ORES 601 DAILY SCHEDULE FALL 97
________________________________________________________________________________
Aug 31 Thur Introduction/Course Overview
Sept 5 Tues The Evolution of Operations Research; Future of Operations Research
Sept 7 Thur Linear Programming - General Structure/Graphical Analysis
Sept 12 Tues Linear Programming - Graphical Sensitivity Analysis/Simplex Method
Sept 14 Thur Linear Programming - Simplex Method
Sept 19 Tues Linear Programming - Simplex Method/Using LINDO
Sept 21 Thur Linear Programming - Comprehensive Example
Sept 26 Tues Integer Programming - Formulation Examples
Sept 28 Thur Integer Programming - The Cutting Plane Algorithm
Oct 3 Tues Integer Programming - Cutting Plane Algorithm/Branch & Bound
Oct 5 Thur Integer Programming - Branch & Bound
Oct 10 Tues Transportation Models - General Structure/NWCR and VAM
Oct 12 Thur TEST 1 - Covers all material through October 5
Oct 17 Tues Transportation Models - Application to Production Planning
Oct 19 Thur GAMS - The Tutorial and a Transportation Problem
Oct 24 Tues GAMS - The Application to Production Planning (see Oct 17)
Oct 26 Thur Dynamic Programming - An Example on Capital Budgeting
Oct 31 Tues Dynamic Programming - Backward Formulations of DP Models
Nov 2 Thur Dynamic Programming - Application to Health Care, Reliability
Nov 7 Tues Networks - Minimal Spanning Tree/Shortest Route Algorithm
Nov 9 Thur Networks - Maximum Flow/Minimum Cut Principle
Nov 14 Tues Inventory Models - ABC Classification/General Characteristics
Nov 16 Thur TEST 2 - Covers all material through November 9
Nov 21 Tues Group Project Meetings
Nov 23 Thur No Class -- Thanksgiving Holiday
Nov 28 Tues Inventory Models - The Basic EOQ Model and Some Extensions
Nov 30 Thur Presentations of Course LP Project
Dec 5 Tues Presentations of Course LP Project
Dec 7 Thur Presentations of Course LP Project / Final Exam Review
___________________________________________________________________________