IE 310 - Operations Research

Fall Quarter 2000-2001

Textbook:                              'Operations Research, An Introduction' by Hamdy A. Taha, Prentice Hall.

Coordinator:                         A. Erçil, Professor of I.E..

Office Hours:                       Th 10-12, F 11-12

Assistant:                              Atalay Atasu

Schedule:                               M 9-11, Th  9-10    P.S.  T 15-17

Goals:    This purpose of this course is to familiarize 3rd year Computer Engineering students with techniques of Operations Research. This is a pragmatic view of Operations Research aimed at extending students' tool boxes. At the end of this course you are expected to:

formulate real world decision making situations as mathematical optimization problems,

solve linear programming problems,

be able to understand what that solution means,

solve transportation and various other network problems,

understand basic concepts and algorithms of integer programming

Prerequisites

Linear Algebra,

Homeworks:

Weekly assigments will be given on Monday. The solutions will be due 7 days after assigned, and can be turned in at lecture or to the teaching assistant by 4:00 on Monday.

Grading:

Grading of the course will be as follows:

Midterm                 30%

Quizzes                  30%

Final                       40%

There will be pop quizes (roughly every other week) which will amount to 30% of your overall grade. A midterm (30%) and a final examination (40%) make up the rest of your grade. 

Topics to be covered:

Methodology & Modeling

Linear Programming        

The Simplex Method                 

Duality                                                  

Sensitivity Analysis                               

Transportation Problems                               

Network Models                                 

Integer Programming

Dynamic Programming