Optimization Methods for Mixed Integer Weakly Concave Programming Problems

被引：1
|
作者：
Wu Z.-Y. [1 ,2 ]
Bai F.-S. [1 ]
Yang Y.-J. [3 ]
Jiang F. [1 ]
机构：
[1] School of Mathematics, Chongqing Normal University, Chongqing
[2] School of Information Technology and Mathematical Sciences, Federation University Australia, Ballarat, VIC
[3] Department of Mathematics, Shanghai University, Shanghai
来源：
Wu, Z.-Y. (zywu@cqnu.edu.cn) | 1600年 / Springer Science and Business Media Deutschland GmbH卷 / 02期
关键词：
Global optimality conditions; Global optimization method; Local optimization method; Mixed integer weakly concave programming problems;
D O I：
10.1007/s40305-014-0046-y
中图分类号：
学科分类号：
摘要：
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. © 2014 Operations Research Society of China, Periodicals Agency of Shanghai University, and Springer-Verlag Berlin Heidelberg.
引用
收藏
页码：195 / 222
页数：27
相关论文
共 50 条
12345