Dear Community,
I have a problem I am trying to code in R.
Suppose there are 7 products and each have a ROI value attached to it.
There are 400 representatives who calls 150,000 customers with these
product detailing and achieve sales through the calls.
There is a cost per call and revenue earned from the call.
Constraint is revenue should be greater than the cost.
Now there can be at most 7 choose 3 = 35 poduct combinations that is
possible and each call can at most detail upto 4 products.
Now my problem is to construct a code which will take all possible product
combinations following the above rule so that ROI is maximized. Note that
we have ROI for each product and each product have many segments so ROI is
in fact available for each segment within a product. A customer can be
simulteneously in any segment in any product. That mean if product 7 has 20
segments and product 5 has 30 segments a customer can simulteneously belong
to segment #19 of product 7 and segment # 29 of the prodyct 5.
Goal is to find product combinations and target customers such that the ROI
is maximized. A customer can be called multiple times but not more than 27
calls.
Regards
Chandra
[[alternative HTML version deleted]]
______________________________________________
R-help@r-project.org mailing list
https://stat.ethz.ch/mailman/listinfo/r-help
PLEASE do read the posting guide http://www.R-project.org/posting-guide.html
and provide commented, minimal, self-contained, reproducible code.
