Linearity Embedded in Nonconvex Programs

AbstractNonconvex programs involving bilinear terms and linear equality constraints often appear more nonlinear than they really are. By using an automatic symbolic reformulation we can substitute some of the bilinear terms with linear constraints. This has a dramatically improving effect on the tightness of any convex relaxation of the problem, which makes deterministic global optimization algorithms like spatial Branch-and-Bound much more eff- cient when applied to the problem.

[1]  Efstratios N. Pistikopoulos,et al.  A Reduced Space Branch and Bound Algorithm for Global optimization , 1997, J. Glob. Optim..

[2]  Edward M. B. Smith,et al.  Global optimisation of nonconvex MINLPs , 1997 .

[3]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[4]  Ross E. Swaney,et al.  Global optimization of nonconvex nonlinear programs using parallel branch and bound , 1995 .

[5]  G. Nemhauser,et al.  Integer Programming , 2020 .

[6]  Edward M. B. Smith,et al.  A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs , 1999 .

[7]  N. Sahinidis,et al.  Global optimization of nonconvex NLPs and MINLPs with applications in process design , 1995 .

[8]  Leo Liberti,et al.  Reduction constraints for the global optimization of NLPs , 2004 .

[9]  N. Sahinidis,et al.  A Lagrangian Approach to the Pooling Problem , 1999 .

[10]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[11]  Mahmoud M. El-Halwagi,et al.  Global Optimization of Nonconvex MINLP’s by Interval Analysis , 1996 .

[12]  Hanif D. Sherali,et al.  Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations , 2000, Discret. Appl. Math..

[13]  A. Neumaier,et al.  A global optimization method, αBB, for general twice-differentiable constrained NLPs — I. Theoretical advances , 1998 .

[14]  James E. Falk,et al.  Jointly Constrained Biconvex Programming , 1983, Math. Oper. Res..

[15]  Edward M. B. Smith,et al.  On the optimal design of continuous processes , 1996 .

[16]  Garth P. McCormick,et al.  Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..

[17]  Hanif D. Sherali,et al.  A new reformulation-linearization technique for bilinear programming problems , 1992, J. Glob. Optim..