Decomposition algorithms for global solution of deterministic and stochastic pooling problems in natural gas value chains
Name
426051889-MIT.pdf
Description
Full printable version
Size
13.99 MB
Format
Adobe PDF
Checksum (MD5)
bfa1d7c1197763f92647c47c74af612b
Author(s)
Armagan, Emre
Advisor(s)
Paul I. Barton and Stephen C. Graves.
Date Issued
2009
Publisher
Massachusetts Institute of Technology
Abstract
In this thesis, a Benders decomposition algorithm is designed and implemented to solve both deterministic and stochastic pooling problems to global optimality. Convergence of the algorithm to a global optimum is proved and then it is implemented both in GAMS and C++ to get the best performance. A series of example problems are solved, both with the proposed Benders decomposition algorithm and commercially available global optimization software to determine the validity and the performance of the proposed algorithm. Moreover, a two stage stochastic pooling problem is formulated to model the optimal capacity expansion problem in pooling networks and the proposed algorithm is applied to this problem to obtain global optimum. A number of example stochastic pooling problems are solved, both with the proposed Benders decomposition algorithm and commercially available global optimization software to determine the validity and the performance of the proposed algorithm applied to stochastic problems.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2009.
Includes bibliographical references (leaves 153-158).
Subjects
Mechanical Engineering.
MIT Department
Massachusetts Institute of Technology. Department of Mechanical Engineering
Terms of Use
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
Persistent DSpace Link
