# zbMATH — the first resource for mathematics

Stability in $$E$$-convex programming. (English) Zbl 1007.90070
Summary: 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.
##### MSC:
 90C31 Sensitivity, stability, parametric optimization
##### Keywords:
stability; $$E$$-convex programming
Full Text: