Linear Programming Simplex method, dual problems, dual simplex method, duality theorems, complementary slackness, sensitivity analysis and transportation problem. Students taking this course are expected to have knowledge in linear algebra.

• 线性规划单纯形法,对偶问题,对偶单纯形法,对偶性定理,互补松弛性,灵敏度分析及运输问题。学生选修本科须具备线性代数之知识。