Course Description

This course serves as an introduction to the field of operations research.  The course will cover basic deterministic methods of operations research (linear programming, network flows, and nonlinear programming) and their applications to resource allocation problems in business and industrial organizations.  

 

Time and Room

T TH 1:00 - 2:15

DH 1064

Instructor

Illya V. Hicks

Office:  Duncan Hall 3020

Phone: x5667

Office Hours:  1:30-2:30pm M & W or by appointment

email:  ivhicks AT rice.edu

Textbook

Winston, W. and M. Venkataramananan, Introduction to Mathematical Programming, Duxbury Press, Belmont, CA, 2003.

 

Grading Policy

    Tests      (3)                                                40%

    Biweekly Quizzes  (6)                                40%

    Final Project                                               20%

 

Groups  

The students will divide into groups of 2 or 3 for group presentations and group quizzes.

 

Homework Policy

Homework will not be turned in, but it is the student’s responsibility to learn from the problem exercises given in the book for the quizzes and tests.

 

 

Course Outline

Linear Programming (Chap. 3)

Simplex Method(Chap. 4 & 10.1)

Duality and Sensitivity Analysis (Chap. 6)

Transportation and Assignment Problems (Chap. 7)

Network Optimization (Chap 8 & 13.2)

Game Theory (Chap. 11)

Nonlinear Programming (Chap. 12)

Integer Programming (Chap. 9)

 

Americans with Disabilities Act Statement

Any student with a documented disability seeking academic adjustments or accommodations is requested to speak with me during the first two weeks of class.  All discussions will remain as confidential as possible.  Students with disabilities will need to also contact Disability Support Services in the Ley Student Center.

Groups for Fall 2009:

Group 1: 

Group 2: 

Group 3:

Group 4: 

Group 5: