{"id":{"repo_id":"cornell","oai_identifier":"oai:ecommons.cornell.edu:1813/67280"},"canonical_url":"https://search.ndltd.org/etd/cornell/oai:ecommons.cornell.edu:1813/67280","repository":{"repo_id":"cornell","name":"Cornell University","base_url":"https://ecommons.cornell.edu/server/oai/request"},"display":{"title":"Capturing Product Complementarity in Assortment Optimization","abstract":"We study three assortment optimization problems that reflect the current retail environment. The goal of these problems is to compute an assortment which maximizes the retailer’s expected revenue or profit, depending on the scenario. For each problem, we present efficient algorithms to compute the optimal assortment, or prove that the problem is NP-hard and provide an approximation algorithm. First, we study assortment optimization for an omnichannel retailer, who operates both an online store and a physical store offline. The retailer selects a subset of products from the online store to offer in the physical store, knowing that customers can visit the physical store to observe products and update preferences for similar products offered online. We introduce a features tree to organize products by their shared features, and describe how customers update their preferences for online products. Second, we study assortment optimization when certain products look more attractive if they are offered alongside in the assortment. For example, by observing a lower quality product, customers may perceive an increase in value for a target product. We call this effect synergy and introduce a synergy graph to describe the synergy structure between products. We classify the difficulty of the synergistic assortment optimization problem based on the synergy graph. Finally, we study assortment optimization with dynamic substitution and inventory stocking costs. This problem considers customers who arrive over a finite selling horizon to make a purchasing decision amongst the products that have not stocked-out. The retailer does not have the ability to modify the assortment seen by each arriving customer. Hence, the assortment that each customer purchases from depends on the initial assortment and stocking decisions of the retailer, as well as the purchasing decisions of the preceding customers.","abstract_html":"We study three assortment optimization problems that reflect the current retail environment. The goal of these problems is to compute an assortment which maximizes the retailer’s expected revenue or profit, depending on the scenario. For each problem, we present efficient algorithms to compute the optimal assortment, or prove that the problem is NP-hard and provide an approximation algorithm. First, we study assortment optimization for an omnichannel retailer, who operates both an online store and a physical store offline. The retailer selects a subset of products from the online store to offer in the physical store, knowing that customers can visit the physical store to observe products and update preferences for similar products offered online. We introduce a features tree to organize products by their shared features, and describe how customers update their preferences for online products. Second, we study assortment optimization when certain products look more attractive if they are offered alongside in the assortment. For example, by observing a lower quality product, customers may perceive an increase in value for a target product. We call this effect synergy and introduce a synergy graph to describe the synergy structure between products. We classify the difficulty of the synergistic assortment optimization problem based on the synergy graph. Finally, we study assortment optimization with dynamic substitution and inventory stocking costs. This problem considers customers who arrive over a finite selling horizon to make a purchasing decision amongst the products that have not stocked-out. The retailer does not have the ability to modify the assortment seen by each arriving customer. Hence, the assortment that each customer purchases from depends on the initial assortment and stocking decisions of the retailer, as well as the purchasing decisions of the preceding customers.","abstract_has_math":false,"creators":["Lo, Venus Hiu Ling"],"institution":"Cornell University","degree_name":"Ph.D., Operations Research and Information Engineering","degree_level":"Doctor of Philosophy","degree_discipline":"Operations Research and Information Engineering","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":["Topaloglu, Huseyin"],"committee_members":["Iyer, Krishnamurthy","Banerjee, Siddhartha"],"year":2019,"date_issued":"2019-05-30","date_published":"2019-05-30","updated_at":"2026-11-19T03:20:35Z","subjects":["Operations research","assortment optimization","revenue management"],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.7298/qkxf-d595"],"render_values":[{"text":"https://doi.org/10.7298/qkxf-d595","href":"https://doi.org/10.7298/qkxf-d595","code":true}]},{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["11050262"],"render_values":[{"text":"11050262","href":null,"code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["ProQuest Submission ID: 11428","ProQuest Publication ID: 13882813"],"render_values":[{"text":"ProQuest Submission ID: 11428","href":null,"code":true},{"text":"ProQuest Publication ID: 13882813","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1813/67280","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/1813/67280","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://ecommons.cornell.edu/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aecommons.cornell.edu%3A1813%2F67280","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.chair","label":"Chair","values":["Topaloglu, Huseyin"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Iyer, Krishnamurthy","Banerjee, Siddhartha"]},{"key":"dc:creator","label":"Author","values":["Lo, Venus Hiu Ling"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2019-10-15T15:28:59Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2019-10-15T15:28:59Z"]},{"key":"dc:date.issued","label":"Date","values":["2019-05-30"]},{"key":"dc:type","label":"Dc Type","values":["dissertation or thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Operations Research and Information Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Doctor of Philosophy"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D., Operations Research and Information Engineering"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Cornell University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Operations research","assortment optimization","revenue management"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["11050262"]},{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.7298/qkxf-d595"]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["ProQuest Submission ID: 11428","ProQuest Publication ID: 13882813"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1813/67280"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"cerif:openaire","label":"Cerif Openaire","values":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"4a9cd74f-9201-4df9-a624-12d0f2de178b\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en_US</Language> <Title>Capturing Product Complementarity in Assortment Optimization</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2019-05-30</PublicationDate> <DOI>https://doi.org/10.7298/qkxf-d595</DOI> <Authors> <Author> <DisplayName>Lo, Venus Hiu Ling</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <Keyword>Operations research</Keyword> <Keyword>assortment optimization</Keyword> <Keyword>revenue management</Keyword> <Abstract>We study three assortment optimization problems that reflect the current retail environment. The goal of these problems is to compute an assortment which maximizes the retailer’s expected revenue or profit, depending on the scenario. For each problem, we present efficient algorithms to compute the optimal assortment, or prove that the problem is NP-hard and provide an approximation algorithm. First, we study assortment optimization for an omnichannel retailer, who operates both an online store and a physical store offline. The retailer selects a subset of products from the online store to offer in the physical store, knowing that customers can visit the physical store to observe products and update preferences for similar products offered online. We introduce a features tree to organize products by their shared features, and describe how customers update their preferences for online products. Second, we study assortment optimization when certain products look more attractive if they are offered alongside in the assortment. For example, by observing a lower quality product, customers may perceive an increase in value for a target product. We call this effect synergy and introduce a synergy graph to describe the synergy structure between products. We classify the difficulty of the synergistic assortment optimization problem based on the synergy graph. Finally, we study assortment optimization with dynamic substitution and inventory stocking costs. This problem considers customers who arrive over a finite selling horizon to make a purchasing decision amongst the products that have not stocked-out. The retailer does not have the ability to modify the assortment seen by each arriving customer. Hence, the assortment that each customer purchases from depends on the initial assortment and stocking decisions of the retailer, as well as the purchasing decisions of the preceding customers.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"]},{"key":"cris:virtual.author","label":"Cris Virtual Author","values":["Lo, Venus Hiu Ling"]},{"key":"cris:virtualsource.collection","label":"Cris Virtualsource Collection","values":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"]},{"key":"dc:description.abstract","label":"Abstract","values":["We study three assortment optimization problems that reflect the current retail environment. The goal of these problems is to compute an assortment which maximizes the retailer’s expected revenue or profit, depending on the scenario. For each problem, we present efficient algorithms to compute the optimal assortment, or prove that the problem is NP-hard and provide an approximation algorithm. First, we study assortment optimization for an omnichannel retailer, who operates both an online store and a physical store offline. The retailer selects a subset of products from the online store to offer in the physical store, knowing that customers can visit the physical store to observe products and update preferences for similar products offered online. We introduce a features tree to organize products by their shared features, and describe how customers update their preferences for online products. Second, we study assortment optimization when certain products look more attractive if they are offered alongside in the assortment. For example, by observing a lower quality product, customers may perceive an increase in value for a target product. We call this effect synergy and introduce a synergy graph to describe the synergy structure between products. We classify the difficulty of the synergistic assortment optimization problem based on the synergy graph. Finally, we study assortment optimization with dynamic substitution and inventory stocking costs. This problem considers customers who arrive over a finite selling horizon to make a purchasing decision amongst the products that have not stocked-out. The retailer does not have the ability to modify the assortment seen by each arriving customer. Hence, the assortment that each customer purchases from depends on the initial assortment and stocking decisions of the retailer, as well as the purchasing decisions of the preceding customers."]},{"key":"dc:description.collection","label":"Dc Description Collection","values":["Cornell Theses and Dissertations"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dcterms:license","label":"Dcterms License","values":["https://hdl.handle.net/1813/59810"]},{"key":"dc:title","label":"Title","values":["Capturing Product Complementarity in Assortment Optimization"]},{"key":"dspace:entity.type","label":"Dspace Entity Type","values":["Publication"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"cerif:openaire":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"4a9cd74f-9201-4df9-a624-12d0f2de178b\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en_US</Language> <Title>Capturing Product Complementarity in Assortment Optimization</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2019-05-30</PublicationDate> <DOI>https://doi.org/10.7298/qkxf-d595</DOI> <Authors> <Author> <DisplayName>Lo, Venus Hiu Ling</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <Keyword>Operations research</Keyword> <Keyword>assortment optimization</Keyword> <Keyword>revenue management</Keyword> <Abstract>We study three assortment optimization problems that reflect the current retail environment. The goal of these problems is to compute an assortment which maximizes the retailer’s expected revenue or profit, depending on the scenario. For each problem, we present efficient algorithms to compute the optimal assortment, or prove that the problem is NP-hard and provide an approximation algorithm. First, we study assortment optimization for an omnichannel retailer, who operates both an online store and a physical store offline. The retailer selects a subset of products from the online store to offer in the physical store, knowing that customers can visit the physical store to observe products and update preferences for similar products offered online. We introduce a features tree to organize products by their shared features, and describe how customers update their preferences for online products. Second, we study assortment optimization when certain products look more attractive if they are offered alongside in the assortment. For example, by observing a lower quality product, customers may perceive an increase in value for a target product. We call this effect synergy and introduce a synergy graph to describe the synergy structure between products. We classify the difficulty of the synergistic assortment optimization problem based on the synergy graph. Finally, we study assortment optimization with dynamic substitution and inventory stocking costs. This problem considers customers who arrive over a finite selling horizon to make a purchasing decision amongst the products that have not stocked-out. The retailer does not have the ability to modify the assortment seen by each arriving customer. Hence, the assortment that each customer purchases from depends on the initial assortment and stocking decisions of the retailer, as well as the purchasing decisions of the preceding customers.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"],"cris:virtual.author":["Lo, Venus Hiu Ling"],"cris:virtualsource.collection":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"],"dc:contributor.chair":["Topaloglu, Huseyin"],"dc:contributor.committeemember":["Iyer, Krishnamurthy","Banerjee, Siddhartha"],"dc:creator":["Lo, Venus Hiu Ling"],"dc:date.accessioned":["2019-10-15T15:28:59Z"],"dc:date.available":["2019-10-15T15:28:59Z"],"dc:date.issued":["2019-05-30"],"dc:description.abstract":["We study three assortment optimization problems that reflect the current retail environment. The goal of these problems is to compute an assortment which maximizes the retailer’s expected revenue or profit, depending on the scenario. For each problem, we present efficient algorithms to compute the optimal assortment, or prove that the problem is NP-hard and provide an approximation algorithm. First, we study assortment optimization for an omnichannel retailer, who operates both an online store and a physical store offline. The retailer selects a subset of products from the online store to offer in the physical store, knowing that customers can visit the physical store to observe products and update preferences for similar products offered online. We introduce a features tree to organize products by their shared features, and describe how customers update their preferences for online products. Second, we study assortment optimization when certain products look more attractive if they are offered alongside in the assortment. For example, by observing a lower quality product, customers may perceive an increase in value for a target product. We call this effect synergy and introduce a synergy graph to describe the synergy structure between products. We classify the difficulty of the synergistic assortment optimization problem based on the synergy graph. Finally, we study assortment optimization with dynamic substitution and inventory stocking costs. This problem considers customers who arrive over a finite selling horizon to make a purchasing decision amongst the products that have not stocked-out. The retailer does not have the ability to modify the assortment seen by each arriving customer. Hence, the assortment that each customer purchases from depends on the initial assortment and stocking decisions of the retailer, as well as the purchasing decisions of the preceding customers."],"dc:description.collection":["Cornell Theses and Dissertations"],"dc:format.mimetype":["application/pdf"],"dc:identifier.bibid":["11050262"],"dc:identifier.doi":["https://doi.org/10.7298/qkxf-d595"],"dc:identifier.other":["ProQuest Submission ID: 11428","ProQuest Publication ID: 13882813"],"dc:identifier.uri":["https://hdl.handle.net/1813/67280"],"dc:language.iso":["en_US"],"dc:subject":["Operations research","assortment optimization","revenue management"],"dcterms:license":["https://hdl.handle.net/1813/59810"],"dc:title":["Capturing Product Complementarity in Assortment Optimization"],"dc:type":["dissertation or thesis"],"dspace:entity.type":["Publication"],"others:access_status":["open.access"],"thesis:degree_discipline":["Operations Research and Information Engineering"],"thesis:degree_level":["Doctor of Philosophy"],"thesis:degree_name":["Ph.D., Operations Research and Information Engineering"],"thesis:institution_name":["Cornell University"]},"updated_at":"2026-11-19T03:20:35Z"}