A further study on inverse linear programming problems
From MaRDI portal
Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27)
Recommendations
- On an inverse linear programming problem
- The inverse problem for standard linear programming problems
- scientific article; zbMATH DE number 1559133
- Inverse linear programming
- A perturbation approach for a type of inverse linear programming problems
- scientific article; zbMATH DE number 1910363
- Calculating some inverse linear programming problems
- A generalized inverse method for asymptotic linear programming
- Inverse optimization in semi-infinite linear programs
- Inverse optimization for linearly constrained convex separable programming problems
Cites work
- A network flow method for solving some inverse combinatorial optimization problems
- An inverse DEA model for inputs/outputs estimate
- Calculating some inverse linear programming problems
- scientific article; zbMATH DE number 1086909 (Why is no real title available?)
- Improving the location of minimax facilities through network modification
- Improving the location of minisum facilities through network modification
- Inverse matroid intersection problem
- Inverse maximum capacity problems
- Inverse maximum flow and minimum cut problems
- On an instance of the inverse shortest paths problem
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
Cited in
(47)- Inverse optimization for linearly constrained convex separable programming problems
- Inverse problems of submodular functions on digraphs
- The inverse problem for standard linear programming problems
- The inverse optimal value problem
- Calculating some inverse linear programming problems
- Inverse semidefinite quadratic programming problem with \(l_1\) norm measure
- Inferring linear feasible regions using inverse optimization
- Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted l_ norm
- Inverse optimization in semi-infinite linear programs
- Inverse quadratic programming problem with \(l_1\) norm measure
- Inverse problems of linear programming as simulation tooling
- Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
- 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
- The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments
- The partial inverse minimum spanning tree problem when weight increase is forbidden
- An alternating direction method for solving a class of inverse semi-definite quadratic programming problems
- Partial inverse assignment problems under \(l_{1}\) norm
- An interior-point algorithm for solving inverse linear optimization problem
- Inverse Optimization
- scientific article; zbMATH DE number 4043606 (Why is no real title available?)
- The inverse parallel machine scheduling problem with minimum total completion time
- Some inverse optimization problems on network
- 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?)
- Inverse linear programming with interval coefficients
- Algorithms for inverse optimization problems
- Decomposition and Adaptive Sampling for Data-Driven Inverse Linear Optimization
- 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 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 class of bottleneck expansion problems
- 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
- Solving inverse optimization problems in linear programming: a geometric and algorithmic approach
- Inverse optimization in semi-definite programs to impute unknown constraint matrices
- Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and _-norm objectives
- Inverse of the Gomory corner relaxation of integer programs
- 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
This page was built for publication: A further study on inverse linear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1298792)
