IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-031-92477-4_21.html
   My bibliography  Save this book chapter

Linear Optimization on Infinite Dimensional Polyhedra

In: On Range Space Techniques, Convex Cones, Polyhedra and Optimization in Infinite Dimensions

Author

Listed:
  • Paolo d’Alessandro

Abstract

We solve the problem of maximizing a clf over a closed convex set (or, equivalently an infinite dimensional polyhedron), in all three cases: the strictly tangent, the internal, and the external case, under the usual hypothesis that the matrix operators of the involved inequality systems have closed range, generalizing the finite dimensional theory, given in d’Alessandro (A Conical Approach to Linear Programming, Scalar and Vector Optimization Problems (Gordon and Breach Science Publishers, Amsterdam, 1997)). We also generalize to infinite dimension the primal external optimization algorithm, introduced in d’Alessandro (Optimization 25:197–207, 1992) (see also d’Alessandro, A Conical Approach to Linear Programming, Scalar and Vector Optimization Problems (Gordon and Breach Science Publishers, Amsterdam, 1997)). Finally, we show that the solution of the problem can also be achieved solving a sequence of finite dimensional LP problems, because the sequence of their maxima converges to the maximum of the infinite dimensional problem. We also give finite dimensional approximations for the minimum distance problems, which, for example, are involved in the primal external optimization algorithm, generalized to infinite dimensions in this book.

Suggested Citation

  • Paolo d’Alessandro, 2025. "Linear Optimization on Infinite Dimensional Polyhedra," Springer Books, in: On Range Space Techniques, Convex Cones, Polyhedra and Optimization in Infinite Dimensions, chapter 0, pages 337-355, Springer.
    • Handle: RePEc:spr:sprchp:978-3-031-92477-4_21
    DOI: 10.1007/978-3-031-92477-4_21
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    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:sprchp:978-3-031-92477-4_21. 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.