By Topic

A branch-and-bound method for finding independently distributed probability models that satisfy probability order constraints

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

2 Author(s)
B. K. Sy ; Dept. of Syst. Design Eng., Waterloo Univ., Ont., Canada ; Xiao Ying Han

A branch-and-bound method for finding independently distributed probability models is presented. Such models attempt to capture expert preference by (inequality) order relationships and are useful for the development of decision support systems. Finding probability models with independent distributions can be formulated as a linear-constraint optimization problem with a dynamic cost function. A simplex-like algorithm was implemented for branching and bounding between two search spaces on finding the desired models. In these two search spaces, one encompasses all possible independent probability distributions, while the other encompasses all distributions that satisfy all probability order constraints

Published in:

Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation., 1997 IEEE International Conference on  (Volume:1 )

Date of Conference:

12-15 Oct 1997