| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4632669 | Applied Mathematics and Computation | 2010 | 12 Pages |
Abstract
In this paper, a new local optimization method for mixed integer quadratic programming problems with box constraints is presented by using its necessary global optimality conditions. Then a new global optimization method by combining its sufficient global optimality conditions and an auxiliary function is proposed. Some numerical examples are also presented to show that the proposed optimization methods for mixed integer quadratic programming problems with box constraints are very efficient and stable.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
G.Q. Li, Z.Y. Wu, J. Quan,