A polyhedral characterization of the inverse-feasible region of a mixed-integer program
type: Item
instance of: scholarly article
title: A polyhedral characterization of the inverse-feasible region of a mixed-integer program
zbMATH Open document ID: 1408.90328
author: Jourdain B. Lamperski
author: Andrew J. Schaefer
published in: Operations Research Letters
publication date: 2018-09-28T00:00:00Z
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6945414
zbMATH Keywords: inverse optimization
zbMATH Keywords: mixed-integer programming
zbMATH Keywords: superadditive duality
zbMATH Keywords: value functions
MaRDI profile type: Publication
full work available at URL: j.orl.2015.08.010
OpenAlex ID: W2206092630
cites work: Inverse Optimization
cites work: The value function of a mixed integer program: I
cites work: The value function of an integer program
cites work: Inverse combinatorial optimization: a survey on problems, methods, and results
cites work: Q4040221
cites work: Inverse integer programming
cites work: Cutting plane algorithms for the inverse mixed integer linear programming problem
cites work: Heuristic algorithms for the inverse mixed integer linear programming problem
cites work: Calculating some inverse linear programming problems
DOI: 10.1016/J.ORL.2015.08.010
Recommended article: On the structure of the inverse-feasible region of a linear program
Recommended article: Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods
Recommended article: Feasibility in reverse convex mixed-integer programming
Recommended article: On the Complexity of Inverse Mixed Integer Linear Optimization
Recommended article: On the lower semicontinuity of the feasible region of nonlinear mixed-integer parametric programming
Recommended article: Polyhedral approximation in mixed-integer convex optimization
Recommended article: Q4353551
Recommended article: Polyhedral Approaches to Mixed Integer Linear Programming
Recommended article: Feasible partition problem in reverse convex and convex mixed-integer programming
Recommended article: Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
description: scientific article; zbMATH DE number 6945414