2026-09-20T02:47:35Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/466292022-01-13T07:54:36Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

Paul I. Barton and Stephen C. Graves. Armagan, Emre Massachusetts Institute of Technology. Dept. of Mechanical Engineering. Massachusetts Institute of Technology. Department of Mechanical Engineering 2009-08-26T17:08:04Z 2009-08-26T17:08:04Z 2009 2009 http://hdl.handle.net/1721.1/46629 426051889 Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2009. Includes bibliographical references (leaves 153-158). 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. by Emre Armagan. S.M. 158 leaves eng Massachusetts Institute of Technology 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. http://dspace.mit.edu/handle/1721.1/7582 Mechanical Engineering. Decomposition algorithms for global solution of deterministic and stochastic pooling problems in natural gas value chains Thesis application/pdf false Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="e54b15cb-5407-4e3d-8978-85c773b3565e"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>Decomposition algorithms for global solution of deterministic and stochastic pooling problems in natural gas value chains</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2009</PublicationDate> <Authors> <Author> <DisplayName>Armagan, Emre</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Mechanical Engineering.</Keyword> <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.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>