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] Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem
    Agarwal, Deepika
    Singh, Pitam
    Bhati, Deepak
    Kumari, Saru
    Obaidat, Mohammad S.
    SOFT COMPUTING, 2019, 23 (01) : 197 - 210
  • [33] 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
  • [34] A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
    Benson, Harold P.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 182 (02) : 597 - 611
  • [35] A Parallel Branch and Bound Algorithm for Solving Large Scale Integer Programming Problems
    Ismail, Mahmoud M.
    Abd el-Raoof, Osama
    Abd El-Wahed, Waiel F.
    APPLIED MATHEMATICS & INFORMATION SCIENCES, 2014, 8 (04): : 1691 - 1698
  • [36] A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
    Jiao, Hongwei
    Li, Binbin
    Yang, Wenqiang
    JOURNAL OF GLOBAL OPTIMIZATION, 2024, 89 (03) : 597 - 632
  • [37] A hybrid tabu search/branch & bound approach to solving the generalized assignment problem
    Woodcock, Andrew J.
    Wilson, John M.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 207 (02) : 566 - 578
  • [38] An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem
    Zhang, Bo
    Gao, Yuelin
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2023, 40 (02)
  • [39] Duality-based branch–bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem
    Deepika Agarwal
    Pitam Singh
    Deepak Bhati
    Saru Kumari
    Mohammad S. Obaidat
    Soft Computing, 2019, 23 : 197 - 210
  • [40] A branch and bound algorithm for solving the 2D strip packing problem
    Bekrar, Abdelghani
    Kacem, Imed
    Chu, Chengbin
    Sadfi, Cherif
    2006 INTERNATIONAL CONFERENCE ON SERVICE SYSTEMS AND SERVICE MANAGEMENT, VOLS 1 AND 2, PROCEEDINGS, 2006, : 940 - 946
12345