Maximum utility product pricing models and algorithms based on reservation price

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

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

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 programmingrevenue managementproduct pricing

Mathematics Subject Classification ID

Mixed integer programming (90C11) Management decision making, including multiple objectives (90B50) Utility theory (91B16) Microeconomic theory (price theory and economic markets) (91B24)

Related Items (16)

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 ⋮ The Envy-Free Pricing Problem and Unit-Demand Markets ⋮ Mixed-integer formulations for the capacitated rank pricing problem with envy ⋮ On envy-free perfect matching ⋮ Product line optimization with multiples sites ⋮ Equilibrium strategies and pricing for a congested system with opaque price and loss-averse customers ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ Product line pricing for services with capacity constraints and dynamic substitution ⋮ The rank pricing problem: models and branch-and-cut algorithms ⋮ Valid inequalities and branch-and-cut for the clique pricing problem ⋮ The envy-free pricing problem, unit-demand markets and connections with the network pricing problem ⋮ A polyhedral study of the network pricing problem with connected toll arcs ⋮ Bilevel programming and price setting problems ⋮ Bilevel programming and price setting problems

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

This page was built for publication: Maximum utility product pricing models and algorithms based on reservation price