IDEAS home Printed from https://ideas.repec.org/a/wut/journl/v2y2018p5-21id1352.html
   My bibliography  Save this article

Branch and bound algorithm for discrete multi- level linear fractional programming problem

Author

Listed:
  • Ritu Arora
  • Kavita Gupta

Abstract

An algorithm is proposed to find an integer solution for bilevel linear fractional programming problem with discrete variables. The method develops a cut that removes the integer solutions which are not bilevel feasible. The proposed method is extended from bilevel to multilevel linear fractional programming problems with discrete variables. The solution procedure for both the algorithms is elucidated in the paper.

Suggested Citation

  • Ritu Arora & Kavita Gupta, 2018. "Branch and bound algorithm for discrete multi- level linear fractional programming problem," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 28(2), pages 5-21.
    • Handle: RePEc:wut:journl:v:2:y:2018:p:5-21:id:1352
    DOI: 10.5277/ord180201
    as

    Download full text from publisher

    File URL: https://ord.pwr.edu.pl/assets/papers_archive/1352%20-%20published.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.5277/ord180201?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
    ---><---

    References listed on IDEAS

    as
    1. Johanna Camargo Pérez & Martha Carrillo & Jairo Montoya-Torres, 2015. "Multi-criteria approaches for urban passenger transport systems: a literature review," Annals of Operations Research, Springer, vol. 226(1), pages 69-87, March.
    2. Pu Cai & Jin-yi Cai & Ashish V. Naik, 1998. "Efficient Algorithms for a Scheduling Problem and its Applications to Illicit Drug Market Crackdowns," Journal of Combinatorial Optimization, Springer, vol. 1(4), pages 367-376, December.
    3. Luis Henrique Magalhães Costa & Bruno Prata & Helena M. Ramos & Marco Aurélio Holanda Castro, 2016. "A Branch-and-Bound Algorithm for Optimal Pump Scheduling in Water Distribution Networks," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 30(3), pages 1037-1052, February.
    4. Dempe, Stephan & Kalashnikov, Vyacheslav & Rios-Mercado, Roger Z., 2005. "Discrete bilevel programming: Application to a natural gas cash-out problem," European Journal of Operational Research, Elsevier, vol. 166(2), pages 469-488, October.
    5. Shifali Bhargava, 2014. "Solving linear fractional multi-level programs," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 24(1), pages 5-21.
    6. Claassen, G.D.H., 2014. "Mixed integer (0–1) fractional programming for decision support in paper production industry," Omega, Elsevier, vol. 43(C), pages 21-29.
    7. Bijay Baran Pal & Somsubhra Gupta, 2012. "A genetic algorithm-based fuzzy goal programming approach for solving fractional bilevel programming problems," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 14(4), pages 453-471.
    8. 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.
    9. Herminia I. Calvete & Carmen Galé, 2004. "A Penalty Method For Solving Bilevel Linear Fractional/Linear Programming Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 21(02), pages 207-224.
    10. Kanti Swarup, 1965. "Letter to the Editor—Linear Fractional Functionals Programming," Operations Research, INFORMS, vol. 13(6), pages 1029-1036, December.
    11. Werner Dinkelbach, 1967. "On Nonlinear Fractional Programming," Management Science, INFORMS, vol. 13(7), pages 492-498, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Vandana Goyal & Namrata Rani & Deepak Gupta, 2022. "An algorithm for quadratically constrained multi-objective quadratic fractional programming with pentagonal fuzzy numbers," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 32(1), pages 49-71.

    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. 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.
    2. Harald Dyckhoff & Katrin Allen, 1999. "Theoretische Begründung einer Effizienzanalyse mittels Data Envelopment Analysis (DEA)," Schmalenbach Journal of Business Research, Springer, vol. 51(5), pages 411-436, May.
    3. Maziar Sahamkhadam, 2021. "Dynamic copula-based expectile portfolios," Journal of Asset Management, Palgrave Macmillan, vol. 22(3), pages 209-223, May.
    4. S. N. Gupta & A. K. Jain & Kanti Swarup, 1987. "Stochastic linear fractional programming with the ratio of independent Cauchy variates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(2), pages 293-305, April.
    5. Vandana Goyal & Namrata Rani & Deepak Gupta, 2022. "An algorithm for quadratically constrained multi-objective quadratic fractional programming with pentagonal fuzzy numbers," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 32(1), pages 49-71.
    6. Roberto Baldacci & Andrew Lim & Emiliano Traversi & Roberto Wolfler Calvo, 2020. "Optimal Solution of Vehicle Routing Problems with Fractional Objective Function," Transportation Science, INFORMS, vol. 54(2), pages 434-452, March.
    7. Niu, Geng & Zheng, Yi & Han, Feng & Qin, Huapeng, 2019. "The nexus of water, ecosystems and agriculture in arid areas: A multiobjective optimization study on system efficiencies," Agricultural Water Management, Elsevier, vol. 223(C), pages 1-1.
    8. Vandana Goyal & Namrata Rani & Deepak Gupta, 2022. "Rouben Ranking Function and parametric approach to quadratically constrained multiobjective quadratic fractional programming with trapezoidal fuzzy number coefficients," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(2), pages 923-932, April.
    9. 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.
    10. M. Barkhagen & S. García & J. Gondzio & J. Kalcsics & J. Kroeske & S. Sabanis & A. Staal, 2023. "Optimising portfolio diversification and dimensionality," Journal of Global Optimization, Springer, vol. 85(1), pages 185-234, January.
    11. Nabil Absi & Diego Cattaruzza & Dominique Feillet & Maxime Ogier & Frédéric Semet, 2020. "A Heuristic Branch-Cut-and-Price Algorithm for the ROADEF/EURO Challenge on Inventory Routing," Transportation Science, INFORMS, vol. 54(2), pages 313-329, March.
    12. Maziar Sahamkhadam & Andreas Stephan, 2023. "Portfolio optimization based on forecasting models using vine copulas: An empirical assessment for global financial crises," Journal of Forecasting, John Wiley & Sons, Ltd., vol. 42(8), pages 2139-2166, December.
    13. Ali Sadeghi & Mansour Saraj & Nezam Mahdavi Amiri, 2018. "Efficient Solutions of Interval Programming Problems with Inexact Parameters and Second Order Cone Constraints," Mathematics, MDPI, vol. 6(11), pages 1-13, November.
    14. Sahamkhadam, Maziar & Stephan, Andreas & Östermark, Ralf, 2022. "Copula-based Black–Litterman portfolio optimization," European Journal of Operational Research, Elsevier, vol. 297(3), pages 1055-1070.
    15. Víctor M. Adame-García & Fernando Fernández-Rodríguez & Simón Sosvilla-Rivero, "undated". "Portfolios in the Ibex 35 index: Alternative methods to the traditional framework, a comparative with the naive diversification in a pre- and post- crisis context," Documentos de Trabajo del ICAE 2015-07, Universidad Complutense de Madrid, Facultad de Ciencias Económicas y Empresariales, Instituto Complutense de Análisis Económico, revised Jun 2015.
    16. 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.
    17. 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.
    18. 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.
    19. Tien Mai & Arunesh Sinha, 2022. "Safe Delivery of Critical Services in Areas with Volatile Security Situation via a Stackelberg Game Approach," Papers 2204.11451, arXiv.org.
    20. Park, Chong Hyun & Lim, Heejong, 2021. "A parametric approach to integer linear fractional programming: Newton’s and Hybrid-Newton methods for an optimal road maintenance problem," European Journal of Operational Research, Elsevier, vol. 289(3), pages 1030-1039.

    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:wut:journl:v:2:y:2018:p:5-21:id:1352. 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: Adam Kasperski (email available below). General contact details of provider: https://edirc.repec.org/data/iopwrpl.html .

    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.