the module conversion for a kind of max-min problems is given, namely, the max-min problem with equality and inequality constraint is converted into convex problem with linear constraint, which provides theoretical basis for designing effective algorithms 最后,给出一类极大极小问题的模型转化,把带等式、不等式约束的极大极小问题转化为带线性约束的凸规划问题,这为设计更为有效的算法提供了理论依据。
normally, we try to get the dual form of mathematical programming to change primary programming, which is difficult to be solved into its dual programming, which is easily to be solved . after we had got the dual form of two programming, we found their form were very simply because they had only nonnegative and linear constraints 通常,我们求出规划问题的对偶形式是希望将不易求解的原问题转化为易于求解的对偶问题,在分别得到这两类问题的对偶形式后,发现其形式简单,只带有非负约束和线性约束。