Skip to main content
SpringerLink
Log in

On the closure of the feasible set in generalized semi-infinite programming

  • Original Paper
  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

Abstract

In generalized semi-infinite programming the feasible set is known to be not closed in general. In this paper, under natural and generic assumptions, the closure of the feasible set is described in explicit terms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Graettinger TJ, Krogh BH (1988) The acceleration radius: a global performance measure for robotic manipulators. IEEE J Robot Autom 4:60–69

    Article  Google Scholar 

  • Hettich R, Kortanek KO (1993) Semi-infinite programming: theory, methods, and applications. SIAM Rev 35:380–429

    Article  Google Scholar 

  • Horst R, Tuy H (1990) Global optimization. Springer, Berlin

    Google Scholar 

  • Jongen HTh, Jonker P, Twilt F (2000) Nonlinear optimization in finite dimensions. Kluwer, Dordrecht

    Google Scholar 

  • Jongen HTh, Rückmann J-J (1999) One-parameter families of feasible sets in semi-infinite optimization. J Global Optim 14:181–203

    Article  Google Scholar 

  • Stein O (2001) First order optimality conditions for degenerate index sets in generalized semi-infinite programming. Math Oper Res 26:565–582

    Article  Google Scholar 

  • Stein O (2003) Bi-level strategies in semi-infinite programming. Kluwer, Boston

    Google Scholar 

  • Stein O (2006) A semi-infinite approach to design centering. In: Dempe S, Kalashnikov V (eds) Optimization with multivalued mappings. Springer, Heidelberg, pp 209–228

    Chapter  Google Scholar 

  • Winterfeld A (2004) Maximizing volumes of lapidaries by use of hierarchical GSIP-models. Diploma Thesis, Technische Universität Kaiserlautern and Fraunhofer Institut für Techno- und Wirtschaftsmathematik

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, RWTH Aachen University, Templergraben 55, 52056, Aachen, Germany

    Harald Günzel & Hubertus Th. Jongen

  2. School of Economics and Business Engineering, University of Karlsruhe (TH), Kaiserstr. 12, 76128, Karlsruhe, Germany

    Oliver Stein

Authors
  1. Harald Günzel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hubertus Th. Jongen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Oliver Stein
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Oliver Stein.

Additional information

Oliver Stein gratefully acknowledges support through a Heisenberg grant of the Deutsche Forschungsgemeinschaft.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Günzel, H., Jongen, H.T. & Stein, O. On the closure of the feasible set in generalized semi-infinite programming. cent.eur.j.oper.res. 15, 271–280 (2007). https://doi.org/10.1007/s10100-007-0030-2

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-007-0030-2

Keywords

Mathematics Subject Classification (2000)

Search

Navigation