9 research outputs found
Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks
Piecewise MILP under- and overestimators for global optimization of bilinear programs
AIChE Journal544991-1008AICE
Optimization of fuel gas network in an Lng plant
AIChE Annual Meeting, Conference Proceedings
Tightening the Linear Relaxation of a Mixed Integer Nonlinear Program Using Constraint Programming
Experimental geomechanics: a laboratory study on the behaviour of granular material using bender elements
Physicochemical Analysis Of Gouramy Fish Sausage With Kecombrang Edible Coating Addition
Global Optimization of Mixed-Integer Quadratically Constrained Quadratic Programs (MIQCQP) through Piecewise-Linear and Edge-Concave Relaxations
We propose a deterministic global optimization approach, whose novel contributions are rooted in the edge-concave and piecewise-linear underestimators, to address nonconvex mixed-integer quadratically-constrained quadratic programs (MIQCQP) to ε-global optimality. The facets of low-dimensional (n ≤ 3) edge-concave aggregations dominating the termwise relaxation of MIQCQP are introduced at every node of a branch-and-bound tree. Concave multivariable terms and sparsely distributed bilinear terms that do not participate in connected edge-concave aggregations are addressed through piecewise-linear relaxations. Extensive computational studies are presented for point packing problems, standard and generalized pooling problems, and examples from GLOBALLib (Meeraus, Globallib. http://www.gamsworld.org/global/globallib. htm). © 2012 Springer and Mathematical Optimization Society