29 citations · 171 across the 24 of their papers we have counts for
5 papers · 1 filter
Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomial cases
Miroslav Rada, Milan Hladík, Elif Garajová
We address the problem of testing weak optimality of a given solution of a given interval linear program. The problem was recently wrongly stated to be polynomially solvable. We di…
An Overview of Polynomially Computable Characteristics of Special Interval Matrices
Milan Hladík
It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, t…
AE regularity of interval matrices
Milan Hladík
Consider a linear system of equations with interval coefficients, and each interval coefficient is associated with either a universal or an existential quantifier. The AE solution…
Positive Semidefiniteness and Positive Definiteness of a Linear Parametric Interval Matrix
Milan Hladík
We consider a symmetric matrix, the entries of which depend linearly on some parameters. The domains of the parameters are compact real intervals. We investigate the problem of che…
Eigenvalues of symmetric tridiagonal interval matrices revisited
Milan Hladík
In this short note, we present a novel method for computing exact lower and upper bounds of eigenvalues of a symmetric tridiagonal interval matrix. Compared to the known methods, o…