Complexity issues in interval linear programming
From MaRDI portal
Publication:6619770
DOI10.1007/978-3-031-28863-0_11MaRDI QIDQ6619770
Publication date: 16 October 2024
Cites Work
- Unnamed Item
- On approximation of the best case optimal value in interval linear programming
- Inverse linear programming with interval coefficients
- Complexity of some linear problems with interval data
- On strong optimality of interval linear programming
- On the optimal solution set in interval linear programming
- Interval linear programming under transformations: optimal solutions and optimal value range
- Bounds on mean absolute deviation portfolios under interval-valued expected future asset returns
- Duality gap in interval linear programming
- A note on dependency between interval linear systems
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Optimization and decision science: methodologies and applications. ODS, Sorrento, Italy, September 4--7, 2017
- Linear programming with interval right hand sides
- Linear interval inequalities
- Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard
- Linear Optimization Problems with Inexact Data
This page was built for publication: Complexity issues in interval linear programming
