Nonconvex Piecewise Linear Functions: Advanced Formulations and Simple Modeling Tools
Piecewise linear functions are deceptively simple structures that are nonetheless capable of approximating complex nonlinear behavior. As such, they have been adopted throughout operations research and engineering to approximate nonlinear structures in optimization problems which would otherwise ren...
Gespeichert in:
Veröffentlicht in: | Operations research 2023-09, Vol.71 (5), p.1835-1856 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 1856 |
---|---|
container_issue | 5 |
container_start_page | 1835 |
container_title | Operations research |
container_volume | 71 |
creator | Huchette, Joey |
description | Piecewise linear functions are deceptively simple structures that are nonetheless capable of approximating complex nonlinear behavior. As such, they have been adopted throughout operations research and engineering to approximate nonlinear structures in optimization problems which would otherwise render the problem extremely difficult to solve. In “Nonconvex Piecewise Linear Functions: Advanced Formulations and Simple Modeling Tools,” J. Huchette and J. P. Vielma derive new mixed-integer programming (MIP) formulations for embedding low-dimensional nonconvex piecewise linear functions in optimization models. These formulations computationally outperform the crowded field of existing approaches in a number of regimes of interest. As these formulations are derived using recently developed machinery that produce highly performant, but uninterpretable, formulations, the authors showcase the utility of high-level modeling tools by presenting PiecewiseLinearOpt.jl, an extension to the popular JuMP optimization modeling language that implements a host of MIP formulations for piecewise linear function in a single, easy-to-use interface.
We present novel mixed-integer programming (MIP) formulations for optimization over nonconvex piecewise linear functions. We exploit recent advances in the systematic construction of MIP formulations to derive new formulations for univariate functions using a geometric approach and for bivariate functions using a combinatorial approach. All formulations are strong, small (so-called
logarithmic
formulations), and have other desirable computational properties. We present extensive experiments in which they exhibit substantial computational performance improvements over existing approaches. To accompany these advanced formulations, we present
PiecewiseLinearOpt
, an extension of the JuMP modeling language in Julia that implements our models (alongside other formulations from the literature) through a high-level interface, hiding the complexity of the formulations from the end user.
Funding:
This work was supported by the National Science Foundation [Grant CMMI-1351619]. |
doi_str_mv | 10.1287/opre.2019.1973 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2874555955</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2874555955</sourcerecordid><originalsourceid>FETCH-LOGICAL-c362t-3a584dbd7e23a7666109580f61534d13b52eb6fdfa8d7471519c3d5d11140f5c3</originalsourceid><addsrcrecordid>eNqFkM9LwzAYhoMoOKdXzwHPrUnTpI23IU6F-QPcwFvIklQyuqQm69T_3tQKHj198PG87_fxAHCOUY6Lurr0XTB5gTDPMa_IAZhgWrCMlowcgglCBGWEla_H4CTGDUKIU0YnYPXonfJubz7hszXKfNho4MI6IwOc907trHfxCs70XjplNJz7sO1b-bOG0mn4Yrdda-CD16a17g0uvW_jKThqZBvN2e-cgtX8Znl9ly2ebu-vZ4tMEVbsMiJpXeq1rkxBZMUYw-mrGjUMU1JqTNa0MGvW6EbWuiorTDFXRFONMS5RQxWZgouxtwv-vTdxJza-Dy6dFMlISSnllCYqHykVfIzBNKILdivDl8BIDOrEoE4M6sSgLgXgGDBJjY1_eM04JoRXdUKyEbGuSUrif5XfJaV7Kg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2874555955</pqid></control><display><type>article</type><title>Nonconvex Piecewise Linear Functions: Advanced Formulations and Simple Modeling Tools</title><source>INFORMS PubsOnLine</source><creator>Huchette, Joey</creator><creatorcontrib>Huchette, Joey</creatorcontrib><description>Piecewise linear functions are deceptively simple structures that are nonetheless capable of approximating complex nonlinear behavior. As such, they have been adopted throughout operations research and engineering to approximate nonlinear structures in optimization problems which would otherwise render the problem extremely difficult to solve. In “Nonconvex Piecewise Linear Functions: Advanced Formulations and Simple Modeling Tools,” J. Huchette and J. P. Vielma derive new mixed-integer programming (MIP) formulations for embedding low-dimensional nonconvex piecewise linear functions in optimization models. These formulations computationally outperform the crowded field of existing approaches in a number of regimes of interest. As these formulations are derived using recently developed machinery that produce highly performant, but uninterpretable, formulations, the authors showcase the utility of high-level modeling tools by presenting PiecewiseLinearOpt.jl, an extension to the popular JuMP optimization modeling language that implements a host of MIP formulations for piecewise linear function in a single, easy-to-use interface.
We present novel mixed-integer programming (MIP) formulations for optimization over nonconvex piecewise linear functions. We exploit recent advances in the systematic construction of MIP formulations to derive new formulations for univariate functions using a geometric approach and for bivariate functions using a combinatorial approach. All formulations are strong, small (so-called
logarithmic
formulations), and have other desirable computational properties. We present extensive experiments in which they exhibit substantial computational performance improvements over existing approaches. To accompany these advanced formulations, we present
PiecewiseLinearOpt
, an extension of the JuMP modeling language in Julia that implements our models (alongside other formulations from the literature) through a high-level interface, hiding the complexity of the formulations from the end user.
Funding:
This work was supported by the National Science Foundation [Grant CMMI-1351619].</description><identifier>ISSN: 0030-364X</identifier><identifier>EISSN: 1526-5463</identifier><identifier>DOI: 10.1287/opre.2019.1973</identifier><language>eng</language><publisher>Linthicum: INFORMS</publisher><subject>Bivariate analysis ; Combinatorial analysis ; Integer programming ; Linear functions ; Linear programming ; Mathematical models ; Mixed integer ; Modelling ; Operations research ; Optimization ; piecewise linear ; Programming languages</subject><ispartof>Operations research, 2023-09, Vol.71 (5), p.1835-1856</ispartof><rights>Copyright Institute for Operations Research and the Management Sciences Sep/Oct 2023</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c362t-3a584dbd7e23a7666109580f61534d13b52eb6fdfa8d7471519c3d5d11140f5c3</citedby><cites>FETCH-LOGICAL-c362t-3a584dbd7e23a7666109580f61534d13b52eb6fdfa8d7471519c3d5d11140f5c3</cites><orcidid>0000-0003-4335-7248 ; 0000-0003-3552-0316</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://pubsonline.informs.org/doi/full/10.1287/opre.2019.1973$$EHTML$$P50$$Ginforms$$H</linktohtml><link.rule.ids>314,776,780,3678,27903,27904,62593</link.rule.ids></links><search><creatorcontrib>Huchette, Joey</creatorcontrib><title>Nonconvex Piecewise Linear Functions: Advanced Formulations and Simple Modeling Tools</title><title>Operations research</title><description>Piecewise linear functions are deceptively simple structures that are nonetheless capable of approximating complex nonlinear behavior. As such, they have been adopted throughout operations research and engineering to approximate nonlinear structures in optimization problems which would otherwise render the problem extremely difficult to solve. In “Nonconvex Piecewise Linear Functions: Advanced Formulations and Simple Modeling Tools,” J. Huchette and J. P. Vielma derive new mixed-integer programming (MIP) formulations for embedding low-dimensional nonconvex piecewise linear functions in optimization models. These formulations computationally outperform the crowded field of existing approaches in a number of regimes of interest. As these formulations are derived using recently developed machinery that produce highly performant, but uninterpretable, formulations, the authors showcase the utility of high-level modeling tools by presenting PiecewiseLinearOpt.jl, an extension to the popular JuMP optimization modeling language that implements a host of MIP formulations for piecewise linear function in a single, easy-to-use interface.
We present novel mixed-integer programming (MIP) formulations for optimization over nonconvex piecewise linear functions. We exploit recent advances in the systematic construction of MIP formulations to derive new formulations for univariate functions using a geometric approach and for bivariate functions using a combinatorial approach. All formulations are strong, small (so-called
logarithmic
formulations), and have other desirable computational properties. We present extensive experiments in which they exhibit substantial computational performance improvements over existing approaches. To accompany these advanced formulations, we present
PiecewiseLinearOpt
, an extension of the JuMP modeling language in Julia that implements our models (alongside other formulations from the literature) through a high-level interface, hiding the complexity of the formulations from the end user.
Funding:
This work was supported by the National Science Foundation [Grant CMMI-1351619].</description><subject>Bivariate analysis</subject><subject>Combinatorial analysis</subject><subject>Integer programming</subject><subject>Linear functions</subject><subject>Linear programming</subject><subject>Mathematical models</subject><subject>Mixed integer</subject><subject>Modelling</subject><subject>Operations research</subject><subject>Optimization</subject><subject>piecewise linear</subject><subject>Programming languages</subject><issn>0030-364X</issn><issn>1526-5463</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNqFkM9LwzAYhoMoOKdXzwHPrUnTpI23IU6F-QPcwFvIklQyuqQm69T_3tQKHj198PG87_fxAHCOUY6Lurr0XTB5gTDPMa_IAZhgWrCMlowcgglCBGWEla_H4CTGDUKIU0YnYPXonfJubz7hszXKfNho4MI6IwOc907trHfxCs70XjplNJz7sO1b-bOG0mn4Yrdda-CD16a17g0uvW_jKThqZBvN2e-cgtX8Znl9ly2ebu-vZ4tMEVbsMiJpXeq1rkxBZMUYw-mrGjUMU1JqTNa0MGvW6EbWuiorTDFXRFONMS5RQxWZgouxtwv-vTdxJza-Dy6dFMlISSnllCYqHykVfIzBNKILdivDl8BIDOrEoE4M6sSgLgXgGDBJjY1_eM04JoRXdUKyEbGuSUrif5XfJaV7Kg</recordid><startdate>20230901</startdate><enddate>20230901</enddate><creator>Huchette, Joey</creator><general>INFORMS</general><general>Institute for Operations Research and the Management Sciences</general><scope>OQ6</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>JQ2</scope><scope>K9.</scope><orcidid>https://orcid.org/0000-0003-4335-7248</orcidid><orcidid>https://orcid.org/0000-0003-3552-0316</orcidid></search><sort><creationdate>20230901</creationdate><title>Nonconvex Piecewise Linear Functions: Advanced Formulations and Simple Modeling Tools</title><author>Huchette, Joey</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c362t-3a584dbd7e23a7666109580f61534d13b52eb6fdfa8d7471519c3d5d11140f5c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Bivariate analysis</topic><topic>Combinatorial analysis</topic><topic>Integer programming</topic><topic>Linear functions</topic><topic>Linear programming</topic><topic>Mathematical models</topic><topic>Mixed integer</topic><topic>Modelling</topic><topic>Operations research</topic><topic>Optimization</topic><topic>piecewise linear</topic><topic>Programming languages</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Huchette, Joey</creatorcontrib><collection>ECONIS</collection><collection>CrossRef</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Health & Medical Complete (Alumni)</collection><jtitle>Operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Huchette, Joey</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Nonconvex Piecewise Linear Functions: Advanced Formulations and Simple Modeling Tools</atitle><jtitle>Operations research</jtitle><date>2023-09-01</date><risdate>2023</risdate><volume>71</volume><issue>5</issue><spage>1835</spage><epage>1856</epage><pages>1835-1856</pages><issn>0030-364X</issn><eissn>1526-5463</eissn><abstract>Piecewise linear functions are deceptively simple structures that are nonetheless capable of approximating complex nonlinear behavior. As such, they have been adopted throughout operations research and engineering to approximate nonlinear structures in optimization problems which would otherwise render the problem extremely difficult to solve. In “Nonconvex Piecewise Linear Functions: Advanced Formulations and Simple Modeling Tools,” J. Huchette and J. P. Vielma derive new mixed-integer programming (MIP) formulations for embedding low-dimensional nonconvex piecewise linear functions in optimization models. These formulations computationally outperform the crowded field of existing approaches in a number of regimes of interest. As these formulations are derived using recently developed machinery that produce highly performant, but uninterpretable, formulations, the authors showcase the utility of high-level modeling tools by presenting PiecewiseLinearOpt.jl, an extension to the popular JuMP optimization modeling language that implements a host of MIP formulations for piecewise linear function in a single, easy-to-use interface.
We present novel mixed-integer programming (MIP) formulations for optimization over nonconvex piecewise linear functions. We exploit recent advances in the systematic construction of MIP formulations to derive new formulations for univariate functions using a geometric approach and for bivariate functions using a combinatorial approach. All formulations are strong, small (so-called
logarithmic
formulations), and have other desirable computational properties. We present extensive experiments in which they exhibit substantial computational performance improvements over existing approaches. To accompany these advanced formulations, we present
PiecewiseLinearOpt
, an extension of the JuMP modeling language in Julia that implements our models (alongside other formulations from the literature) through a high-level interface, hiding the complexity of the formulations from the end user.
Funding:
This work was supported by the National Science Foundation [Grant CMMI-1351619].</abstract><cop>Linthicum</cop><pub>INFORMS</pub><doi>10.1287/opre.2019.1973</doi><tpages>22</tpages><orcidid>https://orcid.org/0000-0003-4335-7248</orcidid><orcidid>https://orcid.org/0000-0003-3552-0316</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0030-364X |
ispartof | Operations research, 2023-09, Vol.71 (5), p.1835-1856 |
issn | 0030-364X 1526-5463 |
language | eng |
recordid | cdi_proquest_journals_2874555955 |
source | INFORMS PubsOnLine |
subjects | Bivariate analysis Combinatorial analysis Integer programming Linear functions Linear programming Mathematical models Mixed integer Modelling Operations research Optimization piecewise linear Programming languages |
title | Nonconvex Piecewise Linear Functions: Advanced Formulations and Simple Modeling Tools |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T13%3A03%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Nonconvex%20Piecewise%20Linear%20Functions:%20Advanced%20Formulations%20and%20Simple%20Modeling%20Tools&rft.jtitle=Operations%20research&rft.au=Huchette,%20Joey&rft.date=2023-09-01&rft.volume=71&rft.issue=5&rft.spage=1835&rft.epage=1856&rft.pages=1835-1856&rft.issn=0030-364X&rft.eissn=1526-5463&rft_id=info:doi/10.1287/opre.2019.1973&rft_dat=%3Cproquest_cross%3E2874555955%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2874555955&rft_id=info:pmid/&rfr_iscdi=true |