Algorithms for Marketing-Mix Optimization

Details Algorithms for Marketing-Mix Optimization Algorithms for Marketing-Mix Optimization

2009-03-02

arxiv.org/abs/0903.0308v1

Computer Science

Computational Geometry

12 pages, 4 figures

Scientific paper

Algorithms for determining quality/cost/price tradeoffs in saturated markets are considered. A product is modeled by $d$ real-valued qualities whose sum determines the unit cost of producing the product. This leads to the following optimization problem: given a set of $n$ customers, each of whom has certain minimum quality requirements and a maximum price they are willing to pay, design a new product and select a price for that product in order to maximize the resulting profit. An $O(n\log n)$ time algorithm is given for the case, $d=1$, of linear products, and $O(n(\log n)^{d+1})$ time approximation algorithms are given for products with any constant number, $d$, of qualities. To achieve the latter result, an $O(nk^{d-1})$ bound on the complexity of an arrangement of homothetic simplices in $\R^d$ is given, where $k$ is the maximum number of simplices that all contain a single points.

Affiliated with

Also associated with

No associations

Rating

Algorithms for Marketing-Mix Optimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algorithms for Marketing-Mix Optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms for Marketing-Mix Optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-78218