2001 ◽  
Vol 26 (10) ◽  
pp. 643-648
Author(s):  
Ebrahim A. Youness

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


Sign in / Sign up

Export Citation Format

Share Document