{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/53127"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/53127","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Optimal dynamic pricing for clearance sales on the spot market","abstract":"In this thesis, we develop an optimal dynamic pricing strategy for clearance sales of a textile manufacturing company which allows last-minute cancellations of orders without penalty. This company faces the difficult task of determining the optimal prices to clear the unsold products which result from last-minute order cancellations of its customers. The presented results in this thesis provide the company with a mathematical tool which can be used to optimally and dynamically set prices to maximize the profits in the clearance sales. We assume that buyers are myopic, demand multiple units of products and have independent demand. We also assume that the company has limited information on the valuation of buyers. Using these assumptions, an analytical model and estimations from the historical data are developed and dynamic programming is used to devise an optimal dynamic pricing strategy for the clearance sales of the company.","abstract_html":"In this thesis, we develop an optimal dynamic pricing strategy for clearance sales of a textile manufacturing company which allows last-minute cancellations of orders without penalty. This company faces the difficult task of determining the optimal prices to clear the unsold products which result from last-minute order cancellations of its customers. The presented results in this thesis provide the company with a mathematical tool which can be used to optimally and dynamically set prices to maximize the profits in the clearance sales. We assume that buyers are myopic, demand multiple units of products and have independent demand. We also assume that the company has limited information on the valuation of buyers. Using these assumptions, an analytical model and estimations from the historical data are developed and dynamic programming is used to devise an optimal dynamic pricing strategy for the clearance sales of the company.","abstract_has_math":false,"creators":["Ileri, Fırat"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Stanley B. Gershwin."],"committee_chairs":[],"committee_members":[],"year":2009,"date_issued":"2009","date_published":"2009","updated_at":"2026-07-22T22:20:57Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"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."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/53127","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Stanley B. Gershwin."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Ileri, Fırat"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2010-03-25T15:04:38Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2010-03-25T15:04:38Z"]},{"key":"dc:date.issued","label":"Date","values":["2009"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["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."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/53127"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.","Includes bibliographical references (p. 79)."]},{"key":"dc:description.abstract","label":"Abstract","values":["In this thesis, we develop an optimal dynamic pricing strategy for clearance sales of a textile manufacturing company which allows last-minute cancellations of orders without penalty. This company faces the difficult task of determining the optimal prices to clear the unsold products which result from last-minute order cancellations of its customers. The presented results in this thesis provide the company with a mathematical tool which can be used to optimally and dynamically set prices to maximize the profits in the clearance sales. We assume that buyers are myopic, demand multiple units of products and have independent demand. We also assume that the company has limited information on the valuation of buyers. Using these assumptions, an analytical model and estimations from the historical data are developed and dynamic programming is used to devise an optimal dynamic pricing strategy for the clearance sales of the company."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:title","label":"Title","values":["Optimal dynamic pricing for clearance sales on the spot market"]}]}],"canonical_facts":{"dc:contributor.advisor":["Stanley B. Gershwin."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Ileri, Fırat"],"dc:date.accessioned":["2010-03-25T15:04:38Z"],"dc:date.available":["2010-03-25T15:04:38Z"],"dc:date.issued":["2009"],"dc:description":["Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.","Includes bibliographical references (p. 79)."],"dc:description.abstract":["In this thesis, we develop an optimal dynamic pricing strategy for clearance sales of a textile manufacturing company which allows last-minute cancellations of orders without penalty. This company faces the difficult task of determining the optimal prices to clear the unsold products which result from last-minute order cancellations of its customers. The presented results in this thesis provide the company with a mathematical tool which can be used to optimally and dynamically set prices to maximize the profits in the clearance sales. We assume that buyers are myopic, demand multiple units of products and have independent demand. We also assume that the company has limited information on the valuation of buyers. Using these assumptions, an analytical model and estimations from the historical data are developed and dynamic programming is used to devise an optimal dynamic pricing strategy for the clearance sales of the company."],"dc:description.degree":["M.Eng."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/53127"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"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."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Optimal dynamic pricing for clearance sales on the spot market"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:20:57Z"}