IDEAS home Printed from https://ideas.repec.org/a/eee/ecpeco/v10y1986i2p95-104.html
   My bibliography  Save this article

Estimates of the minimum nondominated criterion values in multiple-criteria decision-making

Author

Listed:
  • Dessouky, M. I.
  • Ghiassi, M.
  • Davis, W. J.

Abstract

No abstract is available for this item.

Suggested Citation

  • Dessouky, M. I. & Ghiassi, M. & Davis, W. J., 1986. "Estimates of the minimum nondominated criterion values in multiple-criteria decision-making," Engineering Costs and Production Economics, Elsevier, vol. 10(2), pages 95-104, June.
    • Handle: RePEc:eee:ecpeco:v:10:y:1986:i:2:p:95-104
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0167-188X(86)90003-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. Kahina Ghazli & Nicolas Gillis & Mustapha Moulaï, 2020. "Optimizing over the properly efficient set of convex multi-objective optimization problems," Annals of Operations Research, Springer, vol. 295(2), pages 575-604, December.
    2. Harold Benson, 2012. "An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem," Journal of Global Optimization, Springer, vol. 52(3), pages 553-574, March.
    3. R. Horst & N. V. Thoai, 1997. "Utility Function Programs and Optimization over the Efficient Set in Multiple-Objective Decision Making," Journal of Optimization Theory and Applications, Springer, vol. 92(3), pages 605-631, March.
    4. Harold P. Benson & Serpil Sayin, 1997. "Towards finding global representations of the efficient set in multiple objective mathematical programming," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(1), pages 47-67, February.
    5. Alves, Maria João & Costa, João Paulo, 2009. "An exact method for computing the nadir values in multiple objective linear programming," European Journal of Operational Research, Elsevier, vol. 198(2), pages 637-646, October.
    6. Serpil Sayin, 2003. "A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors," Operations Research, INFORMS, vol. 51(3), pages 427-436, June.
    7. Serpil Sayin, 2000. "Optimizing Over the Efficient Set Using a Top-Down Search of Faces," Operations Research, INFORMS, vol. 48(1), pages 65-72, February.
    8. Mavrotas, George & Florios, Kostas, 2013. "An improved version of the augmented epsilon-constraint method (AUGMECON2) for finding the exact Pareto set in Multi-Objective Integer Programming problems," MPRA Paper 105034, University Library of Munich, Germany.
    9. Tu, Ta Van, 2000. "Optimization over the efficient set of a parametric multiple objective linear programming problem," European Journal of Operational Research, Elsevier, vol. 122(3), pages 570-583, May.
    10. Ricardo Landa & Giomara Lárraga & Gregorio Toscano, 2019. "Use of a goal-constraint-based approach for finding the region of interest in multi-objective problems," Journal of Heuristics, Springer, vol. 25(1), pages 107-139, February.

    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:ecpeco:v:10:y:1986:i:2:p:95-104. 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/inca/505647 .

    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.