| 1. | Dual problem and sensitivity analysis of linear programming
线性规划对偶问题及其灵敏度分析 |
| 2. | Problem a and problem b are dual
问题a和问题b是对偶问题。 |
| 3. | Constraint qualifications and dual problems for quasi - differentiable programming
拟可微规划的约束规范和对偶问题 |
| 4. | Discussion on the conversion methods of problem and dual problem in linear programming
线性规划中原问题与对偶问题转化方法探讨 |
| 5. | Simple and convenient implementation of solution and sensitivity analysis of linear programming and dual problem with excel
上轻松实现线性规划及其对偶问题的求解以及灵敏度分析 |
| 6. | In this method , we get the optimal value of semidefinite programming by finding the optimal descent direction of its dual problem
该方法根据次微分理论与半定规划的强对偶定理，通过求解对偶问题得到原始问题的最优值。 |
| 7. | Therefore , our study is very important on the theoretical and practical aspects of svms . the main works in this paper are as follows : 1
在作为支持向量机基础的原始问题解和对偶问题解的关系上，当时研究存在逻辑缺陷。 |
| 8. | In chapter six we consider the dual problem , develop several computational procedures based on duality , and discuss sensitivity and parametric analysis
在第六章中，我们考虑对偶问题，基于对偶建立几个计算程序，并讨论了参数和灵敏度分析。 |
| 9. | Dual mathematical programming is used to map the original problem exactly and the second approximation of the dual problem is set up by taylor ' s expand form , it is solved by qp ( quadratic programming ) solving device
用对偶数学规划精确映射原问题，用泰勒展式建立对偶问题的二阶近似。最后用二次规划求解器求解。 |
| 10. | The aim of this paper is to study the applications of grobner bases in finding the minimal polynomial of a given matrix and its inverse if it is nonsingular and to discuss selfdualities over a polynomial ring
) bner基理论在求矩阵极小多项式，判定矩阵可逆性和求逆矩阵等方面的应用，并讨论了多项式环的分次自对偶问题。 |
