By Topic

Implementing an algorithm to solve large sequential decision analysis models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
C. W. Kirkwood ; Decision & Inf. Syst., Arizona State Univ., Tempe, AZ, USA

An implementation is presented of an algorithm to solve large sequential decision analysis models. This implementation in the Pascal programming language does not use special features of Pascal, and is therefore straightforward to translate into other programming languages. Empirical results show that the algorithm requires only a modest personal computer to quickly solve decision trees with several hundred thousand endpoints. This allows the use of decision analysis methods for a variety of management and engineering decisions that are often considered too complex for decision analysis

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:24 ,  Issue: 10 )