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.
英
美
- 線(xiàn)性規劃單純形法,對偶問(wèn)題,對偶單純形法,對偶性定理,互補松弛性,靈敏度分析及運輸問(wèn)題。學(xué)生選修本科須具備線(xiàn)性代數之知識。
