IDEAS home Printed from https://ideas.repec.org/a/ids/ijarge/v11y2015i1p45-62.html
   My bibliography  Save this article

Minmax multi-period resources allocation problem with weighted substitutable resources

Author

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

Abstract

Minmax multi-period resources allocation problem with weighted substitutable resources is concerned with the allocation of m resources (wealth, working opportunities, healthcare, alimentary needs) among n users during t periods. The objective of this problem is to minimise the maximum performance function, knowing that certain weighted substitution between resources is possible. Today, one of the most controversial questions is how to allocate the limited amount of resources among competing users in order to realise justice between users. This question indicates that we are searching for methods to realise fairness in the allocation of limited resources. In this paper, we study some variants of minmax resources allocation problems. Then, we present the principles of distributive justice and we propose the model to formulate the minmax multi-period resources allocation problem with weighted substitutable resources. Finally, we propose an exact algorithm to solve our formulated model and we present a numerical example to test our algorithm. The obtained result is considered as a motivation to solve a real instance.

Suggested Citation

  • Mohamed Esalah Salah & Slah Ben Youssef & Abdelwaheb Rebai, 2015. "Minmax multi-period resources allocation problem with weighted substitutable resources," International Journal of Agricultural Resources, Governance and Ecology, Inderscience Enterprises Ltd, vol. 11(1), pages 45-62.
  • Handle: RePEc:ids:ijarge:v:11:y:2015:i:1:p:45-62
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=69787
    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:ijarge:v:11:y:2015:i:1:p:45-62. 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=1 .

    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.