Journal of the Operations Research Society of China ›› 2014, Vol. 2 ›› Issue (2): 195-222.doi: DOI10.1007/s40305-014-0046-y
• Continuous Optimization • Previous Articles Next Articles
Online:
Published:
Abstract:
In this paper, we consider a class of mixed integer weakly concave programming problems (MIWCPP) consisting of minimizing a difference of a quadratic function and a convex function. A new necessary global optimality conditions for MIWCPP is presented in this paper. A new local optimization method for MIWCPP is designed based on the necessary global optimality conditions, which is different from the traditional local optimization method. A global optimization method is proposed by combining some auxiliary functions and the new local optimization method. Furthermore, numerical examples are also presented to show that the proposed global optimization method for MIWCPP is efficient.
Key words: Global optimality conditions , Local optimization method , Global optimization method , Mixed integer weakly concave programming problems
Zhi-you Wu · Fu-sheng Ba i· Yong-jian Yang · Feng Jiang. Optimization Methods for Mixed Integer Weakly Concave Programming Problems[J]. Journal of the Operations Research Society of China, 2014, 2(2): 195-222.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jorsc.shu.edu.cn/EN/DOI10.1007/s40305-014-0046-y
https://www.jorsc.shu.edu.cn/EN/Y2014/V2/I2/195