Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming

DOI10.1287/opre.48.4.623.12420zbMath1106.90377OpenAlexW2127222442MaRDI QIDQ4530656

John N. Hooker, Milind W. Dawande

Publication date: 4 June 2002

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/195b931c2d3ff5f6700adc6aed358aa952a570d3

Mathematics Subject Classification ID

Mixed integer programming (90C11) Sensitivity, stability, parametric optimization (90C31)

Related Items

Multiple cost coefficients sensitivity theorems of integer linear optimization, Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs, Benders' cuts guided large neighborhood search for the traveling umpire problem, Compact representation of near-optimal integer programming solutions, Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function, Optimization Bounds from the Branching Dual, Scheduling a two-stage flowshop under makespan constraint, Superadditive characterizations of pure integer programming feasibility, Challenges in Enterprise Wide Optimization for the Process Industries