This paper presents a new approach to compare fuzzy numbers using α-distance. Initially, the metric distance on the interval numbers based on the convex hull of the endpoints is proposed and it is extended to fuzzy numbers. All the properties of the α-distance are proved in details. Finally, the ranking of fuzzy numbers by the α-distance is discussed. In addition, the proposed method is compare...

Optimization is a procedure of finding and comparing feasible solutions until no better solution can be found. It can be divided into several fields, one of which is the Convex Optimization. It is characterized by a convex objective function and convex constraint functions over a convex set which is the set of the decision variables. This can be viewed, on the one hand, as a particular case of ...

we have the crisp vector → PQ= (y(1)−x(1),y(2)−x(2), . . . ,y(n)−x(n)) in a pseudo-fuzzy vector space Fn p (1)= {(a(1),a(2), . . . ,a(n))1∀(a(1),a(2), . . . ,a(n))∈Rn}. There is a one-to-one onto mapping P = (x(1),x(2), . . . ,x(n)) ↔ P̃ = (x(1),x(2), . . . , x)1. Therefore, for the crisp vector → PQ, we can define the fuzzy vector → P̃ Q̃= (y(1)− x(1),y(2)−x(2), . . . ,y(n)−x(n))1 = Q̃ P̃ . Let the...

When we regard the plane as a set of points, we can deene various geometric properties of subsets of the plane|connectedness, convexity, area, diameter, etc. It is well known that the plane can also be regarded as a set of lines. This note considers methods of deening sets (or fuzzy sets) of lines in the plane, and of deening (analogs of) \geometric properties" for such sets.

we have the crisp vector → PQ= (y(1)−x(1),y(2)−x(2), . . . ,y(n)−x(n)) in a pseudo-fuzzy vector space Fn p (1)= {(a(1),a(2), . . . ,a(n))1∀(a(1),a(2), . . . ,a(n))∈Rn}. There is a one-to-one onto mapping P = (x(1),x(2), . . . ,x(n)) ↔ P̃ = (x(1),x(2), . . . , x)1. Therefore, for the crisp vector → PQ, we can define the fuzzy vector → P̃ Q̃= (y(1)− x(1),y(2)−x(2), . . . ,y(n)−x(n))1 = Q̃ P̃ . Let the...

Concerning with the topics of fuzzy decision processes, a brief survey on ordering of fuzzy numbers on R is presented and an extension to that of fuzzy sets(numbers) on Rn are considered. This extension is a pseudo order 4 K de ned by a non-empty closed convex cone K and characterized by the projection into its dual cone K. Especially a structure of the lattice is presented on the class of rect...

The formal framework for decision making in a fuzzy environment is based on a general maxmin, bottleneck-like optimization problem, proposed by Zadeh. It is also the basis for extending the constraint satisfaction paradigm of Artificial Intelligence to accommodating flexible or prioritized constraints. This paper surveys refinements of the ordering of solutions supplied by the max-min formulati...

the paper deals with special types of $l$-ordered sets, $l$-fuzzy complete lattices, and fuzzy directed complete posets.first, a theorem for constructing monotone maps is proved, a characterization for monotone maps on an $l$-fuzzy complete lattice is obtained, and it's proved that if $f$ is a monotone map on an $l$-fuzzy complete lattice $(p;e)$, then the least fixpoint of $f$ is meet of ...

Abstract—This paper proposes the analysis and design of robust fuzzy control to Stochastic Parametrics Uncertaint Linear systems. This system type to be controlled is partitioned into several linear sub-models, in terms of transfer function, forming a convex polytope, similar to LPV (Linear Parameters Varying) system. Once defined the linear sub-models of the plant, these are organized into fuz...

In this paper, new definitions of $L$-fuzzy closure operator, $L$-fuzzy interior operator, $L$-fuzzy remote neighborhood system, $L$-fuzzy neighborhood system and $L$-fuzzy quasi-coincident neighborhood system are proposed. It is proved that the category of $L$-fuzzy closure spaces, the category of $L$-fuzzy interior spaces, the category of $L$-fuzzy remote neighborhood spaces, the category of ...