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 条
  • [41] Parallel implementation of branch and bound algorithm for solving vehicle routing problem on NOWs
    Lau, KK
    Kumar, MJ
    Achuthan, NR
    THIRD INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS, AND NETWORKS, PROCEEDINGS (I-SPAN '97), 1997, : 247 - 253
  • [42] 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
  • [43] Solving the Time Dependent Chinese Postman Problem by Branch-and-Bound Algorithm
    Tan, Guozhen
    Sun, Jinghao
    Meng, Yakun
    INFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL, 2012, 15 (12A): : 5263 - 5270
  • [44] Branch and Bound Algorithm for the Warehouse Location Problem with the Objective Function as Linear Fractional
    Sudha Arora
    S. R. Arora
    OPSEARCH, 2006, 43 (1) : 18 - 30
  • [45] An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications
    Hou, Zhisong
    Liu, Sanyang
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2024, 451
  • [46] A new branch and bound method for solving linear multiplicative programming problems
    Huang, Bingdi
    Shen, Peiping
    OPTIMIZATION, 2024,
  • [47] An Efficient Algorithm for Quadratic Sum-of-Ratios Fractional Programs Problem
    Jiao, Hongwei
    Liu, Sanyang
    NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION, 2017, 38 (11) : 1426 - 1445
  • [48] An Efficient Algorithm for Solving a Class of Fractional Programming Problems
    Qiu, Yongjian
    Zhu, Yuming
    Yin, Jingben
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2021, 2021
  • [49] A branch and bound algorithm for quantified quadratic programming
    F. Domes
    A. Goldsztejn
    Journal of Global Optimization, 2017, 68 : 1 - 22
  • [50] A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming
    Shen, Peiping
    Deng, Yaping
    Wang, Yafei
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2024, 448
12345