论文部分内容阅读
本文根据文献[1]、[2]、[3]所提出的鞍点逼近算法,提出两种新型算法。这两种算法有如下重要意义。①将计算鞍点问题转化为求二次极值问题;②用新方法计算鞍点可以在有限步达到最优解;③用新方法求解线性规划问题具有多项式算法性质;④引出差梯度的新概念。
In this paper, two new algorithms are proposed based on the saddle point approximation algorithm proposed in [1], [2] and [3]. These two algorithms have the following significance. (1) the saddle point problem is transformed into the quadratic extreme value problem; (2) the saddle point can be solved in a finite way with the new method; (3) the new method is used to solve the linear programming problem with polynomial nature;