Advanced Search
DSpace@MIT

Multi-period optimal network flow and pricing strategy for commodity online retailer

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.advisor Stephen C. Graves. en_US
dc.contributor.author Wang, Jie, S.M. Massachusetts Institute of Technology en_US
dc.contributor.other Massachusetts Institute of Technology. Computation for Design and Optimization Program. en_US
dc.date.accessioned 2010-05-25T20:39:43Z
dc.date.available 2010-05-25T20:39:43Z
dc.date.copyright 2009 en_US
dc.date.issued 2009 en_US
dc.identifier.uri http://hdl.handle.net/1721.1/55082
dc.description Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2009. en_US
dc.description Cataloged from PDF version of thesis. en_US
dc.description Includes bibliographical references (p. 65). en_US
dc.description.abstract This thesis aims to study the network of a nationwide distributor of a commodity product. As we cannot disclose the actual product for competitive reasons, we will present the research in terms of a similar, representative product, namely salt for ice prevention across United States. The distribution network includes four kinds of nodes, sources, buffer locations at sources, storage points and demand regions. It also includes four types of arcs, from sources to buffer locations and to storage points, from buffer locations to storage points, and from storage points to demand regions. The goal is to maximize the total gross margin subject to a set of supply, demand and inventory constraints. In this thesis, we establish two mathematical models to achieve the goal. The first one is a basic model to identify the optimal flows along the arcs across time by treating product prices and market demand as fixed parameters. The model is built in OPL and solved by CPLEX. We then carry out some numerical analyses and tests to validate the correctness of the model and demonstrate its utility. The second one is an advanced model treating product prices and market demand as additional decision variables. The product price and market demand are related by an exponential function, which makes the model difficult to solve with the available commercial solver codes. We then propose several algorithms to reduce the computational complexity of the model so that we can solve with CPLEX. At last, we compare the algorithms to identify the best one. We provide additional numerical tests to show the benefit from including the pricing decisions along with the optimization of the network flows. en_US
dc.description.statementofresponsibility by Jie Wang. en_US
dc.format.extent 75 p. en_US
dc.language.iso eng en_US
dc.publisher Massachusetts Institute of Technology en_US
dc.rights 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. en_US
dc.rights.uri http://dspace.mit.edu/handle/1721.1/7582 en_US
dc.subject Computation for Design and Optimization Program. en_US
dc.title Multi-period optimal network flow and pricing strategy for commodity online retailer en_US
dc.type Thesis en_US
dc.description.degree S.M. en_US
dc.contributor.department Massachusetts Institute of Technology. Computation for Design and Optimization Program. en_US
dc.identifier.oclc 587583230 en_US


Files in this item

Name Size Format Description
587583230.pdf 9.370Mb PDF Preview, non-printable (open to all)
587583230-MIT.pdf 9.370Mb PDF Full printable version (MIT only)

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage