Weak optimal inverse problems of interval linear programming based on KKT conditions
From MaRDI portal
Publication:2057406
DOI10.1007/s11766-021-4324-2zbMath1488.65140OpenAlexW3201294378MaRDI QIDQ2057406
Tao Jiang, Haohao Li, Xiao Liu
Publication date: 6 December 2021
Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11766-021-4324-2
Numerical mathematical programming methods (65K05) Linear programming (90C05) General methods in interval analysis (65G40)
Cites Work
- Unnamed Item
- Weak and strong solvability of interval linear systems of equations and inequalities
- Inverse linear programming with interval coefficients
- Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector
- Bounds on the worst optimal value in interval linear programming
- Strong solvability of interval linear programming problems
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- The inverse optimal value problem
- Calculating some inverse linear programming problems
- Multiobjective interval linear programming in admissible-order vector space
- Duality gap in interval linear programming
- Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Strong optimal solutions of interval linear programming
- Necessary and sufficient conditions of some strong optimal solutions to the interval linear programming
- Multiobjective programming in optimization of the interval objective function
- Generalized solutions to interval linear programmes and related necessary and sufficient optimality conditions
- Inverse Optimization
- Efficient Algorithms for the Inverse Spanning-Tree Problem
- Zur lösung linearer ungleichungssysteme bei störimg der rechten seite und der koeffizientenmatrix
- Algorithms for Linear Programming Problems with Interval Objective Function Coefficients
- Rigorous solution of linear programming problems with uncertain data
- Linear Optimization Problems with Inexact Data
This page was built for publication: Weak optimal inverse problems of interval linear programming based on KKT conditions