IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v46y2000i7p1009-1012.html
   My bibliography  Save this article

Bounds on the Opportunity Cost of Neglecting Reoptimization in Mathematical Programming

Author

Listed:
  • Osman Ou{g}uz

    (Department of Industrial Engineering, Bilkent University, 06533 Ankara, Turkey)

Abstract

Postoptimality or sensitivity analysis are well-developed subjects in almost all branches of mathematical programming. In this note, we propose a simple formula which can be used to get preliminary bounds on the value of this type of analysis for a specific class of mathematical programming problems. We also show that our bounds are tight.

Suggested Citation

  • Osman Ou{g}uz, 2000. "Bounds on the Opportunity Cost of Neglecting Reoptimization in Mathematical Programming," Management Science, INFORMS, vol. 46(7), pages 1009-1012, July.
    • Handle: RePEc:inm:ormnsc:v:46:y:2000:i:7:p:1009-1012
    DOI: 10.1287/mnsc.46.7.1009.12041
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.46.7.1009.12041
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.46.7.1009.12041?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
    ---><---

    References listed on IDEAS

    as
    1. Richard E. Wendell, 1985. "The Tolerance Approach to Sensitivity Analysis in Linear Programming," Management Science, INFORMS, vol. 31(5), pages 564-578, May.
    2. P. L. Yuf & M. Zeleny, 1976. "Linear Multiparametric Programming by Multicriteria Simplex Method," Management Science, INFORMS, vol. 23(2), pages 159-170, October.
    Full references (including those not matched with items on IDEAS)

    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. Singh, Sanjeet & Gupta, Pankaj & Bhatia, Davinder, 2005. "Multiparametric sensitivity analysis in programming problem with linear-plus-linear fractional objective function," European Journal of Operational Research, Elsevier, vol. 160(1), pages 232-241, January.
    2. Masahiro Inuiguchi & Zhenzhong Gao & Carla Oliveira Henriques, 2023. "Robust optimality analysis of non-degenerate basic feasible solutions in linear programming problems with fuzzy objective coefficients," Fuzzy Optimization and Decision Making, Springer, vol. 22(1), pages 51-79, March.
    3. Iosif Pappas & Nikolaos A. Diangelakis & Efstratios N. Pistikopoulos, 2021. "The exact solution of multiparametric quadratically constrained quadratic programming problems," Journal of Global Optimization, Springer, vol. 79(1), pages 59-85, January.
    4. Hladík, Milan & Popova, Evgenija D., 2015. "Maximal inner boxes in parametric AE-solution sets with linear shape," Applied Mathematics and Computation, Elsevier, vol. 270(C), pages 606-619.
    5. L Neralić & R E Wendell, 2004. "Sensitivity in data envelopment analysis using an approximate inverse matrix," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(11), pages 1187-1193, November.
    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. Chakravarti, N. & Wagelmans, A.P.M., 1997. "Calculation of Stability Radii for Combinatorial Optimization Problems," Econometric Institute Research Papers EI 9740/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    8. Michael Best & Xili Zhang, 2012. "The Efficient Frontier for Weakly Correlated Assets," Computational Economics, Springer;Society for Computational Economics, vol. 40(4), pages 355-375, December.
    9. Charitopoulos, Vassilis M. & Dua, Vivek, 2017. "A unified framework for model-based multi-objective linear process and energy optimisation under uncertainty," Applied Energy, Elsevier, vol. 186(P3), pages 539-548.
    10. Richard E. Wendell, 2004. "Tolerance Sensitivity and Optimality Bounds in Linear Programming," Management Science, INFORMS, vol. 50(6), pages 797-803, June.
    11. Borgonovo, Emanuele & Plischke, Elmar, 2016. "Sensitivity analysis: A review of recent advances," European Journal of Operational Research, Elsevier, vol. 248(3), pages 869-887.
    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. 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.
    14. Nilotpal Chakravarti & Albert P.M. Wagelmans, 1997. "Calculation of Stability Radii for Combinatorial Optimization Problems," Tinbergen Institute Discussion Papers 97-106/4, Tinbergen Institute.
    15. 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.
    16. Sedeno-Noda, A. & Gonzalez-Martin, C., 2000. "The biobjective minimum cost flow problem," European Journal of Operational Research, Elsevier, vol. 124(3), pages 591-600, August.
    17. Luka Neralić & Richard E. Wendell, 2019. "Sensitivity in DEA: an algorithmic approach," 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. 27(4), pages 1245-1264, December.
    18. Henriques, C.O. & Inuiguchi, M. & Luque, M. & Figueira, J.R., 2020. "New conditions for testing necessarily/possibly efficiency of non-degenerate basic solutions based on the tolerance approach," European Journal of Operational Research, Elsevier, vol. 283(1), pages 341-355.
    19. 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.
    20. Harvey J. Greenberg, 1999. "Matrix Sensitivity Analysis from an Interior Solution of a Linear Program," INFORMS Journal on Computing, INFORMS, vol. 11(3), pages 316-327, August.

    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:inm:ormnsc:v:46:y:2000:i:7:p:1009-1012. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.