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

Postoptimal analysis in multicriteria linear programming

Author

Listed:
  • Sitarz, Sebastian

Abstract

The aim of the paper is to present the postoptimal analysis of a chosen extreme efficient point in multicriteria linear programming. There are three cases considered: one objective function coefficient change, objective function addition and objective function removal. The proven theorems allow us to create methods based on the analysis of a simplex tableau.

Suggested Citation

  • Sitarz, Sebastian, 2008. "Postoptimal analysis in multicriteria linear programming," European Journal of Operational Research, Elsevier, vol. 191(1), pages 7-18, November.
    • Handle: RePEc:eee:ejores:v:191:y:2008:i:1:p:7-18
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00905-8
    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. Hansen, Pierre & Labbe, Martine & Wendell, Richard E., 1989. "Sensitivity analysis in multiple objective linear programming: The tolerance approach," European Journal of Operational Research, Elsevier, vol. 38(1), pages 63-69, January.
    2. Gal, Tomas & Leberling, Heiner, 1977. "Redundant objective functions in linear vector maximum problems and their determination," European Journal of Operational Research, Elsevier, vol. 1(3), pages 176-184, May.
    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. 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. Sebastian Sitarz, 2013. "Compromise programming with Tchebycheff norm for discrete stochastic orders," Annals of Operations Research, Springer, vol. 211(1), pages 433-446, December.
    3. 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.
    4. Sebastian Sitarz, 2010. "Standard sensitivity analysis and additive tolerance approach in MOLP," Annals of Operations Research, Springer, vol. 181(1), pages 219-232, December.
    5. Goberna, M.A. & Jeyakumar, V. & Li, G. & Vicente-Pérez, J., 2015. "Robust solutions to multi-objective linear programs with uncertain data," European Journal of Operational Research, Elsevier, vol. 242(3), pages 730-743.

    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. A. B. Malinowska & D. F. M. Torres, 2008. "Computational Approach to Essential and Nonessential Objective Functions in Linear Multicriteria Optimization," Journal of Optimization Theory and Applications, Springer, vol. 139(3), pages 577-590, December.
    2. Gal, Tomas & Hanne, Thomas, 2006. "Nonessential objectives within network approaches for MCDM," European Journal of Operational Research, Elsevier, vol. 168(2), pages 584-592, January.
    3. Alzorba, Shaghaf & Günther, Christian & Popovici, Nicolae & Tammer, Christiane, 2017. "A new algorithm for solving planar multiobjective location problems involving the Manhattan norm," European Journal of Operational Research, Elsevier, vol. 258(1), pages 35-46.
    4. Lindroth, Peter & Patriksson, Michael & Strömberg, Ann-Brith, 2010. "Approximating the Pareto optimal set using a reduced set of objective functions," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1519-1534, December.
    5. Charles, V. & Udhayakumar, A. & Rhymend Uthariaraj, V., 2010. "An approach to find redundant objective function(s) and redundant constraint(s) in multi-objective nonlinear stochastic fractional programming problems," European Journal of Operational Research, Elsevier, vol. 201(2), pages 390-398, March.
    6. F. García & M. A. Melguizo Padial, 2015. "Sensitivity Analysis in Convex Optimization through the Circatangent Derivative," Journal of Optimization Theory and Applications, Springer, vol. 165(2), pages 420-438, May.
    7. Marmol, A. M. & Puerto, J., 1997. "Special cases of the tolerance approach in multiobjective linear programming," European Journal of Operational Research, Elsevier, vol. 98(3), pages 610-616, May.
    8. Pereira Borges, Ana Rosa & Henggeler Antunes, Carlos, 2002. "A visual interactive tolerance approach to sensitivity analysis in MOLP," European Journal of Operational Research, Elsevier, vol. 142(2), pages 357-381, October.
    9. Hinojosa, M.A. & Mármol, A.M., 2011. "Axial solutions for multiple objective linear problems. An application to target setting in DEA models with preferences," Omega, Elsevier, vol. 39(2), pages 159-167, April.
    10. Stephan Dempe & Gabriele Eichfelder & Jörg Fliege, 2015. "On the effects of combining objectives in multi-objective optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(1), pages 1-18, August.
    11. 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.
    12. Alexander Engau & Margaret M. Wiecek, 2008. "Interactive Coordination of Objective Decompositions in Multiobjective Programming," Management Science, INFORMS, vol. 54(7), pages 1350-1363, July.
    13. Chassein, André & Goerigk, Marc & Kasperski, Adam & Zieliński, Paweł, 2020. "Approximating combinatorial optimization problems with the ordered weighted averaging criterion," European Journal of Operational Research, Elsevier, vol. 286(3), pages 828-838.
    14. Gal, Tomas & Hanne, Thomas, 1999. "Consequences of dropping nonessential objectives for the application of MCDM methods," European Journal of Operational Research, Elsevier, vol. 119(2), pages 373-378, December.
    15. M. A. Hinojosa & A. M. Mármol, 2011. "Egalitarianism and Utilitarianism in Multiple Criteria Decision Problems with Partial Information," Group Decision and Negotiation, Springer, vol. 20(6), pages 707-724, November.
    16. Agrell, Per J., 1997. "On redundancy in multi criteria decision making," European Journal of Operational Research, Elsevier, vol. 98(3), pages 571-586, May.
    17. Vetschera, Rudolf, 1996. "A recursive algorithm for volume-based sensitivity analysis of linear decision models," Discussion Papers, Series I 279, University of Konstanz, Department of Economics.
    18. Sebastian Sitarz, 2010. "Standard sensitivity analysis and additive tolerance approach in MOLP," Annals of Operations Research, Springer, vol. 181(1), pages 219-232, December.

    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:191:y:2008:i:1:p:7-18. 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.