Calculating some inverse linear programming problems
From MaRDI portal
For the general linear programming problem \[ \min \{cx/Ax = b,\;x \geq 0\} \] the inverse problem is expressed as \[ \min \bigl\{ |c-\widetilde c|/ \widetilde c\in F(x^0) \bigr\} \] where \(c,x \in \mathbb{R}^n\), \(b \in \mathbb{R}^m\), \(A\) is an \(m \times n\) matrix, \(x^0\) is a feasible solution, \[ F(x^0) = \bigl\{\widetilde c \in \mathbb{R}^n/ \min \{\widetilde cx/Ax=b,\;x\geq 0\} = \widetilde cx^0 \bigr\} \] and \(|\dots|\) is the \(l_1\) norm. A method for solving this inverse problem is suggested which is based on the optimality conditions for linear programming problems. For the application of the given method to inverse minimum cost flow or assignment problems is found that this method yields strongly polynomial algorithms.
Recommendations
Cites work
- A column generation method for inverse shortest path problems
- An inverse problem of the weighted shortest path problem
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 949659 (Why is no real title available?)
- Network flows. Theory, algorithms, and applications.
- On an instance of the inverse shortest paths problem
Cited in
(75)- Inverse optimization for linearly constrained convex separable programming problems
- Note on inverse problem with l_ objective function
- Inverse problem of minimum cuts
- A further study on inverse linear programming problems
- Inverse problems of submodular functions on digraphs
- Some reverse location problems
- The inverse problem for standard linear programming problems
- On inverse linear programming problems under the bottleneck-type weighted Hamming distance
- The inverse optimal value problem
- Inverse conic programming with applications
- A polyhedral characterization of the inverse-feasible region of a mixed-integer program
- On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching
- Two general methods for inverse optimization problems
- Input estimation and identification of extra inputs in inverse DEA models
- An inverse DEA model for inputs/outputs estimate
- Inverse semidefinite quadratic programming problem with \(l_1\) norm measure
- Inferring linear feasible regions using inverse optimization
- Weak optimal inverse problems of interval linear programming based on KKT conditions
- General restricted inverse assignment problems under \(l_1\) and \(l_{\infty}\) norms
- Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted l_ norm
- Computation of inverse 1-center location problem on the weighted trapezoid graphs
- An inverse optimization approach for a capacitated vehicle routing problem
- Inverse quadratic programming problem with \(l_1\) norm measure
- Inverse problems of linear programming as simulation tooling
- Capacity inverse minimum cost flow problem
- Inverse generalized minimum cost flow problem under the Hamming distances
- On an inverse linear programming problem
- Inverse optimization for multi-objective linear programming
- On the structure of the inverse-feasible region of a linear program
- A majorized penalty approach to inverse linear second order cone programming problems
- A generalized DEA model for inputs/outputs estimation
- An alternating direction method for solving a class of inverse semi-definite quadratic programming problems
- Partial inverse assignment problems under \(l_{1}\) norm
- Predictor-correct interior point method for solving the inverse general linear programming problem
- An interior-point algorithm for solving inverse linear optimization problem
- Generalized inverse multiobjective optimization with application to cancer therapy
- Capacity inverse minimum cost flow problems under the weighted Hamming distance
- Inverse Optimization
- Some inverse optimization problems on network
- An algorithm for inverse minimum spanning tree problem
- scientific article; zbMATH DE number 1559133 (Why is no real title available?)
- The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones
- scientific article; zbMATH DE number 1910363 (Why is no real title available?)
- A new product form of the inverse
- Inverse linear programming with interval coefficients
- Inverse optimization with noisy data
- Algorithms for inverse optimization problems
- Optimal algorithms for inverse eccentric vertex location problem on extended star networks
- Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods
- Objective selection for cancer treatment: an inverse optimization approach
- Inverse optimal transport
- A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems
- A perturbation approach for a type of inverse linear programming problems
- Inverse linear programming
- Inverse problems and solution methods for a class of nonlinear complementarity problems
- A perturbation approach for an inverse quadratic programming problem over second-order cones
- A perturbation approach for an inverse quadratic programming problem
- Solving a class of inverse semidefinite quadratic programming problem
- A penalty-type method for solving inverse optimal value problem in second-order conic programming
- On the methods of constructing optimal parameters of the objective function in linear-linear streaming programming problems
- Combinatorial algorithms for restricted inverse optimal value problems on minimum spanning tree under weighted l₁ norm
- An enhanced Benders decomposition method for unique shortest path routing
- Solving inverse optimization problems in linear programming: a geometric and algorithmic approach
- Inverse optimization in semi-definite programs to impute unknown constraint matrices
- Linear programming system identification
- A penalty function method based on bilevel programming for solving inverse optimal value problems
- Inverse of the Gomory corner relaxation of integer programs
- Inverse integer programming
- An SAA approach for solving a class of stochastic linear semidefinite inverse optimal value problems
- Identifiability and exact reconstruction of the optimal transport cost on finite spaces
- An inverse model for the most uniform problem
- A penalty function method for solving inverse optimal value problem
- A smoothing Newton method for a type of inverse semi-definite quadratic programming problem
- An augmented Lagrangian method for a class of Inverse quadratic programming problems
- Inverse minimum cost flow problems under the weighted Hamming distance
This page was built for publication: Calculating some inverse linear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923457)
