Output-space branch-and-bound reduction algorithm for generalized linear fractional-multiplicative programming problem

YueLin Gao and Bo Zhang

Chaos, Solitons & Fractals, 2023, vol. 175, issue P1

Abstract: In this paper, we investigate a class of linear fractional-multiplicative programs with exponents, which have important applications in finance and economy. By introducing p variables, the problem is re-represented as an equivalent problem. Immediately, two new linear relaxation strategies are proposed and embedded in the branch-and-bound framework, and the corresponding new global optimization algorithms are developed in combination with an acceleration technique. Furthermore, the theoretical convergence and computational complexity of the algorithms are elucidated. Numerical experiment results illustrate that both algorithms are effective and feasible.

Keywords: Global optimization; Linear fractional-multiplicative program; Branch-and-bound; Acceleration technique (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077923008251
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:175:y:2023:i:p1:s0960077923008251

DOI: 10.1016/j.chaos.2023.113924

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().