Lecture 1:  Introduction:  What is OR,  Success Stories of OR, the Facility Location Problem

Lecture 2:  Introduction to XPress and the Use of Xpress through Two Examples

Lecture 3:  What is a Math Model, its impact through Workforce Scheduling Examples; 1(daily), 2(Weekly, Consecutive Days Off), 3(Non-consecutive Days Off), 4 (Weekly Shift Scheduling) 

Lecture 4:  What is LP, LP Models;

Lecture 5:  More LP Models

       LP Problem Set 1

Lecture 6:  Linear Programming Methods I : Convex Set, Extreme Point, Linear Independence, Basic Solution, Simplified Simplex Algorithm

Lecture 7:  Linear Programming Methods II -- Simplex Tableau:  Basic Feasible Solution, The relationship of two adjacent BFS, Tableau form of Simplex Method

Lecture 8:  Linear Programming Methods III -- Two Phase Simplex Algorithm

Lecture 9: Linear Programming Methods IV -- Sensitivity Analysis,  Goal Programming

Lecture 10: Sensitivity Analysis, Goal Programming

Lecture 11: Linear Programming Methods IV -- LP review, Problem Sets

                A Sample Exam is posted here

Lecture 12: Midterm Exam

Lecture 13: Introduction to IP Models, The capacitated facility location problem

Lecture 14: IP Models, Assignment Problem, Set covering problem, Traveling Salesman Problem 

Lecture 15: Model Disjunctive, Machine Scheduling.   Branch and Bound Algorithm

Lecture 16: Branch and Bound Algorithm

Lecture 17: Network Flow Models: SPT, MST, ...etc.

Lecture 18: Solving Large Optimization Model -- Reserved for Project.

Lecture 19: Project Presentation.   Coffee and Cookie will be served.

Final Exam. 

Homework:

HW1: Solve the Two Examples using Xpress.  Examine the solutions obtained.

HW2:  Solve the Workforce Scheduling Problem with consecutive days off and any two days off.  Answer the following question: Suppose that employees currently have two consecutive days off.  Is it worthwhile to negotiate with say the union to provide a 5% increase of their salary, but give them any two days off?

HW3:  LP Models: Chapter 2: problems 14,15.

HW4:  Simple Algorithm 1: Chapter 3: problems 1, 5,10,19

Hw5:  Integer Program: Chapter 7: Problems 2, 4a, 5

Hw6:  Network Flow: Chapter 6: problems 9, 11, 18,

Hw7:  Branch and Bound: Chapter 8: problems 1, 2, 3.

LP Model Sets:           Blending problem, workforce scheduling, aggregate planning, power distribution, Power Distribution.... ….

LP Method Sets:        Simplex Algorithm: Chapter 3: Problems 4, 5, 6, 8, 9, 10

                                    Optimality, Infeasibility and Unbounded: Chapter 3: Problems 12, 13

                                    Two Phase Simplex: Chapter 3: Problems 18 and 19

                                    Understanding Simplex:  Problem 20, 21

IP Problems Sets:      Fixed Charge Model, Capacitated/uncapacitated Facility Location, Traveling Salesman Problem, Directed Minimal Spanning Tree Problem, Cutting Stock, Assembly Line Balancing, Manufacturing with nonlinear objective.

                                    Chapter 7: Problems 2, 4,5,7,11,13,15,17,23

                                    Chapter 8: Problems 1, 2 , 3, 10