We consider fuzzy stochastic programming problems with a crisp objective function and linear constraints whose coefficients are fuzzy random variables, in particular of type L-R. To solve this type of problems, we formulate deterministic counterparts of chance-constrained programming with fuzzy stochastic coefficients, by combining constraints on probability of satisfying constraints, as well a...

The Karush–Kuhn–Tucker (KKT) optimality conditions and saddle point optimality conditions in fuzzy programming problems have been studied in literature by various authors under different conditions. In this paper, by considering a partial order relation on the set of fuzzy numbers, and convexity with differentiability of fuzzy mappings, we have obtained the Fritz John (FJ) constraint qualificat...

in the present paper, we introduce and study a fuzzy vector equilibrium problem and prove some existence results with and without convexity assumptions by using some particular forms of results of textit{kim} and textit{lee} [w.k. kim and k.h. lee, generalized fuzzy games and fuzzy equilibria, fuzzy sets and systems, 122 (2001), 293-301] and textit{tarafdar} [e. tarafdar, fixed point theorems i...

Aggregation of intuitionistic fuzzy sets is studied from the point of view of preserving various kinds of convexity. We focus on aggregation functions for intuitionistic fuzzy sets. These functions correspond to simultaneous separate aggregations of the membership as well as of the nonmembership indicators. It is performed by means of the so-called representable functions. Sufficient and necess...

In this paper we study fuzzy multiobjective optimization problems defined for $n$ variables.  Based on a new $p$-dimensional fuzzy stationary-point definition,  necessary  efficiency conditions are obtained.  And we prove that these conditions are also sufficient under new fuzzy generalized convexity notions. Furthermore, the results are obtained under general differentiability hypothesis.

The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...