Maximum utility product pricing models and algorithms based on reservation price
DOI10.1007/S10589-009-9254-5zbMATH Open1231.91105OpenAlexW2162835374MaRDI QIDQ535296FDOQ535296
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
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
Management decision making, including multiple objectives (90B50) Utility theory (91B16) Mixed integer programming (90C11) Microeconomic theory (price theory and economic markets) (91B24)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On profit-maximizing envy-free pricing
- The theory and practice of revenue management
- Optimal Bundle Pricing
- Product line selection and pricing under a share-of-surplus choice model.
- A Nonparametric Approach to Multiproduct Pricing
- Valid Linear Inequalities for Fixed Charge Problems
- Title not available (Why is that?)
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Tightening simple mixed-integer sets with guaranteed bounds
- A smoothing heuristic for a bilevel pricing problem
- Note on Weintraub’s Minimum-Cost Circulation Algorithm
- A Primal Algorithm to Solve Network Flow Problems with Convex Costs
Cited In (17)
- 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
- 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
- Bilevel programming and price setting problems
- Title not available (Why is that?)
- Mixed-integer formulations for the capacitated rank pricing problem with envy
- The Envy-Free Pricing Problem and Unit-Demand Markets
- Efficient heuristic algorithms for maximum utility product pricing problems
- On envy-free perfect matching
- A survey on mixed-integer programming techniques in bilevel optimization
- Product line optimization with multiples sites
- 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
Uses Software
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)
