Mathematics 400:   Introduction to Operations Research

Spring 2004 Office Hours:

       Tues/Thurs  9:45-11:45
             Tues  1:15 -3:15
Mon/Weds  2:30 -3:30
        Sunday  4:00 -5:00
(plus appointments)

Objectives: By the end of this course, a successful student will:

  • Understand basic vocabulary and concepts of Operations Research.

  • Achieve a working knowledge and conceptual framework of Linear Programming.

  • Expand the ideas of Linear Programming into related areas of optimization.

  • Use the techniques learned on a major project involving a real world data.

  • Demonstrate a moderate level of proficiency using MS Excel and other software.

Prerequisites:  Matrix/Linear Algebra and Calculus II. Calculus III and Foundations are recommended.

Textbook: Hillier and Liebermann (2005). Introduction to Operations Research, 8th ed. McGraw Hill,
ISBN: 0-07-252744-7

Evaluation: Course grades are determined by combining all of the points for the semester, which come from homework assignments, projects, and exams. A mediocre student should expect a C, although I hope that none of you are mediocre students. I plan to use a straight percentage system, but I'll leave open the possibility of a small curve applied at the end.

Grades will be based on the following 1000-point system:

Type of Grade

Number

Points

Total 

Homework Assignments

6 of 8
2 of 8

40
20

280

Participation     70

Exams

2

200

400

Project / Final

 

 

250

Your four highest homework grades will be added together; the other homework assignments will only count for half of their value. If that sounds confusing, think of it this way: Instead of dropping your lowest grade, you drop half of your lowest couple.

Homework: will be assigned periodically. Homework is due at the beginning of class on the due date (usually a Wednesday). Homework turned in late will receive a penalty of 20% if it is turned in by the next class, 50% if it is up to a week late, and 10% more each week after that; It will also be graded more harshly, giving less benefit of the doubt. Once assigned, homework will be posted on the U: Drive (and maybe on BlackBoard).

Students are invited to meet with each other to talk about their homework problems and other topics in the class. However, I would like you to write up your own solutions, without copying directly from another person's paper. Always explicitly list your homework partners on your homework. We'll try to have a couple group homework meetings, probably Monday evenings.

Exams: Exams are more in-depth than homework, but most of the questions will be similar to homework problems. Several will be more challenging. This course will have two mid-semester exams. The first will an in-class exam on Monday, February 21. The second, a take-home exam, will be due April 20. You will be able to revise and resubmit the take-home exam.

Project/Final: This class has an project, tentatively due April 27. For this project, you (by yourself, or with one other person) will formulate a problem, find a data set, and propose a solution to it. It's pretty open ended, but that isn't always a good thing. You will teach a class on your project at the end of the semester. You may choose to take a comprehensive final given at the assigned time instead of doing the project, but the project will be graded more leniently, since it will take more time than the exam. Choose by April 1.

Participation: It is assumed that everyone will come to class all of the time, read ahead, think about things, and speak in class (sometimes about non-class things). If you are in class most of the time, almost never talk in class, and work on homework by yourself, expect a C in participation. You can get small amounts of extra credit by attending math lectures, the research conference, and occasional other things.

Honor: It is also assumed that everyone will behave in a trustworthy and honest manner throughout this course. I give a great benefit of the doubt as long as possible, but this class has no room for those who won't play fair. If you have a question about the "house rules," ask me. Any cheating, plagiarism, or other trust-breaking will result in failing the course. Period.  

Tentative schedule: (subject to change)

Week

Date

Topics

Text

1*

January 19 and 21

Introduction and Solving Problems

1-2

2

January 24, 26, and 28

Model Formulation and Geometry

3

3

Jan. 31, Feb. 2 and 4

Basic Simplex Method and Degeneracy

4

4

February 7, 9, and 11

Degeneracy and Duality

6

5*

February 14 and 18

Other Stuff and Review

 

6

February 21, 23 and 25

Exam 1, Alternates to Simplex

7

7

Feb 27 and Mar 2 and 4

More theory of LP

 

8

March 7, 9, and 11

More Computer Issues

 

 

Spring Break

Spring Break

 

9

March 21, 23 and 25

Ghost Week

 

10

March 28, 30, and 32

Network Problems

8-9

11

April 4, 6, and 8

Integer Programming

11

12

April 11, 13, and 15

Int. cont.

 

13

April 18, 20, and 22

Exam 2 due

 

14

April 25, 27, and 29

Additional Topics

 

15

May 2, 4, and 6

Presentations

 

 

Thursday, May 12

Final Exam / Project Presentations

9:30-11:20


Ghost Week: My wife and I are planning to have a baby sometime around March 5. I'll be taking a week off around then. So, class will be cancelled whenever it happens (I put it into the schedule as the week after break, but it's not likely to be then). We may have to meet at an outside time, or we might be able to "eat" the missing time.