in this paper, an optimization problem with a linear objective function subject to a consistent finite system of fuzzy relation inequalities using the max-product composition is studied. since its feasible domain is non-convex, traditional linear programming methods cannot be applied to solve it. we study this problem and capture some special characteristics of its feasible domain and optimal s...

in this paper, we study the finitely many constraints of the fuzzyrelation inequality problem and optimize the linear objectivefunction on the region defined by the fuzzy max-product operator.simplification operations have been given to accelerate theresolution of the problem by removing the components having noeffect on the solution process. also, an algorithm and somenumerical and applied exa...

In this paper, we study the finitely many constraints of the fuzzyrelation inequality problem and optimize the linear objectivefunction on the region defined by the fuzzy max-product operator.Simplification operations have been given to accelerate theresolution of the problem by removing the components having noeffect on the solution process. Also, an algorithm and somenumerical and applied exa...

In this paper, an optimization problem with a linear objective function subject to a consistent finite system of fuzzy relation inequalities using the max-product composition is studied. Since its feasible domain is non-convex, traditional linear programming methods cannot be applied to solve it. We study this problem and capture some special characteristics of its feasible domain and optimal s...

Interval weighted automata are introduced as automata with weights in a product dioid (idempotent semiring). They constitute an extension of (max,+) automata since they enable us to model temporal constraints (instead of exact durations) for transitions. Their synchronous composition, which coincides with the synchronous product of underlying (one clock) timed automata, results in multi-event i...

Interval weighted automata are introduced as automata with weights in a product dioid (idempotent semiring). They constitute an extension of (max,+) automata since they enable us to model temporal constraints (instead of exact durations) for transitions. Their synchronous composition, that coincides with the synchronous product of underlying (one clock) timed automata, results in multi-event in...