计算机问题求解-论题3-15 线性规划 2014年12月22日
计算机问题求解 – 论题3-15 - 线性规划 2014 年12 月22 日
自学检查 When converting one linear program L into another linear program L',we would like the property that an optimal solution to L'yields an optimal solution to L.To capture this idea,we say that two maximization linear programs L and L'are eguivalent if for each feasible solution to L with objective value there is a corresponding feasible solution to L'with objective value and for each feasible solution 'to L'with objective value there is a corresponding feasible solution to L with objective value (This definition does not imply a one-to-
自学检查
maximize X1 + X2 subject to 问题1： 4X1 X2 S 8 2x1 + X2 ≤ 10 你能否利用左边 5x1 2X2 ≥ -2 X1,X2 ≥ 0 的式子和图解释 X2 ：目标函数、约 7 2X2 5x 束条件、可行解 X 、目标值、目标 R 3≤8 + 值的可行解、线 =4 性规划问题的解 2≥0 +2 0 线性规划？
问题2 policy urban suburban rural 如何趣邻下列语句 build roads -2 5 3 gun control 8 2 -5 Although we cannot easily graph farm subsidies 0 0 10 linear programs with more than two gasoline tax 10 0 -2 variables,the same intuition holds.If we have three variables,then each constraint corresponds to a half- space in three-dimensional space. The intersection of these half-spaces forms the feasible region. minimize X1 + X2 + X3 + X4 subject to -2x1 8x2 + 0x3 + 10x4 2 50 5x1 2x2 + 0x3 + 0x4 ≥ 100 3x1 5x2 + 10x3 2x4 ≥ 25 X1,X2,X3,X4 ≥ 0
Although we cannot easily graph linear programs with more than two variables, the same intuition holds. If we have three variables, then each constraint corresponds to a halfspace in three-dimensional space. The intersection of these half-spaces forms the feasible region
问题3： 线性规划问题中的不等 式能不能用严格的大于 或小于？