Complexity issues in interval linear programming
From MaRDI portal
Recommendations
- On strong optimality of interval linear programming
- Complexity of some linear problems with interval data
- The worst case finite optimal value in interval linear programming
- On the optimal solution set 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
Cites work
- scientific article; zbMATH DE number 3325265 (Why is no real title available?)
- A note on dependency between interval linear systems
- Bounds on mean absolute deviation portfolios under interval-valued expected future asset returns
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Complexity of some linear problems with interval data
- Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard
- Duality gap in interval linear programming
- Interval linear programming under transformations: optimal solutions and optimal value range
- Inverse linear programming with interval coefficients
- Linear Optimization Problems with Inexact Data
- Linear interval inequalities
- Linear programming with interval right hand sides
- On approximation of the best case optimal value in interval linear programming
- On strong optimality of interval linear programming
- On the optimal solution set in interval linear programming
- Optimization and decision science: methodologies and applications. ODS, Sorrento, Italy, September 4--7, 2017
This page was built for publication: Complexity issues in interval linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6619770)
