Skip to main content
SpringerLink
Log in
Book cover

Point-to-Set Maps and Mathematical Programming pp 104–109Cite as

On the lower semicontinuity of optimal sets in convex parametric optimization

  • Chapter
  • First Online:

Part of the book series: Mathematical Programming Studies ((MATHPROGRAMM,volume 10))

Abstract

Regarding a special class of convex parametric problems sufficient conditions for the lower semicontinuity of the optimal solution sets are developed.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Berge, Topological spaces (Macmillan, New York, 1963).

    MATH  Google Scholar 

  2. G.B. Dantzig, J. Folkman and N. Shapiro, “On the continuity of the minimum set of a continuous function”, Journal of Mathematical Analysis and Applications 17 (1967) 519–548.

    Article  MATH  MathSciNet  Google Scholar 

  3. G. Debreu, Theory of value (John Wiley, New York, 1959).

    MATH  Google Scholar 

  4. J.P. Evans and F.J. Gould, “Stability in nonlinear programming”, Operations Research 18 (1970) 107–118.

    Article  MATH  MathSciNet  Google Scholar 

  5. H.J. Greenberg and W.P. Pierskalla, “Extensions of the Evans-Gould stability theorems for mathematical programs”, Operations Research 20 (1972) 143–153.

    Article  MATH  MathSciNet  Google Scholar 

  6. J. Guddal, “Stability in convex quadratic parametric programming”, Mathematische Operations forschung und Statistik 7 (1976) 223–245.

    Google Scholar 

  7. J. Guddat and D. Klatte. “Qualitative stability in nonlinear optimization”, Proceedings of the IX. Internat. Symposium on Mathematical Programming, Budapest, 1976 (to appear).

    Google Scholar 

  8. W.W. Hogan, “Point-to-set maps in mathematical programming”, SIAM Review 15 (1973) 591–603.

    Article  MATH  MathSciNet  Google Scholar 

  9. P. Huard, “Optimization algorithms and point-to-set maps”, Mathematical Programming 8 (1975) 308–331.

    Article  MATH  MathSciNet  Google Scholar 

  10. D. Klatte, “Untersuchungen zur lokalen Stabilität konvexer parametrischer Optimierungsprobleme”, Dissertation (A), (Humboldt-Universität, Berlin, 1977).

    Google Scholar 

  11. B. Kummer, “Stability and weak duality in convex programming without regularity”, preprint (Humboldt-Universität, Berlin, 1978).

    Google Scholar 

  12. R. Meyer, “The validity of a family of optimization methods”, SIAM Journal on Control 8 (1970) 41–54.

    Article  MATH  Google Scholar 

  13. F. Nožička, J. Guddat, H. Hollatz und B. Bank, Theorie der linearen parametrischen Optimierung (Akademie-Verlag, Berlin, 1974).

    MATH  Google Scholar 

  14. S.M. Robinson and R.H. Day, “A sufficient condition for continuity of optimal sets in mathematical programming”, Journal, of Mathematical Analysis and Application 45 (1974) 506–511.

    Article  MATH  MathSciNet  Google Scholar 

  15. R.T. Rockafellar, Convex analysis (Princeton University Press, Princeton, NJ, 1970).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Der Humboldt Universität, Berlin, GDR

    D. Klatte

Authors
  1. D. Klatte
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Huard

Rights and permissions

Reprints and permissions

Copyright information

© 1979 The Mathematical Programming Society

About this chapter

Cite this chapter

Klatte, D. (1979). On the lower semicontinuity of optimal sets in convex parametric optimization. In: Huard, P. (eds) Point-to-Set Maps and Mathematical Programming. Mathematical Programming Studies, vol 10. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120847

Download citation

  • DOI: https://doi.org/10.1007/BFb0120847

  • Received:

  • Revised:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00797-2

  • Online ISBN: 978-3-642-00798-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation