Capacitated assortment and price optimization for customers with disjoint consideration sets

DOI10.1016/j.orl.2017.01.009zbMath1409.90109OpenAlexW2585334906MaRDI QIDQ1728178

Hai Jiang, Rui Chen

Publication date: 22 February 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2017.01.009

zbMATH Keywords

assortment optimizationmultinomial logit modeldisjoint consideration setprice optimization

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Fractional programming (90C32) Boolean programming (90C09) Consumer behavior, demand theory (91B42)

Related Items (3)

Assortment optimization with position effects under the nested logit model ⋮ Capacitated assortment and price optimization under the multilevel nested logit model ⋮ Capacitated assortment and price optimization under the nested logit model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On complexity of unconstrained hyperbolic 0--1 programming problems
• Approximation algorithms for fractional knapsack problems
• Capacitated assortment and price optimization under the multinomial logit model
• The Exponomial Choice Model: A New Alternative for Assortment and Price Optimization
• Estimating Primary Demand for Substitutable Products from Sales Transaction Data
• Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
• Technical Note: Mathematical Properties of the Optimal Product Line Selection Problem Using Choice-Based Conjoint Analysis
• An Algorithm for Large Zero-One Knapsack Problems
• Approximation algorithms for combinatorial fractional programming problems

This page was built for publication: Capacitated assortment and price optimization for customers with disjoint consideration sets