Abstrakt
Slater's condition is, no doubt, an important regularity condition used in nonlinear programming. It states that the feasible set must contain an interior point.
We analyse this condition in an uncertain environment. We assume that uncertainty of the input data has the form of intervals covering the true values; we assume no other information about the uncertainty is known.
Then Slater's condition holds robustly if it is satisfied for each possible realization of the interval values. In particular, we investigate interval systems of linear equations and inequalities.
Therein, Slater's condition has the form of strong solvability with strict inequalities. We present a finite characterization of this property and inspect its computational complexity - in some cases it is polynomial, but in some cases it is NP-hard.
As an illustration, we apply our results in interval linear programming in the problem of testing boundedness of the optimal solution set.