Problem with Optimum Mix of All Positive Binaries


 
Poster un nouveau sujet  Répondre au sujet   Ultimate-Gamers Index du Forum » Autres » Logiciels
Sujet précédent :: Sujet suivant  
Auteur Message
JoeClark
Gamer Moyen
Gamer Moyen


Hors ligne

Inscrit le: 01 Oct 2017
Messages: 149
Garçon Nintendo Wii

MessagePosté le: Sam 4 Nov - 13:59 (2017)    Sujet du message: Problem with Optimum Mix of All Positive Binaries Répondre en citant
Hello,


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?




Please help...




I didn't find the right solution from the Internet.
References
https://sawtoothsoftware.com/forum/15734/problem-with-optimum-mix-of-all-po…
Product Launch
MSN
Auteur Message
Publicité




MessagePosté le: Sam 4 Nov - 13:59 (2017)    Sujet du message: Publicité
PublicitéSupprimer les publicités ?
Poster un nouveau sujet  Répondre au sujet   Ultimate-Gamers Index du Forum » Logiciels

Page 1 sur 1
Toutes les heures sont au format GMT + 1 Heure

Montrer les messages depuis:

  

Sauter vers:  
Portail | Index | Creer un forum | Forum gratuit d’entraide | Annuaire des forums gratuits | Signaler une violation | Conditions générales d'utilisation | Contact