IE 303 Modeling and Methods in Optimization

Instructor: M. C. Pinar
Room:  EA-305
Office Hours: Tuesdays 2pm-5pm. Other times by appointment (by e-mail) only.
Course Materials:
Topics covered in the course along with some lecture material (from a similar course taught at MIT).
  1.            Network Optimization Models (Chapter 10 of Rardin and lecture note)

  2.            Optimal Trees (Chapter 5 of Cheriyan's notes (in gzipped postscript format))
  3.            Integer Programming: Formulations and Modeling Tricks(lecturenote)
  4.            Branch-and-Bound Method ( notes on B & B:1, notes on B & B:2, notes on dual simplex, lecturenote)
  5.            Cutting Plane Methods in Integer Programming (lecturenote)
  6.            Dynamic Programming (lecturenote1, lecturenote2)
  7.            Heuristic Methods (lecturenote)
  8.            Applications in Telecommunications, Ground and Air Transport, Economics and Finance, Production Planning
  1.             The first homework assignment is here.
  2.             The second homework assignment is here.
  3.             The third homework assignment: Section 9.5 of Rardin explains the shortest path algorithm discussed in class. In the same chapter you are asked to consider problems 9.31 and 9.34, on pages 473-474. For both problems answer part a, and solve the resulting problem instances using the shortest path algorithm explained in class. Show all your calculations. You do not need to program the algorithm. Both questions have equal weights. Due: 16.10.2008, 5 p.m.
  4.             The fourth homework assignment: was distributed in class. Due: 23.10.2008.
  5.             The fifth and sixth hw assignments were distributed in class.
  6.             Some old exams for self-practice are here, and here.
  7.             The midterm exam will be on 18.11.2008, 5:30 pm to 7:30 pm, Rooms: EB101 and EB103.

The grading system may be changed for the entire class or in 
individual cases at the discretion of the instructor.
In particular, class attendance and participation will
be taken into account

Make-up policy: It is recommended that you do not miss any examination.
A make-up will only be offered to those with a medical report duly certified
by the University Health Center. The make-up will be given with or after the final
exam and will cover the entire course material.

 Homeworks    20 %
Quizzes  no quiz this year!
Midterm TBA
Final 50%




  • Your success in the course depends greatly on you doing the
    assigned homework assignments regularly to assimilate the material
    covered in the classes.
  • The homework assignments may sometimes be listed on my web page. You need
    to go to my home page, and then to the course web page to see the current

  • Please make sure that you finish the homework on time and that
    you bring any difficulties to my attention. These will be dealt
    with promptly in class or sometimes during the office hours.
  • Late homework assignments are not acceptable, except under
    exceptional circumstances.


  • It is very important that you come to each class
    having read the material to be covered that day
    . (You will
    need to read this material at some point anyway!) Reading it
    in advance will help you to understand the lecture better.
    It also gives you a chance to ask questions about the parts
    you did not understand fully.
  • Please come and ask questions during anytime, but especially during
    the office hours. This is the time I am available exclusively to
    answer your questions.


Cheating has serious consequences. The university policy on
plagiarism will be fully applied if anyone is caught cheating on
the homework or examinations. For individual assignments, the students are
required to work on their own.