The nonstandard algorithm for constructing efficient conjoint experimental designs

DOI10.2298/YJOR0801063KMaRDI QIDQ3184819zbMATH OpenFDO

Authors Marija Kuzmanović

Publication date 22 October 2009

Published in Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/YJOR0801063K

zbMATH Keywords

conjoint analysisefficiencyMCON softwareoptimality criteria

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• Locally D-Optimal Design for a Logit Model in Discrete Choice Experiment
• Optimal designs for conjoint experiments
• Conjoint optimization: an exact branch-and-bound algorithm for the share-of-choice problem
• A-optimal and A-efficient designs for discrete choice experiments
• Efficiency of the coordinate-exchange algorithm in constructing exact optimal discrete choice experiments

Cited in

(2)

• A new concurrent calibration method for nonequivalent group design under nonrandom assign\-ment
• An algorithmic framework for generating optimal two-stratum experimental designs

This page was built for publication: The nonstandard algorithm for constructing efficient conjoint experimental designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3184819)