IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-031-85096-7_6.html
   My bibliography  Save this book chapter

Optimal Value Range

In: Interval Linear Programming and Extensions

Author

Listed:
  • Milan Hladík

    (Charles University)

Abstract

When the coefficients of an LP problem vary within given intervals, the optimal value changes as well. Thus, we first address the question of what the minimum and maximum achievable optimal values are (the so-called best and worst cases). These values are computable by one or more (even exponentially many) LP instances; the complexity depends on the particular LP form. The next issue we address is the continuity of the optimal value function, and we will also inspect the whole image of the optimal values (not only the minimum and maximum aforementioned), which can be composed of many mutually disjoint intervals. Eventually, since the computation of the minimum and maximum values is intractable, we present several approximation methods.

Suggested Citation

  • Milan Hladík, 2025. "Optimal Value Range," Springer Optimization and Its Applications, in: Interval Linear Programming and Extensions, chapter 0, pages 113-147, Springer.
    • Handle: RePEc:spr:spochp:978-3-031-85096-7_6
    DOI: 10.1007/978-3-031-85096-7_6
    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 search 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:spochp:978-3-031-85096-7_6. 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.