Inscrit le: 16 Oct 2017
|Posté le: Mer 8 Nov - 07:07 (2017) Sujet du message: Problem with Optimum Mix of All Positive Binaries
Imagine a client is testing a new drug claim mix.
They would like to maximize the appeal regardless of price or anything else that could counterbalance claims. All things in test are positive.
They are looking for the best 5-item mix out of the following:
30 potential health claims.
So the desing has 30 binary attributes
Is there a way to push the search algorithm to stick with 5-item limit because the general rule is the more claims you include the better it is.
Problem like that were typically managed by restructuring HBU file and turning 30 binaries into either 5 big 30-level attributes or just one 30-level attributes but running 5- product scenario.
But I've just learned this doesn't really work very nicely with RFC which takes diffrernce in conjoint structures and translate into 10%+ difference in resulting shares.
So the question is, how to implement the constrain for search like this under RFC?
I didn't find the right solution from the Internet.