.png){kind=icon}
Return
A new local and global optimization method for mixed integer quadratic programming problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2010.07.062.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. Crown Copyright (C) 2010 Published by Elsevier Inc. All rights reserved.
Keywords:
Mixed integer quadratic programming problem
Optimization method
Global optimality condition
Auxiliary function
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more