IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v57y2003i3p409-425.html
   My bibliography  Save this article

Upper semicontinuity of closed-convex-valued multifunctions

Author

Listed:
  • Maria J. Cánovas
  • Marco A. López
  • Eva-Maria Ortega
  • Juan Parra

Abstract

In this paper we study the (Berge) upper semicontinuity of a generic multifunction assigning to each parameter, in a metric space, a closed convex subset of the n-dimensional Euclidean space. A relevant particular case arises when we consider the feasible set mapping associated with a parametric family of convex semi-infinite programming problems. Related to such a generic multifunction, we introduce the concept of ɛ-reinforced mapping, which will allow us to establish a sufficient condition for the aimed property. This condition turns out to be also necessary in the case that the boundary of the image set at the nominal value of the parameter contains no half-lines. On the other hand, it is well-known that every closed convex set in the Euclidean space can be viewed as the solution set of a linear semi-infinite inequality system and, so, a parametric family of linear semi-infinite inequality systems can always be associated with the original multifunction. In this case, a different necessary condition is provided in terms of the coefficients of these linear systems. This condition tries to measure the relative variation of the right hand side with respect to the left hand side of the constraints of the systems in a neighbourhood of the nominal parameter. Copyright Springer-Verlag Berlin Heidelberg 2003

Suggested Citation

  • Maria J. Cánovas & Marco A. López & Eva-Maria Ortega & Juan Parra, 2003. "Upper semicontinuity of closed-convex-valued multifunctions," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 57(3), pages 409-425, August.
  • Handle: RePEc:spr:mathme:v:57:y:2003:i:3:p:409-425
    DOI: 10.1007/s001860200265
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860200265
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s001860200265?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:mathme:v:57:y:2003:i:3:p:409-425. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.