Stability in E-convex programming

DOI10.1155/S0161171201006317MaRDI QIDQ1599772zbMATH OpenFDO

Authors R. Smith

Publication date 6 June 2002

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/49849

zbMATH Keywords

\(E\)-convex programmingstability

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 2148569
• scientific article; zbMATH DE number 3906245
• scientific article; zbMATH DE number 3867081
• \(E\)-convex sets, \(E\)-convex functions, and \(E\)-convex programming
• scientific article; zbMATH DE number 5049625

Cited in

(1)

• Stability of \varepsilon-approximate Solutions to Convex Stochastic Programs

This page was built for publication: Stability in \(E\)-convex programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1599772)