{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/55076"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/55076","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Iterative algorithms for a joint pricing and inventory control problem with nonlinear demand functions","abstract":"Price management, production planning and inventory control are important determinants of a firm's profitability. The intense competition brought about by rapid innovation, lean manufacturing time and the internet revolution has compelled firms to adopt a dynamic strategy that involves complex interplay between pricing and production decisions. In this thesis we consider some of these problems and develop computationally efficient algorithms that aim to tackle and optimally solve these problems in a finite amount of time. In the first half of the thesis we consider the joint pricing and inventory control problem in a deterministic and multiperiod setting utilizing the popular log linear demand model. We develop four algorithms that aim to solve the resulting profit maximization problem in a finite amount of time. The developed algorithms are then tested in a variety of settings ranging from small to large instances of trial data. The second half of the thesis deals with setting prices effectively when the customer demand is assumed to follow the multinomial logit demand model, which is the most popular discrete choice demand model. The profit maximization problem (even in the absence of constraints) is non-convex and hard to solve. Despite this fact we develop algorithms that compute the optimal solution efficiently. We test the algorithms we develop in a wide variety of scenarios from small to large customer segment, with and without production/inventory constraints. The last part of the thesis develops solution methods for the joint pricing and inventory control problem when costs are linear and demand follows the multinomial logit model.","abstract_html":"Price management, production planning and inventory control are important determinants of a firm's profitability. The intense competition brought about by rapid innovation, lean manufacturing time and the internet revolution has compelled firms to adopt a dynamic strategy that involves complex interplay between pricing and production decisions. In this thesis we consider some of these problems and develop computationally efficient algorithms that aim to tackle and optimally solve these problems in a finite amount of time. In the first half of the thesis we consider the joint pricing and inventory control problem in a deterministic and multiperiod setting utilizing the popular log linear demand model. We develop four algorithms that aim to solve the resulting profit maximization problem in a finite amount of time. The developed algorithms are then tested in a variety of settings ranging from small to large instances of trial data. The second half of the thesis deals with setting prices effectively when the customer demand is assumed to follow the multinomial logit demand model, which is the most popular discrete choice demand model. The profit maximization problem (even in the absence of constraints) is non-convex and hard to solve. Despite this fact we develop algorithms that compute the optimal solution efficiently. We test the algorithms we develop in a wide variety of scenarios from small to large customer segment, with and without production/inventory constraints. The last part of the thesis develops solution methods for the joint pricing and inventory control problem when costs are linear and demand follows the multinomial logit model.","abstract_has_math":false,"creators":["Mazumdar, Anupam, S.M. Massachusetts Institute of Technology"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Computation for Design and Optimization Program.","school":null,"contributors":[],"advisors":["Georgia Perakis."],"committee_chairs":[],"committee_members":[],"year":2009,"date_issued":"2009","date_published":"2009","updated_at":"2026-07-22T22:21:16Z","subjects":["Computation for Design and Optimization Program."],"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/55076","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Georgia Perakis."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Computation for Design and Optimization Program."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Computation for Design and Optimization Program."]},{"key":"dc:creator","label":"Author","values":["Mazumdar, Anupam, S.M. Massachusetts Institute of Technology"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2010-05-25T20:38:54Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2010-05-25T20:38:54Z"]},{"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":["Computation for Design and Optimization Program."]}]},{"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/55076"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2009.","Cataloged from PDF version of thesis.","Includes bibliographical references (p. 79-81)."]},{"key":"dc:description.abstract","label":"Abstract","values":["Price management, production planning and inventory control are important determinants of a firm's profitability. The intense competition brought about by rapid innovation, lean manufacturing time and the internet revolution has compelled firms to adopt a dynamic strategy that involves complex interplay between pricing and production decisions. In this thesis we consider some of these problems and develop computationally efficient algorithms that aim to tackle and optimally solve these problems in a finite amount of time. In the first half of the thesis we consider the joint pricing and inventory control problem in a deterministic and multiperiod setting utilizing the popular log linear demand model. We develop four algorithms that aim to solve the resulting profit maximization problem in a finite amount of time. The developed algorithms are then tested in a variety of settings ranging from small to large instances of trial data. The second half of the thesis deals with setting prices effectively when the customer demand is assumed to follow the multinomial logit demand model, which is the most popular discrete choice demand model. The profit maximization problem (even in the absence of constraints) is non-convex and hard to solve. Despite this fact we develop algorithms that compute the optimal solution efficiently. We test the algorithms we develop in a wide variety of scenarios from small to large customer segment, with and without production/inventory constraints. The last part of the thesis develops solution methods for the joint pricing and inventory control problem when costs are linear and demand follows the multinomial logit model."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["S.M."]},{"key":"dc:title","label":"Title","values":["Iterative algorithms for a joint pricing and inventory control problem with nonlinear demand functions"]}]}],"canonical_facts":{"dc:contributor.advisor":["Georgia Perakis."],"dc:contributor.department":["Massachusetts Institute of Technology. Computation for Design and Optimization Program."],"dc:contributor.other":["Massachusetts Institute of Technology. Computation for Design and Optimization Program."],"dc:creator":["Mazumdar, Anupam, S.M. Massachusetts Institute of Technology"],"dc:date.accessioned":["2010-05-25T20:38:54Z"],"dc:date.available":["2010-05-25T20:38:54Z"],"dc:date.issued":["2009"],"dc:description":["Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2009.","Cataloged from PDF version of thesis.","Includes bibliographical references (p. 79-81)."],"dc:description.abstract":["Price management, production planning and inventory control are important determinants of a firm's profitability. The intense competition brought about by rapid innovation, lean manufacturing time and the internet revolution has compelled firms to adopt a dynamic strategy that involves complex interplay between pricing and production decisions. In this thesis we consider some of these problems and develop computationally efficient algorithms that aim to tackle and optimally solve these problems in a finite amount of time. In the first half of the thesis we consider the joint pricing and inventory control problem in a deterministic and multiperiod setting utilizing the popular log linear demand model. We develop four algorithms that aim to solve the resulting profit maximization problem in a finite amount of time. The developed algorithms are then tested in a variety of settings ranging from small to large instances of trial data. The second half of the thesis deals with setting prices effectively when the customer demand is assumed to follow the multinomial logit demand model, which is the most popular discrete choice demand model. The profit maximization problem (even in the absence of constraints) is non-convex and hard to solve. Despite this fact we develop algorithms that compute the optimal solution efficiently. We test the algorithms we develop in a wide variety of scenarios from small to large customer segment, with and without production/inventory constraints. The last part of the thesis develops solution methods for the joint pricing and inventory control problem when costs are linear and demand follows the multinomial logit model."],"dc:description.degree":["S.M."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/55076"],"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":["Computation for Design and Optimization Program."],"dc:title":["Iterative algorithms for a joint pricing and inventory control problem with nonlinear demand functions"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:16Z"}