• norsk
    • English
  • English 
    • norsk
    • English
  • Login
View Item 
  •   Home
  • Faculty of Mathematics and Natural Sciences
  • Department of Informatics
  • Department of Informatics
  • View Item
  •   Home
  • Faculty of Mathematics and Natural Sciences
  • Department of Informatics
  • Department of Informatics
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Solving the pooling problem with LMI relaxations

Frimannslund, Lennart; El Ghami, Mohamed; Alfaki, Mohammed; Haugland, Dag
Chapter, Peer reviewed
Updated version
Thumbnail
View/Open
Solving the pooling problem.pdf (390.6Kb)
URI
https://hdl.handle.net/1956/5853
Date
2012
Metadata
Show full item record
Collections
  • Department of Informatics [882]
Abstract
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 has a nonempty interior, the problem can be solved by a hierarchy of semidefinite relaxations in which the resulting sequences of their optimal values converge to the global optimum. For a fixed relaxation order, this technique provides tight lower bounds for the global objective function value. Based on the experiments, for low order relaxations, the lower bound provided by this method matches the true global optimum in several instances.
Description
A short version of this paper is published in: S. Cafieri, B. G.-Tóth, E. Hendrix, L. Liberti and F. Messine (Eds.), Proceedings of the Toulouse Global Optimization Workshop (pp. 51–54), 2010.
Publisher
The authors
Copyright
Copyright the authors. All rights reserved

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit
 

 

Browse

ArchiveCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsDocument TypesJournalsThis CollectionBy Issue DateAuthorsTitlesSubjectsDocument TypesJournals

My Account

Login

Statistics

View Usage Statistics

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit