@inbook{542cd242b1c7455dbd1394726877b501,

title = "Using Piecewise Linear Functions for Solving MINLPs",

abstract = "In this chapter we want to demonstrate that in certain cases general mixed integer nonlinear programs (MINLPs) can be solved by just applying purely techniques from the mixed integer linear world. The way to achieve this is to approximate the nonlinearities by piecewise linear functions. The advantage of applying mixed integer lin- ear techniques are that these methods are nowadays very mature, that is, they are fast, robust, and are able to solve problems with up to millions of variables. In addition, these methods have the potential of finding globally optimal solutions or at least to provide solution guarantees. On the other hand, one tends to say at this point “If you have a hammer, everything is a nail.”[15], because one tries to reformulate or to approximate an ac- tual nonlinear problem until one obtains a model that is tractable by the methods one is common with. Besides the fact that this is a very typical approach in mathematics the question stays whether this is a reasonable approach for the solution of MINLPs or whether the nature of the nonlin- earities inherent to the problem gets lost and the solutions obtained from the mixed integer linear problem have no meaning for the MINLP. The purpose of this chapter is to discuss this question. We will see that the truth lies somewhere in between and that there are problems where this is indeed a reasonable way to go and others where it is not.",

author = "Bj{\"o}rn Gei{\ss}ler and Alexander Martin and Antonio Morsi and Lars Schewe",

year = "2012",

doi = "10.1007/978-1-4614-1927-3",

language = "English",

isbn = "978-1-4614-1926-6",

volume = "154",

series = "The IMA Volumes in Mathematics and its Applications",

publisher = "Springer Science+Business Media, New York",

pages = "287--314",

editor = "Leyffer Sven and Lee Jon",

booktitle = "Mixed Integer Nonlinear Programming",

}