The usual ordering " ≤" on R is a total ordering, that is, for any two real numbers in R, we can determine their order without difficulty. However, for any two closed intervals in R, there is not a natural ordering among the set of all closed intervals in R. Several methods have been developed to compare two intervals. In this paper, we define the… (More)
The aim of this paper is to study the roots of interval polynomials. The characterization of such roots is given and an algorithm is developed for computing the interval roots of quadratic polynomials with interval coefficients.
—In real optimization, we always meet the criteria of useful outcomes increasing or expenses decreasing and demands of lower uncertainty. Therefore, we usually formulate an optimization problem under conditions of uncertainty. In this paper, a new method for solving linear programming problems with fuzzy parameters in the objective function and the… (More)
Polynomial equations with perturbed coefficients arise in several areas of engineering sciences, for instance, in automatic control theory , dynamical systems, optimization and in control theory. For such equations, it is necessary to study their roots and to establish a priori estimates to define regions containing such roots. Attending to the fact that… (More)
Exclusion algorithms have been used recently to find all solutions of a system of nonlinear equations or to find the global minimum of a function over a compact domain. These algorithms are based on a minimization condition that can be applied to each cell in the domain. In this paper, we consider Lipschitz functions of order and give a new minimization… (More)