对偶问题转化的教学研究

Research on the conversion of dual problem in linear programming

原问题与对偶问题转化是线性规划的一个重点,也是一个难点问题,在现有的文献中,解决此类问题大多是机械的记忆其对应关系,在实际应用中,这种方法既费时又费力。将研究一种新的对应关系,所得结果能更快更精确的写出对偶问题。

With respect to the conversion of dual problem which is always a difficuh part in teaching process, in this paper by discussion, we obtain some results,which are moe easily to be solved the conversion of dual problem than those of previous known criteria.. Moreover our results generalize and improve many existing ones.