IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v55y2023i8p755-767.html
   My bibliography  Save this article

Generating optimal robust continuous piecewise linear regression with outliers through combinatorial Benders decomposition

Author

Listed:
  • John Alasdair Warwicker
  • Steffen Rebennack

Abstract

Using piecewise linear (PWL) functions to model discrete data has applications for example in healthcare, engineering and pattern recognition. Recently, mixed-integer linear programming (MILP) approaches have been used to optimally fit continuous PWL functions. We extend these formulations to allow for outliers. The resulting MILP models rely on binary variables and big-M constructs to model logical implications. The combinatorial Benders decomposition (CBD) approach removes the dependency on the big-M constraints by separating the MILP model into a master problem of the complicating binary variables and a linear sub problem over the continuous variables, which feeds combinatorial solution information into the master problem. We use the CBD approach to decompose the proposed MILP model and solve for optimal PWL functions. Computational results show that vast speedups can be found using this robust approach, with problem-specific improvements including smart initialization, strong cut generation and special branching approaches leading to even faster solve times, up to more than 12,000 times faster than the standard MILP approach.

Suggested Citation

  • John Alasdair Warwicker & Steffen Rebennack, 2023. "Generating optimal robust continuous piecewise linear regression with outliers through combinatorial Benders decomposition," IISE Transactions, Taylor & Francis Journals, vol. 55(8), pages 755-767, August.
  • Handle: RePEc:taf:uiiexx:v:55:y:2023:i:8:p:755-767
    DOI: 10.1080/24725854.2022.2107249
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/24725854.2022.2107249?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.

    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:taf:uiiexx:v:55:y:2023:i:8:p:755-767. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.