对于大规模的具有伪凸目标函数的二次规划问题，本文提出一种分解算法。
This paper proposes a decomposition algorithm for large scale quadratic programming with a pseudoconvex objective function.
该模型通过引入权系数，使多目标问题转化为一个二次目标、线性约束的二次规划问题。
The weight coefficient was introduced into the model, and the multi-objective problem was changed into a quadratic-programming problem.
本文改进了带线性约束0 - 1二次规划问题的罚参数下界。
In this paper, penalty parameter for linearly constrained 0-1 quadratic programming is improved.
应用推荐