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

DOI10.1016/J.ORL.2015.08.010MaRDI QIDQ1785436zbMATH OpenOpenAlexFDO

Authors Jourdain B. Lamperski, Andrew J. Schaefer

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

inverse optimizationmixed-integer programmingsuperadditive dualityvalue functions

Mathematics Subject Classification ID

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

Recommendations

• On the structure of the inverse-feasible region of a linear program
• Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods
• Feasibility in reverse convex mixed-integer programming
• On the complexity of inverse mixed integer linear optimization
• On the lower semicontinuity of the feasible region of nonlinear mixed-integer parametric programming
• Polyhedral approximation in mixed-integer convex optimization
• scientific article; zbMATH DE number 1059237
• Polyhedral approaches to mixed integer linear programming
• Feasible partition problem in reverse convex and convex mixed-integer programming
• Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem

Cites work

• Calculating some inverse linear programming problems
• Cutting plane algorithms for the inverse mixed integer linear programming problem
• Heuristic algorithms for the inverse mixed integer linear programming problem
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse integer programming
• Inverse Optimization
• The value function of a mixed integer program: I
• The value function of an integer program

Cited in

(13)

• Trade-off preservation in inverse multi-objective convex optimization
• Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
• On the structure of the inverse-feasible region of a linear program
• Robust inverse optimization
• Feasibility in reverse convex mixed-integer programming
• Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods
• Objective selection for cancer treatment: an inverse optimization approach
• Quantile inverse optimization: improving stability in inverse linear programming
• Solving stochastic and bilevel mixed-integer programs via a generalized value function
• Evaluating mixed-integer programming models over multiple right-hand sides
• Maximum likelihood probability measures over sets: existence, computation, and convergence
• The inverse optimal value problem for linear fractional programming
• Inverse of the Gomory corner relaxation of integer programs

This page was built for publication: A polyhedral characterization of the inverse-feasible region of a mixed-integer program

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785436)