Show simple item record

dc.contributor.authorAlfaki, Mohammedeng
dc.contributor.authorHaugland, Dageng
dc.date.accessioned2012-06-15T07:58:11Z
dc.date.available2012-06-15T07:58:11Z
dc.date.issued2011eng
dc.identifier.citationIn: A. Caprara and S. Kontogiannis (Eds.), 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (Vol. 20, pp. 112–121). OpenAccess Series in Informatics (OASIcs).en
dc.identifier.urihttp://hdl.handle.net/1956/5848
dc.description.abstractThe pooling problem is an important global optimization problem which is encountered in many industrial settings. It is traditionally modeled as a bilinear, nonconvex optimization problem, and solved by branch-and-bound algorithms where the subproblems are convex. In some industrial applications, for instance in pipeline transportation of natural gas, a different modeling approach is often made. Rather than defining it as a bilinear problem, the range of qualities is discretized, and the complicating constraints are replaced by linear ones involving integer variables. Consequently, the pooling problem is approximated by a mixed-integer programming problem. With a coarse discretization, this approach represents a saving in computational effort, but may also lead to less accurate modeling. Justified guidelines for choosing between a bilinear and a discrete model seem to be scarce in the pooling problem literature. In the present work, we study discretized versions of models that have been proved to work well when formulated as bilinear programs. Through extensive numerical experiments, we compare the discrete models to their continuous ancestors. In particular, we study how the level of discretization must be chosen if a discrete model is going to be competitive in both running time and accuracy.en
dc.description.sponsorshipThis research was sponsored by the Norwegian Research Council, Gassco, and Statoil under contract 175967/S30.eng
dc.language.isoengeng
dc.publisherDagstuhl Publishingeng
dc.relation.ispartof<a href="http://hdl.handle.net/1956/5847" target="blank">Models and Solution Methods for the Pooling Problem</a>eng
dc.rightsAttribution-NonCommercial-NoDerivs CC BY-NC-NDeng
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/eng
dc.subjectGlobal Optimizationeng
dc.subjectIndustrial Optimizationeng
dc.subjectGraphs and Networkseng
dc.subjectPooling Problemeng
dc.titleComparison of Discrete and Continuous Models for the Pooling Problemeng
dc.typeChaptereng
dc.typePeer reviewedeng
dc.subject.nsiVDP::Mathematics and natural science: 400::Information and communication science: 420eng
dc.rights.holderCopyright Mohammed Alfaki and Dag Haugland; licensed under Creative Commons License NC-ND
dc.type.versionpublishedVersioneng
bora.peerreviewedPeer reviewedeng
bibo.doihttp://dx.doi.org/10.4230/OASIcs.ATMOS.2011.112eng
dc.identifier.doihttp://dx.doi.org/10.4230/OASIcs.ATMOS.2011.112
dcterms.isPartOfhttp://hdl.handle.net/1956/5847


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs CC BY-NC-ND
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs CC BY-NC-ND