科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper we provide a complete analytic solution to a particular separable convex quadratic programming problem with bound and equality constraints. This study constitutes the generalization of prior papers in which additional simplifications were considered. We present an algorithm that leads to determination of the analytic optimal solution. We demonstrate that our algorithm is able to deal with large-scale QP problems of this type. Finally, we present an very important application: the classical problem of economic dispatch.
- 出版日期2010-9
