IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v4y2023i4d10.1007_s43069-023-00256-x.html
   My bibliography  Save this article

A Linearization to the Multi-objective Linear Plus Linear Fractional Program

Author

Listed:
  • Mojtaba Borza

    (Faculty of Science & Technology, UKM)

  • Azmin Sham Rambely

    (Faculty of Science & Technology, UKM)

  • Seyed Ahmad Edalatpanah

    (Ayandegan Institute of Higher Education)

Abstract

The structure of the sum of linear plus linear ratio program is complex and š¯’©š¯’«-completeness. In management science, game theory, and industry, there are problems such that their mathematical models can be represented as a multi-objective linear plus linear fractional programming problem (MOLLFPP). The aim of this study is to introduce a method to address the MOLLFPP. The approach is designed in 2 phases. In phase 1, a method is created to reach the global optimal solution of the linear plus linear fractional programming problem (LLFPP) using suitable variable transformations. In fact, in this phase, the LLFPP is changed into a linear programming problem (LPP). In phase 2, taking into account the information of phase 1, the MOLLFPP is transformed into LPPs by applying the weighted sum and maxā€“min techniques. Two examples are solved to illustrate the method and comparisons are made to show the accuracy.

Suggested Citation

  • Mojtaba Borza & Azmin Sham Rambely & Seyed Ahmad Edalatpanah, 2023. "A Linearization to the Multi-objective Linear Plus Linear Fractional Program," SN Operations Research Forum, Springer, vol. 4(4), pages 1-22, December.
    • Handle: RePEc:spr:snopef:v:4:y:2023:i:4:d:10.1007_s43069-023-00256-x
    DOI: 10.1007/s43069-023-00256-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-023-00256-x
    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/s43069-023-00256-x?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.

    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:snopef:v:4:y:2023:i:4:d:10.1007_s43069-023-00256-x. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.