MATH3210 Linear Programming, 2013-2014


General Information


Ronald Lok Ming Lui
Office: LSB 207    Tel: 3943-7975    Email:

Teaching Assistant

Choi Chi Po
Office: LSB 222B    Tel: 3943-7963    Email:
Li Yin (Grader)
Office: Room 505 AB1    Tel: 3943-4298    Email:

Time and Venue

Lecture: Tue 2:30PM - 4:15PM, LSB LT6; Fri 10:30AM - 11:15AM, LSK LT4
Tutorial: Fri 1:30PM - 2:15PM, LSB LT6

Course Description

Linear programming (LP, or linear optimization) is a mathematical method to study the maximum profit or minimum cost in a given mathematical model under some constraints. More specifically, linear programming is a technique to optimize a linear objective function, subject to some linear equality/inequality constraints. In this course, various methods and problems in LP will be studied. These include: Simplex method, dual problems, dual simplex method, duality theorems, complementary slackness, sensitivity analysis, interior point method and transportation problem.



Lecture Notes

Tutorial Notes



Assessment Scheme

Homework 10%
Midterm (October 15 in class 2:30PM - 4:15PM) 35%
Final 55%

Honesty in Academic Work

The Chinese University of Hong Kong places very high importance on honesty in academic work submitted by students, and adopts a policy of zero tolerance on cheating and plagiarism. Any related offence will lead to disciplinary action including termination of studies at the University. Although cases of cheating or plagiarism are rare at the University, everyone should make himself / herself familiar with the content of the following website:

and thereby help avoid any practice that would not be acceptable.

Last updated: December 09, 2013 20:52:30