对偶线性规划问题性质探析

探讨对偶线性规划的原始问题与对偶问题的属性，阐述两者的区别和内在联系，用较简便的方法论证其重要性质，揭示可行解与目标函数、可行解与最优解的关系，指出线性规划问题最优解从约束条件较少的对偶问题寻求为另一较简便之方法。

Probing and Analysis of the Property of Dual Linear Programming Problem

In this paper it is inquired into the original problems of dual linear programming problem and the attribute of dual problem and the distinctions and the internal relations between both, it is demonstrated its important property by a simple and convenient methods. The relations between feasible solution and objective function, feasible solution and optimal solution is revealed. Optimal solution of linear problem from dual problem with the few restricted conditions is pointed out.