The best, the worst and the semi-strong: optimal values in interval linear programming
From MaRDI portal
Publication:5147620
DOI10.17535/crorr.2019.0018zbMath1458.90471OpenAlexW2995498007MaRDI QIDQ5147620
Elif Garajová, Miroslav Rada, Milan Hladík
Publication date: 27 January 2021
Published in: Croatian Operational Research Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.17535/crorr.2019.0018
Related Items (1)
Cites Work
- Unnamed Item
- Weak and strong solvability of interval linear systems of equations and inequalities
- AE solutions and AE solvability to general interval linear systems
- Solvability and feasibility of interval linear equations and inequalities
- Optimal value range in interval linear programming
- Strong solvability of interval linear programming problems
- Calculating the exact bounds of optimal values in LP with interval coefficients
- Interval arithmetic for input-output models with inexact data
- On strong optimality of interval linear programming
- Interval linear programming under transformations: optimal solutions and optimal value range
- 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
- Checking strong optimality of interval linear programming with inequality constraints and nonnegative constraints
- Generalized solutions to interval linear programmes and related necessary and sufficient optimality conditions
- Linear programming with interval coefficients
- Zur lösung linearer ungleichungssysteme bei störimg der rechten seite und der koeffizientenmatrix
- Linear interval inequalities
This page was built for publication: The best, the worst and the semi-strong: optimal values in interval linear programming
