IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v52y2012i3p553-574.html
   My bibliography  Save this article

An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem

Author

Listed:
  • Harold Benson

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jglopt:v:52:y:2012:i:3:p:553-574
    DOI: 10.1007/s10898-011-9786-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-011-9786-y
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-011-9786-y?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.

    References listed on IDEAS

    as
    1. Jonathan M. Borwein, 1983. "On the Existence of Pareto Efficient Points," Mathematics of Operations Research, INFORMS, vol. 8(1), pages 64-73, February.
    2. 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.
    3. Benson, Harold P., 1986. "An algorithm for optimizing over the weakly-efficient set," European Journal of Operational Research, Elsevier, vol. 25(2), pages 192-199, May.
    4. Thoai, Nguyen V., 2000. "A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem," European Journal of Operational Research, Elsevier, vol. 122(1), pages 58-68, April.
    5. Yamada, Syuuji & Tanino, Tetsuzo & Inuiguchi, Masahiro, 2001. "An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set," European Journal of Operational Research, Elsevier, vol. 133(2), pages 267-286, January.
    Full references (including those not matched with items on IDEAS)

    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. Schöbel, Anita & Zhou-Kangas, Yue, 2021. "The price of multiobjective robustness: Analyzing solution sets to uncertain multiobjective problems," European Journal of Operational Research, Elsevier, vol. 291(2), pages 782-793.
    3. Erjiang Sun, 2017. "On Optimization Over the Efficient Set of a Multiple Objective Linear Programming Problem," Journal of Optimization Theory and Applications, Springer, vol. 172(1), pages 236-246, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    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. 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.
    3. 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.
    4. Nergiz Kasimbeyli, 2015. "Existence and characterization theorems in nonconvex vector optimization," Journal of Global Optimization, Springer, vol. 62(1), pages 155-165, May.
    5. Erjiang Sun, 2017. "On Optimization Over the Efficient Set of a Multiple Objective Linear Programming Problem," Journal of Optimization Theory and Applications, Springer, vol. 172(1), pages 236-246, January.
    6. Feng Guo & Liguo Jiao, 2023. "A new scheme for approximating the weakly efficient solution set of vector rational optimization problems," Journal of Global Optimization, Springer, vol. 86(4), pages 905-930, August.
    7. 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.
    8. White, D. J., 1996. "The maximization of a function over the efficient set via a penalty function approach," European Journal of Operational Research, Elsevier, vol. 94(1), pages 143-153, October.
    9. Briec, W. & Lemaire, B., 1999. "Technical efficiency and distance to a reverse convex set," European Journal of Operational Research, Elsevier, vol. 114(1), pages 178-187, April.
    10. Kalu, Timothy Ch. U., 1999. "An algorithm for systems welfare interactive goal programming modelling," European Journal of Operational Research, Elsevier, vol. 116(3), pages 508-529, August.
    11. Li-Wen Zhou & Nan-Jing Huang, 2013. "Existence of Solutions for Vector Optimization on Hadamard Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 157(1), pages 44-53, April.
    12. 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.
    13. 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.
    14. Stacey Faulkenberg & Margaret Wiecek, 2012. "Generating equidistant representations in biobjective programming," Computational Optimization and Applications, Springer, vol. 51(3), pages 1173-1210, April.
    15. Yarui Duan & Liguo Jiao & Pengcheng Wu & Yuying Zhou, 2022. "Existence of Pareto Solutions for Vector Polynomial Optimization Problems with Constraints," Journal of Optimization Theory and Applications, Springer, vol. 195(1), pages 148-171, October.
    16. X. Y. Zheng & X. M. Yang & K. L. Teo, 2007. "Some Geometrical Aspects of Efficient Points in Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 133(2), pages 275-288, May.
    17. Nguyen Quang Huy & Do Sang Kim & Nguyen Van Tuyen, 2017. "Existence Theorems in Vector Optimization with Generalized Order," Journal of Optimization Theory and Applications, Springer, vol. 174(3), pages 728-745, September.
    18. R. Horst & N. V. Thoai & Y. Yamamoto & D. Zenke, 2007. "On Optimization over the Efficient Set in Linear Multicriteria Programming," Journal of Optimization Theory and Applications, Springer, vol. 134(3), pages 433-443, September.
    19. Botte, Marco & Schöbel, Anita, 2019. "Dominance for multi-objective robust optimization concepts," European Journal of Operational Research, Elsevier, vol. 273(2), pages 430-440.
    20. 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.

    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:jglopt:v:52:y:2012:i:3:p:553-574. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.