Skip to main content

Closures and Neighbourhoods Induced by Tangential Approximations

  • Conference paper
Selected Topics in Operations Research and Mathematical Economics

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 226))

Abstract

We begin with a simple observation that every usual optimization problem is determined by the following two components: a set of “feasible” solutions and a binary relation “better”. The set of all feasible solutions is, as a rule, given through a system of conditions as a subset of a larger set endowed with some structures. The relation better should make a consistent comparison of feasible solutions possible. As a minimal consistency condition we shall require that the relation in question is acyclic.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Day, M.M.: Convergence, closure and neigbourhoods; Duke Math. J. 11 (1944), 181–199.

    Article  Google Scholar 

  • Dolecki, S.: Tangency and differentiation: some applications of convergence theory; Annali di Matematica pura ed applicata (IV), CXXX (1982), 233–255.

    Google Scholar 

  • Fröhlicher, A. and W. Bucher: Calculus in vector spaces without norm; SpringerVerlag, Berlin (1966).

    Google Scholar 

  • Hammer, P.C.: Extended topology: structure of isotonic functions; J. Reine Angew. Math. 213 (1964), 174–186.

    Article  Google Scholar 

  • Hiriart-Urruty, J.B.: New concepts in nondifferentiable programming; Bull. Soc. Math. France, Mémoire 60 (1979), 57–85.

    Google Scholar 

  • Lukes, J., J. Malý, D. Preis and L. Zajicek: Fine topology methods in real analysis and potential theory; Lecture Notes in Math., Springer-Verlag (to appear).

    Google Scholar 

  • Penot, J.P.: Calcul sous-differential et optimisation; J. of Functional Analysis 27 (1978), 248–276.

    Article  Google Scholar 

  • Penot, J.P.: A characterization of tangential regularity; Nonlinear Anal. Theory, Math. Appl. 5 (1981), 625–663.

    Article  Google Scholar 

  • Rockafellar, R.T.: The theory of subgradients and its applications to problems of optimization: convex and nonconvex functions; Helderman Verlag, Berlin (1981).

    Google Scholar 

  • Sachs, E.: Differentiability in optimization theory; Math. Operationsforsch. Statist., ser. Optimization 7 (1978), 497–537.

    Article  Google Scholar 

  • Saks, S.: Theory of the Integral, second revised edition; Hafner Publ. Co., New York (1937).

    Google Scholar 

  • Vlach, M.: On necessary conditions of optimality in linear spaces; Comm. Math. Univ. Carolinae 11,1 (1970), 501–513.

    Google Scholar 

  • Vlach, M.: Approximation operators in optimization theory; Zeitschrift für Operations Research 25 (1981), 15–23.

    Article  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vlach, M. (1984). Closures and Neighbourhoods Induced by Tangential Approximations. In: Hammer, G., Pallaschke, D. (eds) Selected Topics in Operations Research and Mathematical Economics. Lecture Notes in Economics and Mathematical Systems, vol 226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45567-4_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-45567-4_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12918-9

  • Online ISBN: 978-3-642-45567-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics