| 1. | Sperner's lemma concerns the decomposition of a simplex into smaller simplices .
斯波纳引理涉及到把一个单纯形分解为较小的单纯形的问题。 |
| 2. | Improved dual simplex method for linear programming
线性规划一种改进的对偶单纯形法 |
| 3. | On the simplex algorithm with largest improvement rule
关于使用最大改进规则的单纯形算法 |
| 4. | Solving loader problem by using simplex algorithm
单纯形法解装卸工问题 |
| 5. | An annotation for improved simplex method of linear program
线性规划改进单纯形法的一个注记 |
| 6. | Improvement on the dual simplex method about linear programming
线性规划对偶单纯形算法的改进 |
| 7. | Classical simplex methods for linear programming and their develppments
线性规划的单纯形法及其发展 |
| 8. | Dual simplex method of linear programming with bounded variables
变量有上界的线性规划的对偶单纯形方法 |
| 9. | Three model parameters were estimated by using the simplex method
采用单纯形法对3个模型参数进行了估计。 |
| 10. | Computer resolving method of simplex algorithms in linear programming
线性规划问题中单纯形法的计算机求解 |
