LinearProgramming(LP)(Chap29)课程.pptVIP

* Linear Programming (LP) (Chap.29) Suppose all the numbers below are real numbers. Given a linear function (called objective function) f(x1, x2,…, xn)=c1x1+ c2x2+…+ cnxn=?j=1n cjxj. With constraints: ?j=1n aijxj ?bi for i=1,2,…,m and xj?0 for j=1,2,…,n. (nonnegativity) Question: find values for x1, x2,…, xn, which maximize f(x1, x2,…, xn). Or if change ?bi to ?bi , then minimize f(x1, x2,…, xn). * LP examples Political election problem: Certain issues: building roads, gun control, farm subsidies, and gasoline tax. Advertisement on different issues Win the votes on different areas: ur