• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • University Library
      • Bilkent Theses
      • Theses - Department of Industrial Engineering
      • Dept. of Industrial Engineering - Master's degree
      • View Item
      •   BUIR Home
      • University Library
      • Bilkent Theses
      • Theses - Department of Industrial Engineering
      • Dept. of Industrial Engineering - Master's degree
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Capacitated assortment optimization and pricing problems under mixed multinomial logit model

      Thumbnail
      View / Download
      514.1 Kb
      Author
      Ghaniabadi, Mehdi
      Advisor
      Şen, Alper
      Date
      2016-08
      Publisher
      Bilkent University
      Language
      English
      Type
      Thesis
      Item Usage Stats
      95
      views
      86
      downloads
      Abstract
      We study capacitated assortment optimization problem under mixed multinomial logit model where a retailer wants to choose the set of products to offer to various customer segments with the goal of maximizing revenue while satisfying different capacity constraints. Each customer segment is identiffed with a unique purchase behaviour modelled by multinomial logit demand. We consider three general cases of capacity constraints: single resource constraint, multiple resource constraints and multiple cardinality constraints. This problem is NP-hard and there exist two approaches to find exact solutions: formulating the problem as a mixed integer linear program (MILP) or a mixed integer conic quadratic program (CONIC). For each constraint structure, we develop new efficient procedures to derive McCormick valid inequalities. We provide extensive numerical studies the results of which demonstrate that when the CONIC model is accompanied with the McCormick inequalities, the problem can be solved effectively even for large sized instances using a commercial optimization software. We also study joint pricing and assortment optimization problem with a single cardinality constraint and establish a new procedure to construct McCormick inequalities. We then present the related numerical studies which indicate that the CONIC formulation accomplishes the best outcome in the presence of the McCormick inequalities.
      Keywords
      Assortment optimization
      Mixed multinomial logit
      Capacity constraints
      Pricing
      Conic programming
      Permalink
      http://hdl.handle.net/11693/32170
      Collections
      • Dept. of Industrial Engineering - Master's degree 326
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      Copyright © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy