Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases
From MaRDI portal
Publication:2311118
DOI10.1007/s11590-018-1289-zzbMath1426.90186arXiv1712.00350OpenAlexW2964194415WikidataQ129606512 ScholiaQ129606512MaRDI QIDQ2311118
Milan Hladík, Miroslav Rada, Elif Garajová
Publication date: 10 July 2019
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.00350
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)
Related Items (3)
Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form ⋮ Checking weak and strong optimality of the solution to interval convex quadratic program ⋮ Weak optimal inverse problems of interval linear programming based on KKT conditions
Cites Work
- Unnamed Item
- Unnamed Item
- Robust optimal solutions in interval linear programming with forall-exists quantifiers
- Weak and strong solvability of interval linear systems of equations and inequalities
- The optimal solution set of the interval linear programming problems
- Necessary and sufficient conditions for unified optimality of interval linear program in the general form
- Calculating the exact bounds of optimal values in LP with interval coefficients
- Disjunctive programming: Properties of the convex hull of feasible points
- Complexity of some linear problems with interval data
- On strong optimality of interval linear programming
- Interval linear programming under transformations: optimal solutions and optimal value range
- Duality gap in interval linear programming
- A note on dependency between interval linear systems
- Stability of the optimal basis of a linear program under uncertainty
- How to determine basis stability in interval linear programming
- Checking strong optimality of interval linear programming with inequality constraints and nonnegative constraints
- Sufficient condition of basis stability of an interval linear programming problem
- Generalized solutions to interval linear programmes and related necessary and sufficient optimality conditions
- Transformations of interval linear systems of equations and inequalities
- Linear programming with interval coefficients
- Robustness and duality in linear programming
- Checking weak optimality of the solution to interval linear program in the general form
This page was built for publication: Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases
