An efficient branch and bound reduction algorithm for globally solving linear fractional programming problems

Bingdi Huang and Peiping Shen

Chaos, Solitons & Fractals, 2024, vol. 182, issue C

Abstract: This paper investigates a class of linear fractional programs (LFP) with linear constraints, which are widely applied in transportation, economic investment and so on. We start with transforming LFP into its equivalent two-layer problem. Subsequently, we introduce a novel linear relaxation approach and integrate it within the branch and bound framework, and a new global optimization algorithm is presented in cooperation with a region deleting rule. Additionally, we discuss the convergence and complexity of this algorithm. Preliminary numerical results validate the practicality and effectiveness of our proposed method.

Keywords: linear fractional program; Global optimization; Branch and bound; Linear relaxation technique (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077924003096
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:182:y:2024:i:c:s0960077924003096

DOI: 10.1016/j.chaos.2024.114757

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. ().