1·Quadratic programming (QP) is an NP complete problem.
二次规划(QP)为NP完全问题。
2·The dual quadratic programming is applied to solving the optimal model of continuum.
利用对偶规划理论对模型进行了求解。
3·In this paper, a quadratic programming algorithm is presented to solve Max-cut problem.
本文给出了最大割问题的二次规划算法。
4·A region decomposition method to solve a positive definite quadratic programming is presented.
给出了一个求解正定二次规划的区域分解方法。
5·In this paper, penalty parameter for linearly constrained 0-1 quadratic programming is improved.
本文改进了带线性约束0 - 1二次规划问题的罚参数下界。
6·Presents a method to solve quadratic programming problems with advantages of quickness and accuracy.
提出一种求解二次规划问题的方法。这种方法可快速、准确地得到问题的解。
7·Lower approximation algorithm and its solve of convex quadratic programming are also given in this article.
混合优化控制算法，给出了求解最优控制器的上逼近算法及其凸二次规划求解方法。
8·The sequential quadratic programming was utilized to avoid the complex calculation in sensitivity analysis.
为了提高计算效率，本文采用序列二次规划法避免了灵敏度分析中的复杂计算。
9·The quadratic programming problem is obtained when the functional is discretized by the finite strip method.
借助有限条法在矩形域上离散这个泛函，得到了一个特殊的二次泛函的规化问题。
10·This paper presents a reactive power optimization model that is based on successive quadratic programming methods.
介绍了一种无功优化模型，并基于连续二次规划的方法。