Maximum utility product pricing models and algorithms based on reservation price

DOI10.1007/S10589-009-9254-5MaRDI QIDQ535296zbMATH OpenOpenAlexFDO

Authors Romy Shioda, Levent Tunçel, T. 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 programmingrevenue managementproduct pricing

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 6383426
• Consumer choice modelling in product line pricing: reservation prices and discrete choice theory
• Dynamic pricing policy of the seasonal products based on revenue management
• Technical note -- Optimal pricing under multiple-discrete customer choices and diminishing return of consumption
• Optimal dynamic price selection under attraction choice models

Cites work

• scientific article; zbMATH DE number 6383426 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 921431 (Why is no real title available?)
• A Nonparametric Approach to Multiproduct Pricing
• A Primal Algorithm to Solve Network Flow Problems with Convex Costs
• A smoothing heuristic for a bilevel pricing problem
• Lifted flow cover inequalities for mixed 0-1 integer programs
• Note on Weintraub’s Minimum-Cost Circulation Algorithm
• On profit-maximizing envy-free pricing
• Optimal Bundle Pricing
• Product line selection and pricing under a share-of-surplus choice model.
• The theory and practice of revenue management
• Tightening simple mixed-integer sets with guaranteed bounds
• Valid Linear Inequalities for Fixed Charge Problems

Cited in

(18)

• The rank pricing problem: models and branch-and-cut algorithms
• 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
• The envy-free pricing problem and unit-demand markets
• Consumer choice modelling in product line pricing: reservation prices and discrete choice theory
• Product line pricing for services with capacity constraints and dynamic substitution
• Optimal product line pricing in the presence of budget-constrained consumers
• Optimizing assortment and pricing of multiple retail categories with cross-selling
• Mixed-integer formulations for the capacitated rank pricing problem with envy
• scientific article; zbMATH DE number 6383426 (Why is no real title available?)
• Bilevel programming and price setting problems
• Efficient heuristic algorithms for maximum utility product pricing problems
• On envy-free perfect matching
• Product line optimization with multiples sites
• A survey on mixed-integer programming techniques in bilevel optimization
• Equilibrium strategies and pricing for a congested system with opaque price and loss-averse customers
• Valid inequalities and branch-and-cut for the clique pricing problem
• Bilevel programming and price setting problems

Describes a project that uses

Uses Software

• CPLEX

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q535296)