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 条
  • [1] Fuzzy Programming for Mixed-Integer Optimization Problems
    Lin, Yung-Chin
    Lin, Yung-Chien
    Su, Kuo-Lan
    Lin, Wei-Cheng
    Chen, Tsing-Hua
    PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL SYMPOSIUM ON ARTIFICIAL LIFE AND ROBOTICS (AROB 16TH '11), 2011, : 261 - 264
  • [2] Fuzzy programming for mixed-integer optimization problems
    Lin Y.-C.
    Lin Y.-C.
    Su K.-L.
    Lin W.-C.
    Chen T.-H.
    Artificial Life and Robotics, 2011, 16 (2) : 174 - 177
  • [3] RELAXATION METHODS FOR PURE AND MIXED INTEGER PROGRAMMING PROBLEMS
    GORRY, GA
    SHAPIRO, JF
    WOLSEY, LA
    MANAGEMENT SCIENCE SERIES A-THEORY, 1972, 18 (05): : 229 - 239
  • [4] INTEGER PROGRAMMING METHODS IN AMBIGUITY FUNCTION OPTIMIZATION PROBLEMS
    ABRAMOVICH, YI
    DANILOV, BG
    MELESHKEVICH, AN
    RADIOTEKHNIKA I ELEKTRONIKA, 1977, 22 (05): : 951 - 956
  • [5] Global optimization of mixed-integer bilevel programming problems
    Gumus, Zeynep H.
    Floudas, Christodoulos A.
    COMPUTATIONAL MANAGEMENT SCIENCE, 2005, 2 (03) : 181 - 212
  • [6] A method for mixed integer programming problems by Particle Swarm Optimization
    Kitayama, Satoshi
    Yasuda, Keiichiro
    ELECTRICAL ENGINEERING IN JAPAN, 2006, 157 (02) : 40 - 49
  • [7] A method for mixed integer programming problems by particle swarm optimization
    Kitayama, Satoshi
    Yasuda, Keiichiro
    Electrical Engineering in Japan (English translation of Denki Gakkai Ronbunshi), 2006, 157 (02): : 40 - 49
  • [8] Branch and cut methods for mixed integer linear programming problems
    Caccetta, L
    PROGRESS IN OPTIMIZATION: CONTRIBUTIONS FROM AUSTRALASIA, 2000, 39 : 21 - 44
  • [9] A Mixed Integer Linear Programming Approach to Electrical Stimulation Optimization Problems
    Abouelseoud, Gehan
    Abouelseoud, Yasmine
    Shoukry, Amin
    Ismail, Nour
    Mekky, Jaidaa
    IEEE TRANSACTIONS ON NEURAL SYSTEMS AND REHABILITATION ENGINEERING, 2018, 26 (02) : 527 - 537
  • [10] EQUIVALENT MIXED INTEGER PROGRAMMING PROBLEMS
    BRADLEY, GH
    OPERATIONS RESEARCH, 1973, 21 (01) : 323 - 326
12345