Optimal Diagnostic Questionnaires

George T. Duncan
Additional contact information
George T. Duncan: Carnegie-Mellon University, Pittsburgh, Pennsylvania

Operations Research, 1975, vol. 23, issue 1, 22-32

Abstract: This paper develops dynamic-programming and other shortest-route algorithms for optimizing sequentially patterned questioning procedures, called diagnostic questionnaires. It uses graph-theoretic methods and solves certain combinatorial problems associated with the Catalan numbers. The paper obtains general properties of optimal questionnaires, including an ordering relation, a convexity result, and the determination of essentially complete classes of questionnaires. It explores a logarithmic charging scheme in detail and obtains a minimal result. Finally, the paper examines the relation with Huffman coding of information theory, and a simple method of Shannon efficiency.

Date: 1975
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.23.1.22 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:23:y:1975:i:1:p:22-32

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().