IDEAS home Printed from https://ideas.repec.org/p/tin/wpaper/19970106.html
   My bibliography  Save this paper

Calculation of Stability Radii for Combinatorial Optimization Problems

Author

Listed:
  • Nilotpal Chakravarti

    (Indian Institute of Management)

  • Albert P.M. Wagelmans

    (Erasmus University Rotterdam)

Abstract

We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min-sum or min-max objective function. Our algorithms run in polynomial time if the optimization problem itself is polynomially solvable. We also extend our results tothe tolerance approach to sensitivity analysis.

Suggested Citation

  • Nilotpal Chakravarti & Albert P.M. Wagelmans, 1997. "Calculation of Stability Radii for Combinatorial Optimization Problems," Tinbergen Institute Discussion Papers 97-106/4, Tinbergen Institute.
    • Handle: RePEc:tin:wpaper:19970106
    as

    Download full text from publisher

    File URL: https://papers.tinbergen.nl/97106.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Sotskov, Y.N. & Wagelmans, A.P.M. & Werner, F., 1997. "On the Calculation of the Stability Radius of an Optimal or an Approximate Schedule," Econometric Institute Research Papers EI 9718/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    2. Richard E. Wendell, 1985. "The Tolerance Approach to Sensitivity Analysis in Linear Programming," Management Science, INFORMS, vol. 31(5), pages 564-578, May.
    3. Nimrod Megiddo, 1979. "Combinatorial Optimization with Rational Objective Functions," Mathematics of Operations Research, INFORMS, vol. 4(4), pages 414-424, November.
    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. 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.
    2. Steffen Rebennack & Ashwin Arulselvan & Lily Elefteriadou & Panos M. Pardalos, 2010. "Complexity analysis for maximum flow problems with arc reversals," Journal of Combinatorial Optimization, Springer, vol. 19(2), pages 200-216, February.
    3. Bart Smeulders & Laurens Cherchye & Bram De Rock & Frits C. R. Spieksma, 2013. "The Money Pump as a Measure of Revealed Preference Violations: A Comment," Journal of Political Economy, University of Chicago Press, vol. 121(6), pages 1248-1258.
    4. Hassin, Refael & Sarid, Anna, 2018. "Operations research applications of dichotomous search," European Journal of Operational Research, Elsevier, vol. 265(3), pages 795-812.
    5. 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.
    6. Pursals, Salvador Casadesús & Garzón, Federico Garriga, 2009. "Optimal building evacuation time considering evacuation routes," European Journal of Operational Research, Elsevier, vol. 192(2), pages 692-699, January.
    7. 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.
    8. Michael Holzhauser & Sven O. Krumke & Clemens Thielen, 2016. "Budget-constrained minimum cost flows," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1720-1745, May.
    9. Jianzhong Zhang & Zhenhong Liu, 2002. "A General Model of Some Inverse Combinatorial Optimization Problems and Its Solution Method Under l ∞ Norm," Journal of Combinatorial Optimization, Springer, vol. 6(2), pages 207-227, June.
    10. Evgeny Gurevsky & Sergey Kovalev & Mikhail Y. Kovalyov, 2021. "Min-max controllable risk problems," 4OR, Springer, vol. 19(1), pages 93-101, March.
    11. Sergio Cabello, 2023. "Faster distance-based representative skyline and k-center along pareto front in the plane," Journal of Global Optimization, Springer, vol. 86(2), pages 441-466, June.
    12. Andrés Gómez & Oleg A. Prokopyev, 2021. "A Mixed-Integer Fractional Optimization Approach to Best Subset Selection," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 551-565, May.
    13. Akiyoshi Shioura, 2015. "Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints," Mathematics of Operations Research, INFORMS, vol. 40(1), pages 192-225, February.
    14. 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.
    15. 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.
    16. Danny Z. Chen & Ovidiu Daescu & Yang Dai & Naoki Katoh & Xiaodong Wu & Jinhui Xu, 2005. "Efficient Algorithms and Implementations for Optimizing the Sum of Linear Fractional Functions, with Applications," Journal of Combinatorial Optimization, Springer, vol. 9(1), pages 69-90, February.
    17. Hong Zheng & Yi-Chang Chiu & Pitu B. Mirchandani, 2015. "On the System Optimum Dynamic Traffic Assignment and Earliest Arrival Flow Problems," Transportation Science, INFORMS, vol. 49(1), pages 13-27, February.
    18. Johannes O. Royset & R. Kevin Wood, 2007. "Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem," INFORMS Journal on Computing, INFORMS, vol. 19(2), pages 175-184, May.
    19. Biró, Péter & Kern, Walter & Paulusma, Daniël & Wojuteczky, Péter, 2018. "The stable fixtures problem with payments," Games and Economic Behavior, Elsevier, vol. 108(C), pages 245-268.
    20. 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.

    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:tin:wpaper:19970106. 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: Tinbergen Office +31 (0)10-4088900 (email available below). General contact details of provider: https://edirc.repec.org/data/tinbenl.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.