MATH3220 MATH3220 Operations Research and Logistics (2011-2012)

Lecture Hours and Venues: Tuesdays 10:35am-12:15pm (with 5-minute break) and Thursdays 12:35pm-1:15pm both at LT4, LSB

Lecturer Office Hours: Every Thursday 11:30am-12:15pm, but please send me an email (rchan@math.cuhk.edu.hk) or call me first (3943-7970), if possible.

About the Lecturer: Raymond Chan

About the Tutors: Guojian Yin, Haixia Liu, Office: Rm 101, LSB, Tel: 3943-8608, Email: gjyin, hxliu@math.cuhk.edu.hk.

Tutorial Hours and Venues: H3 and H5 at MMW710.


Course Objective: Dynamic programming, equipment replacement problem, resource allocation problem, knapsack problem; network flow problems, shortest path problem; integer programming; queueing theory and birth-and-death processes; data envelopment analysis; decision analysis

Prerequisite: Students taking this course are expected to have knowledge in linear programming, in particular, the theory of Simplex Method.


Textbooks:


Lecture Notes:

Link to the Lecture notes, assignments etc.


Tentative Teaching schedule:


Assessment Scheme:


Important Remarks: