Stability in E-convex programming
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 ma...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2001-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/S0161171201006317 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|