A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
IMA Volumes in Mathematics and its Applications
In this paper we survey recent work on the perspective reformulation approach that generates tight, tractable relaxations for convex mixed integer nonlinear programs (MINLP)s. This preprocessing technique is applicable to cases where the MINLP contains binary indicator variables that force continuous decision variables to take the value 0, or to belong to a convex set. We derive from first principles the perspective reformulation, and we discuss a variety of practical MINLPs whose relaxationdoi:10.1007/978-1-4614-1927-3_3 fatcat:whiomnk4ajahtmjppg4spe3eou