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

Maximizing a concave function over the efficient or weakly-efficient set

Author

Listed:
  • Horst, Reiner
  • Thoai, Nguyen V.

Abstract

No abstract is available for this item.

Suggested Citation

  • Horst, Reiner & Thoai, Nguyen V., 1999. "Maximizing a concave function over the efficient or weakly-efficient set," European Journal of Operational Research, Elsevier, vol. 117(2), pages 239-252, September.
    • Handle: RePEc:eee:ejores:v:117:y:1999:i:2:p:239-252
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(98)00230-6
    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.

    References listed on IDEAS

    as
    1. 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.
    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. Le Thi, Hoai An & Pham, Dinh Tao & Thoai, Nguyen V., 2002. "Combination between global and local methods for solving an optimization problem over the efficient set," European Journal of Operational Research, Elsevier, vol. 142(2), pages 258-270, October.
    2. Henri Bonnel & Léonard Todjihoundé & Constantin Udrişte, 2015. "Semivectorial Bilevel Optimization on Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 167(2), pages 464-486, November.
    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.
    4. Henri Bonnel & Julien Collonge, 2015. "Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case," Journal of Global Optimization, Springer, vol. 62(3), pages 481-505, July.
    5. 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.
    6. Jornada, Daniel & Leon, V. Jorge, 2016. "Biobjective robust optimization over the efficient set for Pareto set reduction," European Journal of Operational Research, Elsevier, vol. 252(2), pages 573-586.
    7. N. V. Thoai, 2010. "Reverse Convex Programming Approach in the Space of Extreme Criteria for Optimization over Efficient Sets," Journal of Optimization Theory and Applications, Springer, vol. 147(2), pages 263-277, November.
    8. Henri Bonnel & Julien Collonge, 2014. "Stochastic Optimization over a Pareto Set Associated with a Stochastic Multi-Objective Optimization Problem," Journal of Optimization Theory and Applications, Springer, vol. 162(2), pages 405-427, August.
    9. Henri Bonnel & C. Yalçın Kaya, 2010. "Optimization Over the Efficient Set of Multi-objective Convex Optimal Control Problems," Journal of Optimization Theory and Applications, Springer, vol. 147(1), pages 93-112, October.
    10. Ehrgott, Matthias & Tenfelde-Podehl, Dagmar, 2003. "Computation of ideal and Nadir values and implications for their use in MCDM methods," European Journal of Operational Research, Elsevier, vol. 151(1), pages 119-139, November.
    11. Henri Bonnel & Christopher Schneider, 2019. "Post-Pareto Analysis and a New Algorithm for the Optimal Parameter Tuning of the Elastic Net," Journal of Optimization Theory and Applications, Springer, vol. 183(3), pages 993-1027, December.

    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. Ehrgott, Matthias & Tenfelde-Podehl, Dagmar, 2003. "Computation of ideal and Nadir values and implications for their use in MCDM methods," European Journal of Operational Research, Elsevier, vol. 151(1), pages 119-139, November.
    2. 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.
    3. H.A. Le Thi & T. Pham Dinh & L.D. Muu, 2003. "Simplicially-Constrained DC Optimization over Efficient and Weakly Efficient Sets," Journal of Optimization Theory and Applications, Springer, vol. 117(3), pages 503-531, June.
    4. 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.
    5. J. Fülöp & L. D. Muu, 2000. "Branch-and-Bound Variant of an Outcome-Based Algorithm for Optimizing over the Efficient Set of a Bicriteria Linear Programming Problem," Journal of Optimization Theory and Applications, Springer, vol. 105(1), pages 37-54, April.
    6. Le Thi, Hoai An & Pham, Dinh Tao & Thoai, Nguyen V., 2002. "Combination between global and local methods for solving an optimization problem over the efficient set," European Journal of Operational Research, Elsevier, vol. 142(2), pages 258-270, October.
    7. S.T. Hackman & U. Passy, 2002. "Maximizing a Linear Fractional Function on a Pareto Efficient Frontier," Journal of Optimization Theory and Applications, Springer, vol. 113(1), pages 83-103, April.
    8. Nguyen, Duy Van, 2013. "Global maximization of UTA functions in multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 228(2), pages 397-404.
    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.

    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:117:y:1999:i:2:p:239-252. 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: 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.