IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v33y1985i5p1008-1023.html
   My bibliography  Save this article

Sensitivity Analysis for Branch and Bound Integer Programming

Author

Listed:
  • Linus Schrage

    (University of Chicago, Chicago, Illinois)

  • Laurence Wolsey

    (CORE, Louvain-la-Neuve, Belgium)

Abstract

After an integer program is solved, we may be interested in the effect of small changes in the right-hand side or objective function coefficients. Without modifying the underlying branch and bound or cutting plane algorithm, we show what additional data to collect during the solution of the original integer program to give useful bounds on the solution of the modified problem.

Suggested Citation

  • Linus Schrage & Laurence Wolsey, 1985. "Sensitivity Analysis for Branch and Bound Integer Programming," Operations Research, INFORMS, vol. 33(5), pages 1008-1023, October.
  • Handle: RePEc:inm:oropre:v:33:y:1985:i:5:p:1008-1023
    DOI: 10.1287/opre.33.5.1008
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.33.5.1008
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.33.5.1008?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
    ---><---

    Citations

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


    Cited by:

    1. M. W. Dawande & J. N. Hooker, 2000. "Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming," Operations Research, INFORMS, vol. 48(4), pages 623-634, August.
    2. Onur Tavaslıoğlu & Oleg A. Prokopyev & Andrew J. Schaefer, 2019. "Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function," Operations Research, INFORMS, vol. 67(6), pages 1659-1677, November.
    3. Amini, Mohammad M. & Racer, Michael & Ghandforoush, Parviz, 1998. "Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study," European Journal of Operational Research, Elsevier, vol. 108(3), pages 604-617, August.
    4. Babacar Thiongane & Anass Nagih & Gérard Plateau, 2005. "An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual," Annals of Operations Research, Springer, vol. 139(1), pages 353-373, October.
    5. Crema, Alejandro, 1999. "An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem," European Journal of Operational Research, Elsevier, vol. 114(3), pages 569-579, May.

    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:oropre:v:33:y:1985:i:5:p:1008-1023. 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: 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.