A BRANCH AND BOUND ALGORITHM FOR SOLVING THE SUM OF GENERALIZED POLYNOMIAL FRACTIONAL PROGRAMMING PROBLEM

被引：0
|
作者：
Liu, Xia [1 ]
Ma, Xiao-Hua [1 ]
Jing, Xia [1 ]
机构：
[1] North Minzu Univ, Ningxia Collaborat Innovat Ctr Sci Comp & Intellig, Yinchuan 750021, Peoples R China
来源：
JOURNAL OF NONLINEAR AND CONVEX ANALYSIS | 2024年 / 25卷 / 03期
关键词：
Generalized polynomial fractional programming; global optimization; branch and bound; linearized relaxation; GLOBAL OPTIMIZATION ALGORITHM; RATIOS;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
This paper aims at the generalized polynomial fractional programming problem (GPFP)'s global optimal solution. By utilizing the exponential convex -concave envelopes to relax the original problem into linear fractional programming problem (LRP1), then adding auxiliary variables for each linear fraction and exploiting the bilinear convex -concave envelopes to construct a linear programming relaxation (LRP). Then the algorithm (YBBA) is proposed and proved to be convergent. Finally, the algorithms effectiveness is verified by numerical experiments.
引用
收藏
页码：601 / 613
页数：13
相关论文
共 50 条
  • [31] A novel branch and bound algorithm for solving the linear multiplicative programming problems
    Dai, Jinyu
    OPTIMIZATION, 2024,
  • [32] A branch and bound algorithm for globally solving a class of nonconvex programming problems
    Jiao, Hongwei
    NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 2009, 70 (02) : 1113 - 1123
  • [33] A branch and bound algorithm for solving a class of D-C programming
    Xue, HG
    Xu, CX
    APPLIED MATHEMATICS AND COMPUTATION, 2005, 165 (02) : 291 - 302
  • [34] A Global Optimization Algorithm for Solving Generalized Linear Fractional Programming
    Zhang, Yonghong
    Li, Zhaolong
    Liu, Lixia
    ENGINEERING LETTERS, 2020, 28 (02) : 352 - 358
  • [35] The Lower Bound on Complexity of Parallel Branch-And-Bound Algorithm for Subset Sum Problem
    Kolpakov, Roman
    Posypkin, Mikhail
    NUMERICAL COMPUTATIONS: THEORY AND ALGORITHMS (NUMTA-2016), 2016, 1776
  • [36] Output-space branch-and-bound reduction algorithm for solving generalized linear multiplicative programming programs
    Ma, Suxia
    Gao, Yuelin
    Zhang, Bo
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2024, : 5917 - 5947
  • [37] Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
    Jiao, Hong-Wei
    Liu, San-Yang
    Zhao, Ying-Feng
    APPLIED MATHEMATICAL MODELLING, 2015, 39 (23-24) : 7568 - 7582
  • [38] Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
    Jiao, Hong-Wei
    Liu, San-Yang
    Zhao, Ying-Feng
    Applied Mathematical Modelling, 2014, 39 (23-24) : 7568 - 7582
  • [39] One algorithm for branch and bound method for solving concave optimization problem
    Andrianova, A. A.
    Korepanova, A. A.
    Halilova, I. F.
    11TH INTERNATIONAL CONFERENCE ON MESH METHODS FOR BOUNDRY-VALUE PROBLEMS AND APPLICATIONS, 2016, 158
  • [40] A novel branch-and-bound algorithm for solving linear multiplicative programming problems
    Hu, Peng
    Gu, Hengyang
    Wang, Bowen
    OPTIMAL CONTROL APPLICATIONS & METHODS, 2024, 45 (06): : 2636 - 2650
12345