Stability in E

We define and analyze two kinds of stability in E-convex programming problem in which the feasible domain is affected by an operator E. The first kind of this stability is that the set of all operators E that make an optimal set stable while the other kind is that the set of all operators E that make certain side of the feasible domain still active

On stability of stochastic multiobjective programming problems with random coefficients in the objective functions

In this paper we present quantitative analysis of the stability set of the first kind of stochastic multiobjective programming problems with random coefficients in the multiobjective functions. Using Kuhn-Tucker conditions and some statistical theorems, the authors determine the set of all random parameters that make the solution of our concerned problem be stable. An illustrative example is given to clarify the development theory in this paper