simplex method

基本解释

In order to optimize the parameters of the network, we propose the General Simplex Method, which converges more quickly than the Simplex Method.
为了对网络参数进行优化，本文提出了一种一般单纯形算法，这种方法比单纯形法收敛速度要快。
Multiple optimal solutions to the linear programming problem by the simplex method for specific feasible regions sometimes might lead to a loss of efficiency.
用单纯形法求解线性规划问题的多最优解，对一类特殊的可行域，有时会导致失效。
In the simplex method of linear programming, there is a big M method(the penalty factor method) for finding an initial feasible basis.
在线性规划的单纯形法中，为求初始的可行基有著名的大M法，即惩罚因子法。