Quantile inverse optimization: improving stability in inverse linear programming
From MaRDI portal
Abstract: Inverse linear programming (LP) has received increasing attention due to its potential to generate efficient optimization formulations that can closely replicate the behavior of a complex system. However, inversely inferred parameters and corresponding forward solutions from the existing inverse LP method can be highly sensitive to noise, errors, and uncertainty in the input data, limiting its applicability in data-driven settings. We introduce the notion of inverse and forward stability in inverse LP and propose a novel inverse LP method that determines a set of objective functions that are stable under data imperfection and generate solutions close to the relevant subset of the data. We formulate the inverse model as a mixed-integer program and elucidate its connection to bi-clique problems, which we exploit to develop efficient heuristics. We also show how this method can be used for online learning. We numerically evaluate the stability of the proposed method and demonstrate its practical use in the diet recommendation and transshipment applications.
Recommendations
Cites work
- A note on a maximum \(k\)-subset intersection problem
- A polyhedral characterization of the inverse-feasible region of a mixed-integer program
- Cutting plane algorithms for the inverse mixed integer linear programming problem
- Data-driven estimation in equilibrium using inverse optimization
- Data-driven incentive design in the medicare shared savings program
- Data-driven inverse optimization with imperfect information
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Generalized inverse multiobjective optimization with application to cancer therapy
- High breakdown-point and high efficiency robust estimates for regression
- High-breakdown robust multivariate methods
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse conic programming with applications
- Inverse integer programming
- Inverse Optimization
- Inverse optimization for multi-objective linear programming
- Inverse optimization for the recovery of market structure from market outcomes: an application to the MISO electricity market
- Inverse optimization in countably infinite linear programs
- Inverse optimization with noisy data
- Inverse optimization: a new perspective on the Black-Litterman model
- Least Median of Squares Regression
- Least quantile regression via modern optimization
- Linear programming system identification: the general nonnegative parameters case
- On bipartite and multipartite clique problems
- On the structure of the inverse-feasible region of a linear program
- Robust inverse optimization
- Trade-off preservation in inverse multi-objective convex optimization
- Uniqueness of solution in linear programming
Cited in
(8)- Inferring linear feasible regions using inverse optimization
- Robust inverse optimization
- scientific article; zbMATH DE number 2030326 (Why is no real title available?)
- Inverse optimization with noisy data
- Decomposition and Adaptive Sampling for Data-Driven Inverse Linear Optimization
- Inverse attribute‐based optimization with an application in assortment optimization
- The inverse optimal value problem for linear fractional programming
- On contextual inverse multiobjective problems
This page was built for publication: Quantile inverse optimization: improving stability in inverse linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5106382)
