67.412/92.474 Operations Research II - Outline
- Office hours:Monday, Wednesday, 2-4pm.
- Course Outline:
I intend to follow this outline fairly closely,
but, if appropriate, I will alter what is included in the course.
- Nonlinear Programming (4 weeks)
- Queueing Theory (3 weeks)
- Markov Chains (2 weeks)
- Dynamic Programming (3 weeks)
- Inventory theory (2 weeks)
Every two weeks.
Homework and exam solutions will be placed on reserve in the
library. You may discuss the homeworks with other students,
but you must write up your solutions on your own.
Three exams during the semester. Each
exam will include at least one question from the homeworks.
You may bring one page of handwritten notes to each exam.
The first exam will cover nonlinear programming,
the second exam will cover queueing theory and Markov chains,
and the third exam will cover dynamic programming and inventory theory.
As you would expect, the exams must be all your own work.
- Grading policy:
25% for each exam, 25% for homeworks.
J. G. Ecker and M. Kupferschmid;
Introduction to Operations Research.
Wiley, 1988. This is on reserve.
The material on Markov chains will be drawn from elsewhere;
I will give you a writeup.
- The World Wide Web:
This outline, the homeworks, and any other relevant information
will be available
- Academic integrity:
Student-teacher relationships are based on mutual trust.
Acts which violate this trust undermine the educational process.
The Rensselaer Handbook defines various forms of academic
dishonesty and procedures for responding to them.
The penalties for cheating can include failure in the course,
as well as harsher punishments.
- Appealing grades:
As with any other administrative question regarding this course,
see me in the first instance. If we are unable to reach agreement,
you may appeal my decision to Professor Holmes.
Back to my homepage