IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v175y2023ip1s0960077923008251.html
   My bibliography  Save this article

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

Author

Listed:
  • Gao, YueLin
  • Zhang, Bo

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.

Suggested Citation

  • Gao, YueLin & Zhang, Bo, 2023. "Output-space branch-and-bound reduction algorithm for generalized linear fractional-multiplicative programming problem," Chaos, Solitons & Fractals, Elsevier, vol. 175(P1).
    • Handle: RePEc:eee:chsofr:v:175:y:2023:i:p1:s0960077923008251
    DOI: 10.1016/j.chaos.2023.113924
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077923008251
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2023.113924?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Peiping Shen & Kaimin Wang & Ting Lu, 2020. "Outer space branch and bound algorithm for solving linear multiplicative programming problems," Journal of Global Optimization, Springer, vol. 78(3), pages 453-482, November.
    2. Maranas, C. D. & Androulakis, I. P. & Floudas, C. A. & Berger, A. J. & Mulvey, J. M., 1997. "Solving long-term financial planning problems via global optimization," Journal of Economic Dynamics and Control, Elsevier, vol. 21(8-9), pages 1405-1425, June.
    3. Bo Zhang & Yuelin Gao & Xia Liu & Xiaoli Huang, 2020. "Output-Space Branch-and-Bound Reduction Algorithm for a Class of Linear Multiplicative Programs," Mathematics, MDPI, vol. 8(3), pages 1-34, March.
    4. H. P. Benson, 2005. "Decomposition Branch-and-Bound Based Algorithm for Linear Programs with Additional Multiplicative Constraints," Journal of Optimization Theory and Applications, Springer, vol. 126(1), pages 41-61, July.
    5. 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.
    6. H. P. Benson & G. M. Boger, 2000. "Outcome-Space Cutting-Plane Algorithm for Linear Multiplicative Programming," Journal of Optimization Theory and Applications, Springer, vol. 104(2), pages 301-322, February.
    7. 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.
    8. H. P. Benson & G. M. Boger, 1997. "Multiplicative Programming Problems: Analysis and Efficient Point Search Heuristic," Journal of Optimization Theory and Applications, Springer, vol. 94(2), pages 487-510, August.
    9. John M. Mulvey & Robert J. Vanderbei & Stavros A. Zenios, 1995. "Robust Optimization of Large-Scale Systems," Operations Research, INFORMS, vol. 43(2), pages 264-281, April.
    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. Bo Zhang & Yuelin Gao & Xia Liu & Xiaoli Huang, 2020. "Output-Space Branch-and-Bound Reduction Algorithm for a Class of Linear Multiplicative Programs," Mathematics, MDPI, vol. 8(3), pages 1-34, March.
    2. Boddiford, Ashley N. & Kaufman, Daniel E. & Skipper, Daphne E. & Uhan, Nelson A., 2023. "Approximating a linear multiplicative objective in watershed management optimization," European Journal of Operational Research, Elsevier, vol. 305(2), pages 547-561.
    3. Peiping Shen & Kaimin Wang & Ting Lu, 2020. "Outer space branch and bound algorithm for solving linear multiplicative programming problems," Journal of Global Optimization, Springer, vol. 78(3), pages 453-482, November.
    4. Peiping Shen & Dianxiao Wu & Kaimin Wang, 2023. "Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound," Journal of Global Optimization, Springer, vol. 86(2), pages 303-321, June.
    5. Lizhen Shao & Matthias Ehrgott, 2014. "An objective space cut and bound algorithm for convex multiplicative programmes," Journal of Global Optimization, Springer, vol. 58(4), pages 711-728, April.
    6. Toloo, Mehdi & Mensah, Emmanuel Kwasi & Salahi, Maziar, 2022. "Robust optimization and its duality in data envelopment analysis," Omega, Elsevier, vol. 108(C).
    7. 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.
    8. 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.
    9. 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.
    10. Yande Gong & Joe Zhu & Ya Chen & Wade D. Cook, 2018. "DEA as a tool for auditing: application to Chinese manufacturing industry with parallel network structures," Annals of Operations Research, Springer, vol. 263(1), pages 247-269, April.
    11. Donghai Wang & Qiuhong Zhao, 2020. "A Simultaneous Optimization Model for Airport Network Slot Allocation under Uncertain Capacity," Sustainability, MDPI, vol. 12(14), pages 1-14, July.
    12. Shan Lan & John-Paul Clarke & Cynthia Barnhart, 2006. "Planning for Robust Airline Operations: Optimizing Aircraft Routings and Flight Departure Times to Minimize Passenger Disruptions," Transportation Science, INFORMS, vol. 40(1), pages 15-28, February.
    13. Khaled, Oumaima & Minoux, Michel & Mousseau, Vincent & Michel, Stéphane & Ceugniet, Xavier, 2018. "A multi-criteria repair/recovery framework for the tail assignment problem in airlines," Journal of Air Transport Management, Elsevier, vol. 68(C), pages 137-151.
    14. Irawan, Chandra Ade & Jones, Dylan & Hofman, Peter S. & Zhang, Lina, 2023. "Integrated strategic energy mix and energy generation planning with multiple sustainability criteria and hierarchical stakeholders," European Journal of Operational Research, Elsevier, vol. 308(2), pages 864-883.
    15. Hashem Omrani & Farzane Adabi & Narges Adabi, 2017. "Designing an efficient supply chain network with uncertain data: a robust optimization—data envelopment analysis approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(7), pages 816-828, July.
    16. Zhang, Yanfang & Wei, Jinpeng & Gao, Qi & Shi, Xunpeng & Zhou, Dequn, 2022. "Coordination between the energy-consumption permit trading scheme and carbon emissions trading: Evidence from China," Energy Economics, Elsevier, vol. 116(C).
    17. Johannes König & Carsten Schröder, 2018. "Inequality-minimization with a given public budget," The Journal of Economic Inequality, Springer;Society for the Study of Economic Inequality, vol. 16(4), pages 607-629, December.
    18. Jihee Han & KwangSup Shin, 2016. "Evaluation mechanism for structural robustness of supply chain considering disruption propagation," International Journal of Production Research, Taylor & Francis Journals, vol. 54(1), pages 135-151, January.
    19. Bao-Ngoc Tong & Cheng-Ping Cheng & Lien-Wen Liang & Yi-Jun Liu, 2023. "Using Network DEA to Explore the Effect of Mobile Payment on Taiwanese Bank Efficiency," Sustainability, MDPI, vol. 15(8), pages 1-18, April.
    20. Georg Bechler & Claudius Steinhardt & Jochen Mackert, 2021. "On the Linear Integration of Attraction Choice Models in Business Optimization Problems," SN Operations Research Forum, Springer, vol. 2(1), pages 1-13, March.

    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:chsofr:v:175:y:2023:i:p1:s0960077923008251. 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: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    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.