IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v25y2016i2p252-268.html
   My bibliography  Save this article

Lexicographic multi-period resources allocation problem with weighted substitutable resources

Author

Listed:
  • Mohamed Essalah Salah
  • Slah Ben Youssef
  • Abdelwaheb Rebai

Abstract

Lexicographic multi-period resources allocation problem with weighted substitutable resources is concerned with the allocation of m resources among n users during t periods such as certain weighted substitution between resources is possible in the objective to minimise lexicographically the performances functions vector. In this work, we point that there is proportional answered of the minmax approach to the principle of need. We propose the lexicographic approach to avoid this problem and realise fairness in the allocation of limited resources. For this reason, we study some variants of lexicographic resources allocation problem (LRAP) and we propose the model to formulate the lexicographic multi-period resources allocation problem with weighted substitutable resources (LMRAPWSR). Also, we propose an exact algorithm to solve our formulated model and we apply this algorithm to treat a case study that concerns the allocation of eight fertilisers among six agri-agricultures during three periods.

Suggested Citation

  • Mohamed Essalah Salah & Slah Ben Youssef & Abdelwaheb Rebai, 2016. "Lexicographic multi-period resources allocation problem with weighted substitutable resources," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 25(2), pages 252-268.
    • Handle: RePEc:ids:ijores:v:25:y:2016:i:2:p:252-268
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=73958
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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:ids:ijores:v:25:y:2016:i:2:p:252-268. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.