Stability in \(E\)-convex programming (Q1599772)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1751287
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Stability in \(E\)-convex programming |
scientific article; zbMATH DE number 1751287 |
Statements
Stability in \(E\)-convex programming (English)
0 references
6 June 2002
0 references
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.
0 references
stability
0 references
\(E\)-convex programming
0 references
0.7745590209960938
0 references
