A further study on inverse linear programming problems
From MaRDI portal
Publication:1298792
DOI10.1016/S0377-0427(99)00080-1zbMath0971.90051MaRDI QIDQ1298792
Zhenhong Liu, Zhang, Jianzhong
Publication date: 22 August 1999
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items
An interior-point algorithm for solving inverse linear optimization problem ⋮ Decomposition and Adaptive Sampling for Data-Driven Inverse Linear Optimization ⋮ Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes ⋮ Partial inverse assignment problems under \(l_{1}\) norm ⋮ On an inverse linear programming problem ⋮ The inverse parallel machine scheduling problem with minimum total completion time ⋮ A perturbation approach for an inverse quadratic programming problem ⋮ Inverse optimization for multi-objective linear programming ⋮ Some inverse optimization problems on network ⋮ On the structure of the inverse-feasible region of a linear program ⋮ Unnamed Item ⋮ A majorized penalty approach to inverse linear second order cone programming problems ⋮ The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones ⋮ Unnamed Item ⋮ 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 with interval coefficients ⋮ Inverse semidefinite quadratic programming problem with \(l_1\) norm measure ⋮ The partial inverse minimum spanning tree problem when weight increase is forbidden ⋮ Inverse quadratic programming problem with \(l_1\) norm measure ⋮ A smoothing Newton method for a type of inverse semi-definite quadratic programming problem ⋮ Inverse problems and solution methods for a class of nonlinear complementarity problems ⋮ A class of bottleneck expansion problems ⋮ The inverse optimal value problem ⋮ An augmented Lagrangian method for a class of Inverse quadratic programming problems ⋮ Inferring linear feasible regions using inverse optimization ⋮ An alternating direction method for solving a class of inverse semi-definite quadratic programming problems ⋮ Inverse problems of submodular functions on digraphs ⋮ A perturbation approach for an inverse quadratic programming problem over second-order cones ⋮ Inverse optimization for linearly constrained convex separable programming problems ⋮ Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted \(l_\infty\) norm
Uses Software
Cites Work
- Unnamed Item
- Improving the location of minisum facilities through network modification
- On an instance of the inverse shortest paths problem
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- Inverse matroid intersection problem
- Inverse maximum capacity problems
- Calculating some inverse linear programming problems
- An inverse DEA model for inputs/outputs estimate
- Improving the location of minimax facilities through network modification
- Inverse maximum flow and minimum cut problems
- A network flow method for solving some inverse combinatorial optimization problems
This page was built for publication: A further study on inverse linear programming problems
