Maximum utility product pricing models and algorithms based on reservation price

DOI10.1007/s10589-009-9254-5zbMath1231.91105MaRDI QIDQ535296

Tunçel, Levent, Romy Shioda, Tor G. J. Myklebust

Publication date: 11 May 2011

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-009-9254-5

zbMATH Keywords

mixed-integer programming; revenue management; product pricing

Mathematics Subject Classification ID

90C11: Mixed integer programming

90B50: Management decision making, including multiple objectives

91B16: Utility theory

91B24: Microeconomic theory (price theory and economic markets)

Related Items

Bilevel programming and price setting problems, Bilevel programming and price setting problems, Optimal product line pricing in the presence of budget-constrained consumers, Optimizing assortment and pricing of multiple retail categories with cross-selling, Efficient heuristic algorithms for maximum utility product pricing problems, Product line pricing for services with capacity constraints and dynamic substitution, Valid inequalities and branch-and-cut for the clique pricing problem, A polyhedral study of the network pricing problem with connected toll arcs, The Envy-Free Pricing Problem and Unit-Demand Markets

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tightening simple mixed-integer sets with guaranteed bounds
• Product line selection and pricing under a share-of-surplus choice model.
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
• The theory and practice of revenue management
• A smoothing heuristic for a bilevel pricing problem
• A Nonparametric Approach to Multiproduct Pricing
• Optimal Bundle Pricing
• Valid Linear Inequalities for Fixed Charge Problems
• Note on Weintraub’s Minimum-Cost Circulation Algorithm
• A Primal Algorithm to Solve Network Flow Problems with Convex Costs