On the Optimal Product Line Selection Problem with Price Discrimination
Product line design decisions are determinant for a firm's market success and, simultaneously, very costly to implement and change. To evaluate the profitability of a design, a number of mathematical programming approaches have been proposed in the last three decades--typically nonlinear integer optimization problems that can only be tackled heuristically for real-world instances. Recently, Chen and Hausman (2000) efficiently exploited the fractional programming properties of a stylized model for product line and price selection with the objective to maximize contribution given homogeneous customer behavior by an aggregate multinomial logit choice model. We extend the approach of Chen and Hausman (Chen, K. D., W. H. Hausman. 2000. Technical note: Mathematical properties of the optimal product line selection problem using choice-based conjoint analysis. Management Sci. 46(2) 327-332) to determine an optimal product line under a personalized or group pricing strategy in markets with multiple heterogeneous consumers such that total profit (including fixed costs) is maximized. Personalized/group pricing is a growing discrimination strategy that more and more businesses are realizing is not only very profitable, but also often implementable in the era of e-business. Our problem formulation allows to incorporate commonly applied attraction choice models including the multinomial logit, the Bradley-Terry-Luce, and approximately the first choice model. Though the problem is generally nonlinear, we show that the fractional substructure resulting from attraction choice models can still be exploited to globally solve real-world instances in reasonable time.
Volume (Year): 56 (2010)
Issue (Month): 5 (May)
|Contact details of provider:|| Postal: |
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:56:y:2010:i:5:p:896-902. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.