Outer space branching search method for solving generalized affine fractional optimization problem-Reference-Cited by-同舟云学术

Outer space branching search method for solving generalized affine fractional optimization problem

Published:2023 Issue:1 Volume:8 Page:1959-1974
ISSN:2473-6988
Container-title:AIMS Mathematics
language:
Short-container-title:MATH

Author:

Ma Junqiao¹,Jiao Hongwei¹²,Yin Jingben¹,Shang Youlin²

Affiliation:

1. School of Mathematical Sciences, Henan Institute of Science and Technology, Xinxiang 453003, China

2. Postdoctoral Research Station of Control Science and Engineering, Henan University of Science and Technology, Luoyang 471023, China

Abstract

<abstract><p>This paper proposes an outer space branching search method, which is used to globally solve the generalized affine fractional optimization problem (GAFOP). First, we will convert the GAFOP into an equivalent problem (EP). Next, we structure the linear relaxation problem (LRP) of the EP by using the linearization technique. By subsequently partitioning the initial outer space rectangle and successively solving a series of LRPs, the proposed algorithm globally converges to the optimum solution of the GAFOP. Finally, comparisons of numerical results are reported to show the superiority and the effectiveness of the presented algorithm.</p></abstract>

Publisher

American Institute of Mathematical Sciences (AIMS)

Subject

General Mathematics

Reference40 articles.

1. C. D. Maranas, I. P. Androulakis, C. A. Floudas, A. J. Bergerb, J. M. Mulvey, Solving long-term financial planning problems via global optimization, J. Econ. Dyn. Contr., 21 (1997), 1405–1425. https://doi.org/10.1016/S0165-1889(97)00032-8

2. H. W. Jiao, J. Q. Ma, P. P. Shen, Y. J. Qiu, Effective algorithm and computational complexity for solving sum of linear ratios problem, J. Ind. Manag. Optim., 2022. http://dx.doi.org/10.3934/jimo.2022135

3. H. W. Jiao, S. Y. Liu, An efficient algorithm for quadratic Sum-of-Ratios fractional programs problem, Numer. Func. Anal. Opt., 38 (2017), 1426–1445. https://doi.org/10.1080/01630563.2017.1327869

4. J. E. Falk, S. W. Palocsay, Optimizing the sum of linear fractional functions, recent advances in global optimization, New Jersey: Princeton University Press, 1992.

5. H. W. Jiao, J. Q. Ma, An efficient algorithm and complexity result for solving the sum of general ratios problem, Chaos Soliton. Fract., 164 (2022), 112701. https://doi.org/10.1016/j.chaos.2022.112701

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Novel Affine Relaxation-Based Algorithm for Minimax Affine Fractional Program;Asia-Pacific Journal of Operational Research;2023-11-28

2. An accelerating outer space algorithm for globally solving generalized linear multiplicative problems;Numerical Algorithms;2023-04-20

3. Set-valued fractional programming problems with $ \sigma $-arcwisely connectivity;AIMS Mathematics;2023

4. A novel algorithm for solving sum of several affine fractional functions;AIMS Mathematics;2023