Efficient formulations for pricing under attraction demand models
From MaRDI portal
Publication:2248752
DOI10.1007/s10107-013-0646-zzbMath1291.91077OpenAlexW1976965402MaRDI QIDQ2248752
Georgia Perakis, Philipp W. Keller, Retsef Levi
Publication date: 27 June 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/103405
Convex programming (90C25) Nonlinear programming (90C30) Microeconomic theory (price theory and economic markets) (91B24) Consumer behavior, demand theory (91B42)
Related Items
Optimizing assortment and pricing of multiple retail categories with cross-selling, Price optimization under the extended nested logit model, Capacitated assortment and price optimization under the nested logit model
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Modeling Language for Mathematical Programming
- On the product line selection problem under attraction choice models of consumer behavior
- An interior-point algorithm for nonconvex nonlinear programming
- Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods
- Market share analysis using semi-parametric attraction models
- The theory and practice of revenue management
- A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
- An Analysis of Bid-Price Controls for Network Revenue Management
- A Column Generation Algorithm for Choice-Based Network Revenue Management
- Dynamic Pricing in the Presence of Inventory Considerations: Research Overview, Current Practices, and Future Directions
- Joint Inventory and Pricing Decisions for an Assortment
- Ambiguous Risk Measures and Optimal Robust Portfolios
- Parameter-free convex equivalent and dual programs of fractional programming problems
- Optimizing Multinomial Logit Profit Functions
- A Multiproduct Dynamic Pricing Problem and Its Applications to Network Yield Management
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
