View : 58 Download: 0

Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods

Title
Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods
Authors
Kimizuka M.Kim S.Yamashita M.
Ewha Authors
김선영
SCOPUS Author ID
김선영scopus
Issue Date
2019
Journal Title
Journal of Global Optimization
ISSN
0925-5001JCR Link
Citation
Journal of Global Optimization vol. 75, no. 3, pp. 631 - 654
Keywords
Computational efficiencyLinear programming relaxationPooling problemRescheduling methodSecond order cone relaxationSemidefinite relaxation
Publisher
Springer New York LLC
Indexed
SCI; SCIE; SCOPUS WOS scopus
Document Type
Article
Abstract
The pooling problem is an important industrial problem in the class of network flow problems for allocating gas flow in pipeline transportation networks. For the pooling problem with time discretization, we propose second order cone programming (SOCP) and linear programming (LP) relaxations and prove that they obtain the same optimal value as the semidefinite programming relaxation. Moreover, a rescheduling method is proposed to efficiently refine the solution obtained by the SOCP or LP relaxation. The efficiency of the SOCP and the LP relaxation and the proposed rescheduling method is illustrated with numerical results on the test instances from the work of Nishi in 2010, some large instances and Foulds 3, 4 and 5 test problems. © 2019, Springer Science+Business Media, LLC, part of Springer Nature.
DOI
10.1007/s10898-019-00795-w
Appears in Collections:
자연과학대학 > 수학전공 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE