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 条

[21] IMAGE SPACE BRANCH-REDUCTION-BOUND ALGORITHM FOR GLOBALLY SOLVING THE SUM OF AFFINE RATIOS PROBLEM
Jiao, Hongwei
Shang, Youlin
JOURNAL OF COMPUTATIONAL MATHEMATICS, 2025, 43 (01): : 203 - 228
[22] BRANCH-REDUCTION-BOUND ALGORITHM FOR LINEAR SUM-OF-RATIOS FRACTIONAL PROGRAMS
Shen, Pei-Ping
Li, Wei-Min
Liang, Yan-Chao
PACIFIC JOURNAL OF OPTIMIZATION, 2015, 11 (01): : 79 - 99
[23] Branch-and-Bound Outer Approximation Algorithm for Sum-of-Ratios Fractional Programs
Benson, H. P.
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2010, 146 (01) : 1 - 18
[24] Branch-and-Bound Outer Approximation Algorithm for Sum-of-Ratios Fractional Programs
H. P. Benson
Journal of Optimization Theory and Applications, 2010, 146 : 1 - 18
[25] Branch-reduction-bound algorithm for generalized geometric programming
Peiping Shen
Xiaoai Li
Journal of Global Optimization, 2013, 56 : 1123 - 1142
[26] A Self-Adjustable Branch-and-Bound Algorithm for Solving Linear Multiplicative Programming
Zhang, Yanzhen
BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2024, 47 (05)
[27] A novel branch and bound algorithm for solving the linear multiplicative programming problems
Dai, Jinyu
OPTIMIZATION, 2024,
[28] Global optimization for the sum of generalized polynomial fractional functions
Shen Pei-Ping
Yuan Gui-Xia
Mathematical Methods of Operations Research, 2007, 65 : 445 - 459
[29] Global optimization for the sum of generalized polynomial fractional functions
Shen Pei-Ping
Yuan Gui-Xia
MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2007, 65 (03) : 445 - 459
[30] A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
Shen, Pei-Piny
Duan, Yun-Peno
Pei, Yong-Gang
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2009, 223 (01) : 145 - 158

← 1 2 3 4 5 →