IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v31y2023i3d10.1007_s10100-023-00848-2.html
   My bibliography  Save this article

Advantages, sensitivity and application efficiency of the new iterative method to solve multi-objective linear fractional programming problem

Author

Listed:
  • Tunjo Perić

    (University of Zagreb)

  • Josip Matejaš

    (University of Zagreb)

  • Zoran Babić

    (University of Split)

Abstract

In the paper we consider advantages, sensitivity and application efficiency of the new method for solving multi-objective linear fractional programming problems. The proposed method is an iterative and numerically simple method that provides a unique solution in each iteration. The obtained solution is iteratively evaluated with the possibility of coarse and fine adjustment based on aspirations and cooperation among decision makers. Some relevant examples from the literature were used to present the stated properties and advantages of the proposed method in relation to the existing ones.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:cejnor:v:31:y:2023:i:3:d:10.1007_s10100-023-00848-2
    DOI: 10.1007/s10100-023-00848-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10100-023-00848-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10100-023-00848-2?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. Mishra, Savita, 2007. "Weighting method for bi-level linear fractional programming problems," European Journal of Operational Research, Elsevier, vol. 183(1), pages 296-302, November.
    2. Kornbluth, Jonathan S. H. & Steuer, Ralph E., 1981. "Goal programming with linear fractional criteria," European Journal of Operational Research, Elsevier, vol. 8(1), pages 58-65, September.
    3. Hartmut Wolf, 1985. "A Parametric Method for Solving the Linear Fractional Programming Problem," Operations Research, INFORMS, vol. 33(4), pages 835-841, August.
    4. 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.
    5. J. Granat & A.P. Wierzbicki, 1994. "Interactive Specification of DSS User Preferences in Terms of Fuzzy Sets," Working Papers wp94029, International Institute for Applied Systems Analysis.
    6. Caballero, Rafael & Hernandez, Monica, 2006. "Restoration of efficiency in a goal programming problem with linear fractional criteria," European Journal of Operational Research, Elsevier, vol. 172(1), pages 31-39, July.
    7. Kanti Swarup, 1965. "Letter to the Editor—Linear Fractional Functionals Programming," Operations Research, INFORMS, vol. 13(6), pages 1029-1036, December.
    8. Stanley Zionts, 1968. "Programming with linear fractional functionals," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 15(3), pages 449-451, September.
    9. G. R. Bitran & A. G. Novaes, 1973. "Linear Programming with a Fractional Objective Function," Operations Research, INFORMS, vol. 21(1), pages 22-29, February.
    10. 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. Janez Povh & Lidija Zadnik Stirn & Janez Žerovnik, 2023. "60 years of OR in Slovenia: development from a first conference to a vibrant community," 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 681-690, September.

    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. 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.
    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. Ahlatcioglu, Mehmet & Tiryaki, Fatma, 2007. "Interactive fuzzy programming for decentralized two-level linear fractional programming (DTLLFP) problems," Omega, Elsevier, vol. 35(4), pages 432-450, August.
    6. 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.
    7. 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.
    8. Abbas Amini Fasakhodi & Seyed Nouri & Manouchehr Amini, 2010. "Water Resources Sustainability and Optimal Cropping Pattern in Farming Systems; A Multi-Objective Fractional Goal Programming Approach," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 24(15), pages 4639-4657, December.
    9. 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.
    10. Sehgal, Ruchika & Sharma, Amita & Mansini, Renata, 2023. "Worst-case analysis of Omega-VaR ratio optimization model," Omega, Elsevier, vol. 114(C).
    11. Suvasis Nayak & Akshay Kumar Ojha, 2019. "Solution approach to multi-objective linear fractional programming problem using parametric functions," OPSEARCH, Springer;Operational Research Society of India, vol. 56(1), pages 174-190, March.
    12. 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.
    13. 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.
    14. 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.
    15. Chen, Fang & Huang, Guohe & Fan, Yurui, 2015. "A linearization and parameterization approach to tri-objective linear programming problems for power generation expansion planning," Energy, Elsevier, vol. 87(C), pages 240-250.
    16. Pandian Ponnaiah & Jayalakshmi Mohan, 2013. "On Solving Linear Fractional Programming Problems," Modern Applied Science, Canadian Center of Science and Education, vol. 7(6), pages 1-90, June.
    17. 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.
    18. 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.
    19. 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.
    20. 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.

    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:spr:cejnor:v:31:y:2023:i:3:d:10.1007_s10100-023-00848-2. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.