We propose a generalization of the Hukuhara difference. First, the case of compact convex sets is examined; then, the results are applied to generalize the Hukuhara difference of fuzzy numbers, using their compact and convex level-cuts. Finally, a similar approach is seggested to attempt a...

In the present paper we introduce and study a generalization of the Hukuhara differ- ence and also generalizations of the Hukuhara differentiability to the case of interval valued functions. We consider several possible definitions for the derivative of an interval valued function and we study...

We introduce a new interval global optimization method for solving bound constrained problems. The method originates from a small standalone software and is implemented in the COCONUT Environment, a framework designed for the development of complex algorithms, containing numerous...

In general, solving Global Optimization (GO) problems by Branch-and-Bound (B&B) requires a huge computational capacity. Parallel execution is used to speed up the computing time. As in this type of algorithms, the foreseen computational workload (number of nodes in the B&B tree) changes...

Interval branch-and-bound (B&B) algorithms are powerful methods which look for guaranteed solutions of global optimisation problems. The computational effort needed to reach this aim, increases exponentially with the problem dimension in the worst case. For separable functions this effort is...