Syllabus
Rutgers University
College of Engineering
Department of Industrial Engineering
540:510 Det. Models in IE
Instructor: Dr. M. B. Gürsoy
Office: CoRE 218
Phone: X-5465
Email: gursoy@soe.rutgers.edu
COURSE OUTLINE
 
Topics to be covered:
    1. Modeling and Geometric Solution of LP Problems (Ch.1)
    2. Review of Linear Algebra (Ch.2)
    3. Simplex Method (Ch.3)
    4. Starting Solutions (Ch.4)
    5. Revised Simplex, Farkas’ Lemma, Karush-Kuhn-Tucker Conditions (Ch.5)
    6. Duality and Sensitivity Analysis (Ch.6)
    7. Decomposition Principle (Ch.7)
    8. Transportation and Assignment Problems (Ch.10)
    9. Networks: Minimal Cost Network Flows (Ch.9)
    10. Networks: The Out-of-Kilter Algorithm (Ch.11)
    11. Networks: Maximum Flow, Shortest Path, Multicommodity Flow (Ch.12)
Text:

"Linear Programming and Network Flows", Bazaraa, Jarvis and Sherali, Wiley, 2005, 3rd Ed.
References:

"Introduction to Operations Research", Hillier and Lieberman, McGraw Hill, 1995, 6th Ed.

"Operations Research An Introduction", Taha, Prentice Hall, 1997, 6th Ed.
Grading:

Homework 20%, Project 10%, Midterm Exam 30%, Final 40%.
※ All exams are closed book closed notes, no electronic or hard copy cheat sheets are allowed. Please go over the Rutgers Academic Integrity Policy.