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...
| Autor principal: | |
|---|---|
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2016
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10400.9/2947 |
| País: | Portugal |
| Oai: | oai:repositorio.lneg.pt:10400.9/2947 |