Tightening piecewise McCormick relaxations for bilinear problems
We address nonconvex bilinear problems where the main objective is the computation of a tight lowerbound for the objective function to be minimized. This can be obtained through a mixed-integer linearprogramming formulation relying on the concept of piecewise McCormick relaxation. It works by dividi...
| Main Author: | |
|---|---|
| Format: | article |
| Language: | eng |
| Published: |
2016
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10400.9/2947 |
| Country: | Portugal |
| Oai: | oai:repositorio.lneg.pt:10400.9/2947 |