Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 71, 2022 - Issue 10
105
Views
0
CrossRef citations to date
0
Altmetric
Research Article

Multiple cost coefficients sensitivity theorems of integer linear optimization

ORCID Icon &
Pages 2907-2933 | Received 18 Jun 2019, Accepted 15 Feb 2021, Published online: 07 Mar 2021

References

  • Jensen RE. Sensitivity analysis and integer linear programming. Account Rev. 1968;43(3):425–446.
  • Shapiro JF. Sensitivity analysis in integer programming. Ann Discr Math. 1977;1:467–477.
  • Bell DE, Shapiro JF. A finitely convergent duality theory for zero-one integer programming. IIASA Research Memorandum, IIASA, Laxenburg, Austria, RM-75-33; 1975.
  • Bell DE, Shapiro JF. A convergent duality theory for integer programming. Oper Res. 1977;25:419–434.
  • Richard JPP, Dey SS. The group-theoretic approach in mixed integer optimization. In: Junger M, Liebling TM, Naddef D, et al., editors. 50 years of integer programming 1958–2008. Berlin, Heidelberg: Springer; 2010. p. 727–801.
  • Shapiro JF. Mathematical programming: structures and algorithms. New York: John Wiley and Sons; 1979.
  • Thomas RR. The structure of group relaxations. In Handbooks in operations research and management science. Vol. 12, 2005; p. 123–170.
  • Vanderbeck F, Wolsey LA. Reformulation and Decomposition of Integer Programs. In: Junger M, Liebling TM, Naddef D, et al., editors. 50 years of integer programming 1958–2008. Berlin, Germany: Springer-Verlag; 2010. p. 431–502.
  • Bowman VJ Jr. Sensitivity analysis in linear integer programming. AIIE Trans. 1972;4:284–289.
  • Cook W, Gerards AMH, Schrijver A, et al. Sensitivity theorems in integer linear programming. Math Program. 1986;34:251–264.
  • Dawande MW, Hooker JN. Inference-based sensitivity analysis for mixed integer/linear programming. Oper Res. 2000;48:623–634.
  • Geoffrion AM, Nauss R. Exceptional paper-Parametric and postoptimality analysis in integer linear programming. Manage Sci. 1977;23:453–466.
  • Güzelsoy M, Ralphs TK. Integer optimization duality. In: Cochran JJ, Cox LA, Keskinocak P, et al., editors. Encyclopedia of operations research and management science. Hoboken, New Jersey: Wiley; 2010.
  • Holm S, Klein D. Three methods for postoptimal integer linear programming. In: Fiacco AV, editor. Sensitivity, stability and parametric analysis. Berlin, Heidelberg: Springer; 1984. (Mathematical Programming Study; 21). p. 97–109.
  • Kohler J. Sensitivity analysis in integer linear programming: the right-hand side case. Discussion Paper, Fachbereich Mathematik und Informatik, Universität Halle-Wittenberg; 1996.
  • Radke MA. Sensitivity analysis in discrete optimization [Dissertation]. LA: Western Management Science Institute, University of California; 1975. Avaialble as Working Paper No. 240.
  • Wolsey LA. Integer optimization duality: price functions and sensitivity analysis. Math Program. 1981;20:173–195.
  • Li D, Sun XL. Towards strong duality in integer programming. J Glob Optim. 2006;35:255–282.
  • Boland NL, Eberhard AC. On the augmented Lagrangian dual for integer programming. Math Program Ser A. 2015;150:491–509.
  • Xu Y. Asymptotic strong determination in integer programming: quasi dual method. Math Methods Oper Res. 2003;57:207–216.
  • Schrage L, Wolsey L. Sensitivity analysis for branch and bound integer programming. Oper Res. 1985;33:1008–1023.
  • Skorin-Napov J, Granot F. Non-linear integer programming: sensitivity analysis for branch and bound. Oper Res Lett. 1987;6:269–274.
  • Chen DS, Batson RG, Dang Y. Applied integer programming: modeling and solution. hoboken. New Jersey: Wiley; 2010.
  • Conforti M, Cornuejols G, Zambelli G. Integer programming. Heidelberg: Springer; 2014.
  • Garfinkel RS, Nemhauser GL. Integer programming. New York: Wiley Interscience; 1972.
  • Korte B, Vygen J. Combinatorial optimization: theory and algorithms. 5th ed. Berlin: Springer-Verlag; 2012.
  • Nemhauser GL, Wolsey LA. Integer and combinatorial optimization. New York: John Wiley and Sons; 1998.
  • Papadimitriou CH, Steiglitz K. Combinatorial optimization: algorithms and complexity. New York: Dover Publications Incorporation; 1988.
  • Walukiewicz S. Integer programming. Dordrecht: Springer Science+Business Media; 1991.
  • Wallace SW. Decision making under uncertainty: is sensitivity analysis of any use? Oper Res. 2000;48:20–25.
  • Bradley SP, Hax AC, Magnanti TL. Applied mathematical programming. Reading, Mass: Addison-Wesley; 1977.
  • Freund RM. Postoptimal analysis of a linear program under simultaneous changes in matrix coefficients. In: Cottle RW editor. Mathematical optimization essays in honor of George B. Dantzig part I. Berlin, Heidelberg: Springer; 1985. (Mathematical programming studies; 24). p. 1–13.
  • Wang HF, Huang CS. Multi-parametric analysis of the maximum tolerance in a linear programming problem. Eur J Oper Res. 1993;67:75–87.
  • Wendell RE. Tolerance sensitivity and optimality bounds in linear programming. Manage Sci. 2004;50:797–803.
  • Xu G, Burer S. Robust sensitivity analysis of the optimal value of linear programming. Optim Methods Softw. 2017;32:1187–1205.
  • Charitopoulos VM, Papageorgiou LG, Dua V. Multi-parametric mixed integer linear programming under global uncertainty. Comput Chem Eng. 2018;116:279–295.
  • Dua V, Papalexandri KP, Pistikopoulos EN. Global optimization issues in multiparametric continuous and mixed-integer optimization problems. J Glob Optim. 2004;30:59–89.
  • Dua V, Pistikopoulos EN. An algorithm for the solution of multiparametric mixed integer linear programming problems. Ann Oper Res. 2000;99:123–139.
  • Faigle U, Kern W, Still G. Algorithmic principles of mathematical programming. Dordrecht: Springer Science+Business Media; 2002.
  • Berkhemer OA, Fransen PS, Beumer D, et al. A randomized trial of intraarterial treatment for acute ischemic stroke. N Engl J Med. 2015;372:11–20.
  • Campbell BC, Mitchell PJ, Kleinig TJ, et al. Endovascular therapy for ischemic stroke with perfusion-imaging selection. New England J Med. 2015;372:1009–1018.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.