二次规划的分解问题

二次规划在规划论研究中起着重要的作用。能够对更多更广的一类二次规划给出一个可行的算法是人们长期一直探求的工作。本文在很一般的假设下证明了一个二次规划总可以使之成为凸的超平面上进行分解,并且分解后的每个子规划也是二次的。

Problem of Decomposition of Quadratic Programming

This paper theoretical1y solves the problem of decomposition of the general quadratic programming and proves that the programming after decomposition is also locally quadratic. Section 1 consists of the general problem of decomposition and the main result. Section 2 is a preliminary and section 3 presents a prove for the main result.