对偶关系的进一步思考

A Rule of Dual Relation between Original Problem and Dual Problem

每个线性规划问题总有一个与它对应的对偶线性规划问题。基于对偶关系表,可以由原问题得出对偶问题,但由于变量、约束的复杂关系而使对应关系容易出错。为此,论文总结了"大约变,小约不变,变化仅一次,等号与无约束关联"的口诀,使得能准确无误地写出对偶问题。

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.