Abstract
Feasible sets in semi-infinite optimization are basically defined by means of infinitely many inequality constraints. We consider one-parameter families of such sets. In particular, all defin-ing functions - including those defining the index set of the inequality constraints - will depend on a parameter. We note that a semi-infinite problem is a two-level problem in the sense that a point is feasible if and only if all global minimizers of a corresponding marginal function are nonnegative. For a quite natural class of mappings we characterize changes in the global topological structure of the corresponding feasible set as the parameter varies. As long as the index set (-mapping) of the inequality constraints is lower semicontinuous, all changes in topology are those which generically appear in one-parameter sets defined by finitely many constraints. In the case, however, that some component of the mentioned index set is born (or vanishes), the topological change is of global nature and is not controllable. In fact, the change might be as drastic as that when adding or deleting an (arbitrary) inequality constraint.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Berge, C. (1963), Topological Spaces. Oliver and Boyd, Edinburgh, London.
Fiacco, A.V. (1983), Introduction to Sensitivity and Stability Analysis in Nonlinear Programming. Academic Press, New York.
Guddat, J., Jongen, H.Th. and Rückmann, J.-J. (1986), On stability and stationary points in nonlinear optimization, J. Austral. Math. Soc., Ser. B 28: 36–56.
Hettich, R., Jongen, H.Th. and Stein, O. (1995), On continuous deformations of semi-infinite optimization problems, in M. Florenzano et al. (eds.), Approximation and Optimization in the Carribean II (Peter Lang, Frankfurt), pp. 406–424.
Hettich, R. and Kortanek, K.O. (1993), Semi-infinite programming: theory, methods and applications, SIAM Rev. 35(3): 380–429.
Hettich, R. and Zencke, P. (1982), Numerische Methoden der Approximation und semi-infiniten Optimierung. Teubner, Stuttgart.
Hirsch, M.W. (1976), Differential Topology. Springer, Berlin, Heidelberg, New York.
Jiménez, M.A. and Rückmann, J.-J. (1995), On equivalent stability properties in semi-infinite optimization, Z. Oper. Res. 41(2): 175–190.
Jongen, H.Th., Jonker, P. and Twilt, F. (1982), On one-parameter families of sets defined by (in)equality constraints, Nieuw Archief voor Wiskunde 30(3): 307–322.
Jongen, H.Th., Jonker, P. and Twilt, F. (1983), Nonlinear Optimization in Rn, I. Morse Theory, Chebyshev Approximation. Peter Lang, Frankfurt.
Jongen, H.Th., Jonker, P. and Twilt, F. (1986), Nonlinear Optimization in Rn, II. Transversality, Flows, Parametric Aspects. Peter Lang, Frankfurt.
Jongen, H.Th., Rückmann, J.-J. and Weber, G.-W. (1994), One-parametric semi-infinite optimization: on the stability of the feasible set, SIAM J. Opt. 4(3): 637–648.
Jongen, H.Th. and Stein, O. (1997), On generic one-parametric semi-infinite optimization, SIAM J. Opt. 7(4): 1103–1137.
Jongen, H.Th., Twilt, F. and Weber, G.-W. (1992), Semi-infinite optimization: structure and stability of the feasible set, J. Optim. Theory Appl. 72: 529–552.
Polak, E. (1987), On the mathematical foundations of nondifferentiable optimization in engineering design, SIAM Rev. 29: 21–89.
Reemtsen, R. and Rückmann, J-J. (eds.) (1998), Semi-infinite Programming. Kluwer Academic Publishers, Dordrecht / Boston / London.
Rupp, T. (1989), Kuhn-Tucker curves for one-parametric semi-infinite programming, Optimization, 20: 61–77.
Spanier, E.H. (1966), Algebraic Topology. McGraw Hill, New York.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jongen, H., Rückmann, JJ. One-Parameter Families of Feasible Sets in Semi-infinite Optimization. Journal of Global Optimization 14, 181–204 (1999). https://doi.org/10.1023/A:1008282216306
Issue Date:
DOI: https://doi.org/10.1023/A:1008282216306