IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v247y2026icp210-224.html

A refined branch and bound algorithm for solving the sum of linear ratios programming

Author

Listed:
  • Yue, Hongwei
  • Li, Hou
  • Shen, Peiping
  • Deng, Yaping

Abstract

A refined branch and bound algorithm is introduced to efficiently solve the sum of linear ratios (SLR) programming. Initially, an equivalent problem of (SLR) is established through a two-stage transformation process, and then this equivalent problem is relaxed into a linear programming problem. Subsequently, under the criterion of minimal integral area, we characterize the relaxation gaps of the two components in the relaxation problem, and determine the corresponding optimal branching points. Based on these obtained points, we develop a refined branch rule. This rule guarantees that the lower bound for the optimal value of the original problem is effectively updated. To further enhance the efficiency of algorithm, a region tightening technique is incorporated to eliminate redundant calculations. Ultimately, the convergence and complexity of the algorithm are analyzed. Numerical experiments indicate that the algorithm has advantages in term of efficiency for the test instances.

Suggested Citation

  • Yue, Hongwei & Li, Hou & Shen, Peiping & Deng, Yaping, 2026. "A refined branch and bound algorithm for solving the sum of linear ratios programming," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 247(C), pages 210-224.
    • Handle: RePEc:eee:matcom:v:247:y:2026:i:c:p:210-224
    DOI: 10.1016/j.matcom.2026.03.012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475426000935
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2026.03.012?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Jiao, Hong-Wei & Liu, San-Yang, 2015. "A practicable branch and bound algorithm for sum of linear ratios problem," European Journal of Operational Research, Elsevier, vol. 243(3), pages 723-730.
    2. Nesterov, Y. & Nemirovskii, A., 1995. "An interior-point method for generalized linear-fractional programming," LIDAM Reprints CORE 1168, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Takahito Kuno & Toshiyuki Masaki, 2013. "A practical but rigorous approach to sum-of-ratios optimization in geometric applications," Computational Optimization and Applications, Springer, vol. 54(1), pages 93-109, January.
    4. Benson, Harold P., 2007. "A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem," European Journal of Operational Research, Elsevier, vol. 182(2), pages 597-611, October.
    5. Hezhi Luo & Youmin Xu & Huixian Wu & Guoqiang Wang, 2025. "A New branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation," Computational Optimization and Applications, Springer, vol. 90(1), pages 257-301, January.
    6. A. Charnes & W. W. Cooper, 1962. "Programming with linear fractional functionals," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 9(3‐4), pages 181-186, September.
    7. Hiroshi Konno & Hajime Yamashita, 1999. "Minimizing sums and products of linear fractional functions over a polytope," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(5), pages 583-596, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hezhi Luo & Youmin Xu & Huixian Wu & Guoqiang Wang, 2025. "A New branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation," Computational Optimization and Applications, Springer, vol. 90(1), pages 257-301, January.
    2. Hongwei Jiao & Binbin Li & Youlin Shang, 2024. "An Outer Space Approach to Tackle Generalized Affine Fractional Program Problems," Journal of Optimization Theory and Applications, Springer, vol. 201(1), pages 1-35, April.
    3. Hongwei Jiao & Binbin Li & Wenqiang Yang, 2024. "A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems," Journal of Global Optimization, Springer, vol. 89(3), pages 597-632, July.
    4. Bo Zhang & YueLin Gao & Xia Liu & XiaoLi Huang, 2022. "An Outcome-Space-Based Branch-and-Bound Algorithm for a Class of Sum-of-Fractions Problems," Journal of Optimization Theory and Applications, Springer, vol. 192(3), pages 830-855, March.
    5. Hou, Zhisong & Liu, Sanyang, 2023. "A spatial branch-reduction-bound algorithm for solving generalized linear fractional problems globally," Chaos, Solitons & Fractals, Elsevier, vol. 176(C).
    6. Jiao, Hongwei & Ma, Junqiao, 2022. "An efficient algorithm and complexity result for solving the sum of general affine ratios problem," Chaos, Solitons & Fractals, Elsevier, vol. 164(C).
    7. Huang, Bingdi & Shen, Peiping, 2024. "An efficient branch and bound reduction algorithm for globally solving linear fractional programming problems," Chaos, Solitons & Fractals, Elsevier, vol. 182(C).
    8. Shen, Peiping & Zhu, Zeyi & Chen, Xiao, 2019. "A practicable contraction approach for the sum of the generalized polynomial ratios problem," European Journal of Operational Research, Elsevier, vol. 278(1), pages 36-48.
    9. João Paulo Costa & Maria João Alves, 2025. "A branch and cut algorithm to optimize a weighted sum-of-ratios in multiobjective mixed-integer fractional programming," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 47(2), pages 667-695, June.
    10. Bingdi Huang & Peiping Shen, 2025. "An efficient global optimization algorithm for the sum of linear ratios problems based on a novel adjustable branching rule," Computational Optimization and Applications, Springer, vol. 91(3), pages 1339-1371, July.
    11. Hongwei Jiao & Haibing Ma, 2026. "Spatial Algorithm for Mixed Integer Generalized Affine Multiplicative Problems," Journal of Optimization Theory and Applications, Springer, vol. 209(1), pages 1-36, April.
    12. Mojtaba Borza & Azmin Sham Rambely, 2021. "A Linearization to the Sum of Linear Ratios Programming Problem," Mathematics, MDPI, vol. 9(9), pages 1-10, April.
    13. Chen, Kun & Zhu, Joe, 2020. "Additive slacks-based measure: Computational strategy and extension to network DEA," Omega, Elsevier, vol. 91(C).
    14. T Drezner & Z Drezner & P Kalczynski, 2011. "A cover-based competitive location model," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 100-113, January.
    15. X. Liu & Y.L. Gao & B. Zhang & F.P. Tian, 2019. "A New Global Optimization Algorithm for a Class of Linear Fractional Programming," Mathematics, MDPI, vol. 7(9), pages 1-21, September.
    16. Li, Xingchen & Xu, Guangcheng & Wu, Jie & Xu, Chengzhen & Zhu, Qingyuan, 2024. "Evaluation of bank efficiency by considering the uncertainty of nonperforming loans," Omega, Elsevier, vol. 126(C).
    17. Azarnoosh Kafi & Behrouz Daneshian & Mohsen Rostamy-Malkhalifeh, 2021. "Forecasting the confidence interval of efficiency in fuzzy DEA," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 31(1), pages 41-59.
    18. Tunjo Perić & Josip Matejaš & Zoran Babić, 2023. "Advantages, sensitivity and application efficiency of the new iterative method to solve multi-objective linear fractional programming problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 31(3), pages 751-767, September.
    19. Chen, Ya & Pan, Yongbin & Liu, Haoxiang & Wu, Huaqing & Deng, Guangwei, 2023. "Efficiency analysis of Chinese universities with shared inputs: An aggregated two-stage network DEA approach," Socio-Economic Planning Sciences, Elsevier, vol. 90(C).
    20. Kristiaan Kerstens & Jafar Sadeghi & Ignace Van de Woestyne, 2020. "Plant capacity notions in a non-parametric framework: a brief review and new graph or non-oriented plant capacities," Annals of Operations Research, Springer, vol. 288(2), pages 837-860, May.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:247:y:2026:i:c:p:210-224. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.