IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v94y1997i2d10.1023_a1022687729559.html
   My bibliography  Save this article

Efficient Solutions and Bounds on Tradeoffs

Author

Listed:
  • I. Kaliszewski

    (Polish Academy of Sciences)

  • W. Michalowski

    (Carleton University)

Abstract

The modified Tchebycheff method, widely used to generate efficient solutions to a vector optimization problem, provides means to identify properly efficient solutions with a preimposed common bound on all tradeoffs. In this paper, we show how to generate weakly efficient solutions when different bounds are preimposed on the subsets of tradeoffs.

Suggested Citation

  • I. Kaliszewski & W. Michalowski, 1997. "Efficient Solutions and Bounds on Tradeoffs," Journal of Optimization Theory and Applications, Springer, vol. 94(2), pages 381-394, August.
    • Handle: RePEc:spr:joptap:v:94:y:1997:i:2:d:10.1023_a:1022687729559
    DOI: 10.1023/A:1022687729559
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1022687729559
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1022687729559?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. Kaliszewski, Ignacy, 1995. "A theorem on nonconvex functions and its application to vector optimization," European Journal of Operational Research, Elsevier, vol. 80(2), pages 439-445, January.
    2. E. U. Choo & D. R. Atkins, 1983. "Proper Efficiency in Nonconvex Multicriteria Programming," Mathematics of Operations Research, INFORMS, vol. 8(3), pages 467-470, August.
    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. Kaliszewski, Ignacy, 2003. "Dynamic parametric bounds on efficient outcomes in interactive multiple criteria decision making problems," European Journal of Operational Research, Elsevier, vol. 147(1), pages 94-107, May.
    2. Kazhal Khaledian & Esmaile Khorram & Majid Soleimani-damaneh, 2016. "Strongly Proper Efficient Solutions: Efficient Solutions with Bounded Trade-Offs," Journal of Optimization Theory and Applications, Springer, vol. 168(3), pages 864-883, March.
    3. Fereshteh Akbari & Mehrdad Ghaznavi & Esmaile Khorram, 2018. "A Revised Pascoletti–Serafini Scalarization Method for Multiobjective Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 178(2), pages 560-590, August.
    4. Hunt, Brian J. & Wiecek, Margaret M. & Hughes, Colleen S., 2010. "Relative importance of criteria in multiobjective programming: A cone-based approach," European Journal of Operational Research, Elsevier, vol. 207(2), pages 936-945, 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. Alexander Engau, 2017. "Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 119-134, January.
    3. Kopsidas, Gerassimos C., 1995. "Multiobjective optimization of table olive preparation systems," European Journal of Operational Research, Elsevier, vol. 85(2), pages 383-398, September.
    4. Alexander Engau, 2015. "Definition and Characterization of Geoffrion Proper Efficiency for Real Vector Optimization with Infinitely Many Criteria," Journal of Optimization Theory and Applications, Springer, vol. 165(2), pages 439-457, May.

    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:joptap:v:94:y:1997:i:2:d:10.1023_a:1022687729559. 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.