Browsing Department of Informatics by Subject "Semidefinite programming"
Now showing items 1-1 of 1
-
Solving the pooling problem with LMI relaxations
(Chapter; Peer reviewed, 2012)We consider the standard pooling problem with a single quality parameter, which is a polynomial global optimization problem occurring among other places in the oil industry. In this paper, we show that if the feasible set ...