摘要
每个线性规划问题总有一个与它对应的对偶线性规划问题。基于对偶关系表,可以由原问题得出对偶问题,但由于变量、约束的复杂关系而使对应关系容易出错。为此,论文总结了"大约变,小约不变,变化仅一次,等号与无约束关联"的口诀,使得能准确无误地写出对偶问题。
There is always a dual linear programming problem corresponding to each linear programming problem.But it is very easy to get wrong dual problem because of the complicated relationship between variables and constraints.This paper proposes a rule that can help people to get the dual problem easily and correctly. The rule is,maximize-constraint-change, minimize-constraint-same, change is only one time, equal is associated with unconstrained.
引文
[1]胡运权.运筹学基础及应用[M].哈尔滨工业大学出版社,2009.
[2]熊伟.运筹学[M].北京:机械工业出版社,2011.