Efficient Bayesian design - too long to run
Posted: Fri Apr 05, 2024 2:04 am
Dear Ngene users,
I am running the code below and Ngene is taking a long time to find a design. It only found one design with undefined D error after a few minutes and then it still runs without suggesting other designs.
Am I doing something wrong in my code? Should I not run this code through a mfederov algorithm maybe? What should I change?
Thanks in advance for the help!
Best,
\G
I am running the code below and Ngene is taking a long time to find a design. It only found one design with undefined D error after a few minutes and then it still runs without suggesting other designs.
Am I doing something wrong in my code? Should I not run this code through a mfederov algorithm maybe? What should I change?
- Code: Select all
design
;alts = alt1*, alt2*, alt3
;rows = 24
;eff = (mnl,d, mean)
;bdraws = gauss(2)
;block = 4
;alg = mfederov
;reject:
alt2.cost=60000 and alt2.plantation=2,
alt2.cost=60000 and alt2.plantation=3,
alt1.cost=60000 and alt1.plantation=2,
alt1.cost=60000 and alt1.plantation=3
;model:
U(alt1)= b1.dummy[(n, 0.245, 0.290)|(n,0.476, 0.274)]*support[2,3,1] ? 1= none, 2=personalized, 3=collective
+ b2.dummy[(n,1.283,3.593)|(n,-0.011,0.347)]*plantation[2,3,1] ? 1=individual (base), 2= collective autonomous, 3=collective coop
+ b3[(n,-0.251,0.349)]*cost[45000,50000,55000,60000](5-7,5-7,5-7,5-7)
+ b4.dummy[(n,-0.781, 0.264)|(n,-0.658,0.281)]*spraying[2,3,1]
+ b5.dummy[(n,0.373,0.217)]*suivi[2,1]
+ b6[(n,-0.229,0.704)]*cost*plantation.dummy[2] /
U(alt2)= b1*support
+ b2*plantation
+ b3*cost
+ b4*spraying
+ b5*suivi
+ b6*cost*plantation.dummy[2] /
U(alt3)= b0[(n,-2.156,1.940)]
$
Thanks in advance for the help!
Best,
\G