Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Journal of Optimizat...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Journal of Optimization Theory and Applications
Article . 1982 . Peer-reviewed
License: Springer TDM
Data sources: Crossref
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 1982
Data sources: zbMATH Open
versions View all 2 versions
addClaim

Connected level sets, minimizing sets, and uniqueness in optimization

Connected level sets, minimizing sets and uniqueness in optimization
Authors: Martin, D. H.;

Connected level sets, minimizing sets, and uniqueness in optimization

Abstract

Intimate relationships are investigated between connectedness properties of the lower level sets of a real functionf on a topological spaceX and the uniqueness of suitably defined minimizing sets forf. Two distinct theories are presented, the simpler one pertaining to the LE-level sets $$LE_\alpha (f) = \{ x \in X|f(x) \leqslant \alpha \} $$ and the other to the LT-level sets $$LT_\alpha (f) = \{ x \in X|f(x) \leqslant \alpha \} .$$ In each theory, a specific notion of minimizing set is defined in such a way that a functionf having connected level sets can have at most one minimizing set. That this uniqueness is not trivial, however, is shown by the converse result that, ifX is Hausdorff and the sets LEα(f) are all compact, then, in each theory,f has a unique minimizing set only if it has connected level sets. The paper concludes by showing that functions with connected LT-level sets arise naturally in parametric linear programming.

Keywords

parametric linear programming, minimizing sets, Sensitivity, stability, parametric optimization, uniqueness of minimizers, uniqueness in optimization, connected level sets, connectedness

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    13
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
13
Average
Top 10%
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!