International Journal of Mathematics and Mathematical Sciences
Volume 26 (2001), Issue 10, Pages 643-648
doi:10.1155/S0161171201006317
Stability in E-convex programming
Ebrahim A. Youness
Department of Mathematics, Faculty of Science, Tanta University, Tanta, Egypt
Abstract
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.