A polyhedral characterization of the inverse-feasible region of a mixed-integer program

DOI10.1016/j.orl.2015.08.010zbMath1408.90328OpenAlexW2206092630MaRDI QIDQ1785436

Andrew J. Schaefer, Jourdain B. Lamperski

Publication date: 28 September 2018

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

Full work available at URL: https://doi.org/10.1016/j.orl.2015.08.010

zbMATH Keywords

value functionsmixed-integer programmingsuperadditive dualityinverse optimization

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods ⋮ Objective Selection for Cancer Treatment: An Inverse Optimization Approach ⋮ On the structure of the inverse-feasible region of a linear program ⋮ Robust inverse optimization ⋮ Evaluating mixed-integer programming models over multiple right-hand sides ⋮ Quantile Inverse Optimization: Improving Stability in Inverse Linear Programming ⋮ Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function ⋮ Trade-off preservation in inverse multi-objective convex optimization

Cites Work

• Unnamed Item
• Heuristic algorithms for the inverse mixed integer linear programming problem
• Inverse integer programming
• Cutting plane algorithms for the inverse mixed integer linear programming problem
• The value function of a mixed integer program: I
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Calculating some inverse linear programming problems
• Inverse Optimization
• The value function of an integer program