IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v7y1981i3p274-283.html
   My bibliography  Save this article

A simplex based algorithm for the lexicographically extended linear maxmin problem

Author

Listed:
  • Alois Behringer, Fred

Abstract

No abstract is available for this item.

Suggested Citation

  • Alois Behringer, Fred, 1981. "A simplex based algorithm for the lexicographically extended linear maxmin problem," European Journal of Operational Research, Elsevier, vol. 7(3), pages 274-283, July.
    • Handle: RePEc:eee:ejores:v:7:y:1981:i:3:p:274-283
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(81)90349-0
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Lehuédé, Fabien & Péton, Olivier & Tricoire, Fabien, 2020. "A lexicographic minimax approach to the vehicle routing problem with route balancing," European Journal of Operational Research, Elsevier, vol. 282(1), pages 129-147.
    2. Mingming Leng & Mahmut Parlar, 2010. "Analytic solution for the nucleolus of a three‐player cooperative game," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(7), pages 667-672, October.
    3. Zhang Jiangao & Shitao Yang, 2016. "On the Lexicographic Centre of Multiple Objective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 168(2), pages 600-614, February.
    4. Christ, Quentin & Dauzère-Pérès, Stéphane & Lepelletier, Guillaume, 2019. "An Iterated Min–Max procedure for practical workload balancing on non-identical parallel machines in manufacturing systems," European Journal of Operational Research, Elsevier, vol. 279(2), pages 419-428.
    5. Dubois, Didier & Fortemps, Philippe, 1999. "Computing improved optimal solutions to max-min flexible constraint satisfaction problems," European Journal of Operational Research, Elsevier, vol. 118(1), pages 95-126, October.
    6. Dubois, D. & Fortemps, Ph., 2005. "Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints," European Journal of Operational Research, Elsevier, vol. 160(3), pages 582-598, February.
    7. Fromen, Bastian, 1997. "Reducing the number of linear programs needed for solving the nucleolus problem of n-person game theory," European Journal of Operational Research, Elsevier, vol. 98(3), pages 626-636, May.
    8. Dubois, Didier & Fortemps, Philippe & Pirlot, Marc & Prade, Henri, 2001. "Leximin optimality and fuzzy set-theoretic operations," European Journal of Operational Research, Elsevier, vol. 130(1), pages 20-28, April.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:7:y:1981:i:3:p:274-283. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.