IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4939-0808-0_14.html
   My bibliography  Save this book chapter

Computing Area-Tight Piecewise Linear Overestimators, Underestimators and Tubes for Univariate Functions

In: Optimization in Science and Engineering

Author

Listed:
  • Josef Kallrath

    (University of Florida, Department of Astronomy)

  • Steffen Rebennack

    (Division of Economics and Business, Colorado School of Mines)

Abstract

We develop algorithms computing piecewise linear, continuous overestimators, underestimators and tubes for univariate functions which minimize the area between the approximator and the function. We call such approximators area-tight. Area-tight overestimators, underestimators and tubes are of interest when solving large-scale mixed-integer non-linear programming problems (MINLPs). The function to be approximated is typically non-linear and non-convex; it should be univariate and discontinuous only at a finite number of points. The number of breakpoints for the approximation as well as the absolute allowable deviation of the approximator and the original function are input for the algorithms. The presented algorithms are fully automatic and make no assumptions on the shape of the function to be approximated. We provide computational tests for ten functions.

Suggested Citation

  • Josef Kallrath & Steffen Rebennack, 2014. "Computing Area-Tight Piecewise Linear Overestimators, Underestimators and Tubes for Univariate Functions," Springer Books, in: Themistocles M. Rassias & Christodoulos A. Floudas & Sergiy Butenko (ed.), Optimization in Science and Engineering, edition 127, pages 273-292, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4939-0808-0_14
    DOI: 10.1007/978-1-4939-0808-0_14
    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

    Keywords

    ;
    ;
    ;
    ;
    ;

    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-1-4939-0808-0_14. 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.