IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v28y2011i04ns0217595911003181.html
   My bibliography  Save this article

Sensitivity Analysis Of Weak Efficiency In Multiple Objective Linear Programming

Author

Listed:
  • SEBASTIAN SITARZ

    (Institute of Mathematics, University of Silesia, ul. Bankowa 14, 40-007 Katowice, Poland)

Abstract

This paper, studies the sensitivity analysis of weakly efficient extreme solutions in multiple objective linear programming (MOLP). The aim of the paper is to compute the set of the parameters (corresponding to one coefficient) for which a given extreme point is a weakly efficient solution. We also focus on the properties of the parameters set by proving convexity and closeness of this set. Moreover, we compare the results of the sensitivity analysis of efficiency and of weak efficiency in MOLP.

Suggested Citation

  • Sebastian Sitarz, 2011. "Sensitivity Analysis Of Weak Efficiency In Multiple Objective Linear Programming," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 28(04), pages 445-455.
    • Handle: RePEc:wsi:apjorx:v:28:y:2011:i:04:n:s0217595911003181
    DOI: 10.1142/S0217595911003181
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595911003181
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595911003181?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.

    Citations

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


    Cited by:

    1. Georgiev, Pando Gr. & Luc, Dinh The & Pardalos, Panos M., 2013. "Robust aspects of solutions in deterministic multiple objective linear programming," European Journal of Operational Research, Elsevier, vol. 229(1), pages 29-36.
    2. Hladík, Milan & Sitarz, Sebastian, 2013. "Maximal and supremal tolerances in multiobjective linear programming," European Journal of Operational Research, Elsevier, vol. 228(1), pages 93-101.

    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:wsi:apjorx:v:28:y:2011:i:04:n:s0217595911003181. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.