A perturbation approach for a type of inverse linear programming problems
DOI10.1080/00207160903513003zbMath1211.65071OpenAlexW2051815074MaRDI QIDQ5391505
Xiantao Xiao, Yong Jiang, Zhang, Jianzhong, Li-wei Zhang
Publication date: 6 April 2011
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160903513003
global convergencenumerical resultsinexact Newton methodlinear programming problemFischer-Burmeister functionlinear complementarity constrained minimization problem
Numerical mathematical programming methods (65K05) Linear programming (90C05) Methods of quasi-Newton type (90C53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Cites Work
- An augmented Lagrangian method for a class of Inverse quadratic programming problems
- On an instance of the inverse shortest paths problem
- A smoothing method for mathematical programs with equilibrium constraints
- A further study on inverse linear programming problems
- Solution structure of some inverse combinatorial optimization problems
- Some reverse location problems
- A modified relaxation scheme for mathematical programs with complementarity constraints
- Inverse conic programming with applications
- The complexity analysis of the inverse center location problem
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Calculating some inverse linear programming problems
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Inverse Optimization
- Variational Analysis
- Combinatorial algorithms for inverse network flow problems
This page was built for publication: A perturbation approach for a type of inverse linear programming problems