Abstract
Kojima's strong stability of stationary solutions can be characterized by means of first and second order terms. We treat the problem whether there is a characterization of the stability concept allowing perturbations of the objective function only, keeping the feasible set unchanged. If the feasible set is a convex polyhedron, then there exists a characterization which is in fact weaker than that one of strong stability. However, in general it appears that data of first and second order do not characterize that kind of stability. As an interpretation we have that the strong stability is the only concept of stability which both admits a characterization and works for large problem classes.
Similar content being viewed by others
References
Gauvin J (1977) A necessary and sufficient regularity condition to have bounded multiplier in nonconvex programming. Mathematical Programming 12:136–138
Guddat J, Jongen HTh (1987) Structural stability in nonlinear optimization. Optimization 18:617–631
Hirabayashi R, Jongen HTh, Shida M (1993) Stability for linearly constrained optimization problems. Technical report No 46. Preprint, Lehrstuhl C für Mathematik RWTH-Aachen
Kojima M (1980) Strongly stable stationary solutions in nonlinear programs. In: Robinson SM (ed) Analysis and computation of fixed points 93–138 Academic Press New York
Robinson SM (1982) Generalized equations and their solutions, II. Applications to nonlinear programming. Math Programming Stud 19:200–221
Author information
Authors and Affiliations
Additional information
Supported by the Deutsche Forschungsgemeinschaft, Graduiertenkolleg “Analyse und Konstruktion in der Mathematik”.
Partial support under Support Center for Advanced Telecommunications Technology Research.
Rights and permissions
About this article
Cite this article
Günzel, H., Shida, M. On stability concepts in nonlinear programming. ZOR - Mathematical Methods of Operations Research 41, 153–160 (1995). https://doi.org/10.1007/BF01432652
Issue Date:
DOI: https://doi.org/10.1007/BF01432652