A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
In this paper, we present the derivation of the multiparametric disaggregation technique by Teles et. al (2001) for solving nonconvex bilinear programs. Both upper and lower bounding formulations corresponding to mixed-integer linear programs are derived using disjunctive programming and exact linearizations, and incorporated into two global optimization algorithms that are used to solve bilinear programming problems. The relaxation derived using the multiparametric disaggregation techniquedoi:10.1007/s10898-012-0022-1 fatcat:wjkz74623vhofahvjyckcetzi4