IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v181y2010i1p219-23210.1007-s10479-010-0728-8.html
   My bibliography  Save this article

Standard sensitivity analysis and additive tolerance approach in MOLP

Author

Listed:
  • Sebastian Sitarz

Abstract

We consider sensitivity analysis of the objective function coefficients in multiple objective linear programming (MOLP). We focus on the properties of the parameters set for which a given extreme solution is efficient. Moreover, we compare two approaches: the standard sensitivity analysis (changing only one coefficient) and the additive tolerance approach (changing all coefficients). We find the connections between these two approaches by giving a theorem describing the upper bound on the maximal additive tolerance. Copyright Springer Science+Business Media, LLC 2010

Suggested Citation

  • Sebastian Sitarz, 2010. "Standard sensitivity analysis and additive tolerance approach in MOLP," Annals of Operations Research, Springer, vol. 181(1), pages 219-232, December.
    • Handle: RePEc:spr:annopr:v:181:y:2010:i:1:p:219-232:10.1007/s10479-010-0728-8
    DOI: 10.1007/s10479-010-0728-8
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-010-0728-8
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-010-0728-8?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. 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.
    2. Sitarz, Sebastian, 2008. "Postoptimal analysis in multicriteria linear programming," European Journal of Operational Research, Elsevier, vol. 191(1), pages 7-18, November.
    3. Benson, Harold P. & Sun, Erjiang, 2002. "A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program," European Journal of Operational Research, Elsevier, vol. 139(1), pages 26-41, May.
    4. 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.
    5. Oliveira, Carla & Antunes, Carlos Henggeler, 2007. "Multiple objective linear programming models with interval coefficients - an illustrated overview," European Journal of Operational Research, Elsevier, vol. 181(3), pages 1434-1463, September.
    6. Gal, Tomas & Wolf, Karin, 1986. "Stability in vector maximization--A survey," European Journal of Operational Research, Elsevier, vol. 25(2), pages 169-182, 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.

    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. 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.
    2. Dranichak, Garrett M. & Wiecek, Margaret M., 2019. "On highly robust efficient solutions to uncertain multiobjective linear programs," European Journal of Operational Research, Elsevier, vol. 273(1), pages 20-30.
    3. Zhou, Feng & Huang, Gordon H. & Chen, Guo-Xian & Guo, Huai-Cheng, 2009. "Enhanced-interval linear programming," European Journal of Operational Research, Elsevier, vol. 199(2), pages 323-333, December.
    4. Goberna, M.A. & Jeyakumar, V. & Li, G. & Vicente-Pérez, J., 2018. "Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs," European Journal of Operational Research, Elsevier, vol. 270(1), pages 40-50.
    5. 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.
    6. Alves, Maria João & Costa, João Paulo, 2016. "Graphical exploration of the weight space in three-objective mixed integer linear programs," European Journal of Operational Research, Elsevier, vol. 248(1), pages 72-83.
    7. Anthony Przybylski & Xavier Gandibleux & Matthias Ehrgott, 2010. "A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme," INFORMS Journal on Computing, INFORMS, vol. 22(3), pages 371-386, August.
    8. Wu, Hsien-Chung, 2009. "The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions," European Journal of Operational Research, Elsevier, vol. 196(1), pages 49-60, July.
    9. S. Rivaz & M. Yaghoobi, 2013. "Minimax regret solution to multiobjective linear programming problems with interval objective functions coefficients," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(3), pages 625-649, September.
    10. Engau, Alexander & Sigler, Devon, 2020. "Pareto solutions in multicriteria optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 281(2), pages 357-368.
    11. María Luisa Nolé & David Soler & Juan Luis Higuera-Trujillo & Carmen Llinares, 2022. "Optimization of the Cognitive Processes in a Virtual Classroom: A Multi-objective Integer Linear Programming Approach," Mathematics, MDPI, vol. 10(7), pages 1-20, April.
    12. 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.
    13. S. Rivaz & M. A. Yaghoobi & M. Hladík, 2016. "Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem," Fuzzy Optimization and Decision Making, Springer, vol. 15(3), pages 237-253, September.
    14. P. Kumar & A. K. Bhurjee, 2022. "Multi-objective enhanced interval optimization problem," Annals of Operations Research, Springer, vol. 311(2), pages 1035-1050, April.
    15. 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.
    16. Carla Oliveira Henriques & Maria Elisabete Neves & Licínio Castelão & Duc Khuong Nguyen, 2022. "Assessing the performance of exchange traded funds in the energy sector: a hybrid DEA multiobjective linear programming approach," Annals of Operations Research, Springer, vol. 313(1), pages 341-366, June.
    17. Amin Mahmoudi & Saad Ahmed Javed & Abbas Mardani, 2022. "Gresilient supplier selection through Fuzzy Ordinal Priority Approach: decision-making in post-COVID era," Operations Management Research, Springer, vol. 15(1), pages 208-232, June.
    18. 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.
    19. Carla Oliveira Henriques & Dulce Helena Coelho & Maria Elisabete Duarte Neves, 2022. "Investment planning in energy efficiency programs: a portfolio based approach," Operational Research, Springer, vol. 22(1), pages 615-649, March.
    20. Britta Schulze & Kathrin Klamroth & Michael Stiglmayr, 2019. "Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions," Journal of Global Optimization, Springer, vol. 74(3), pages 495-522, July.

    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:annopr:v:181:y:2010:i:1:p:219-232:10.1007/s10479-010-0728-8. 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.