The CONEstrip Algorithm
Uncertainty models such as sets of desirable gambles and (conditional) lower previsions can be represented as convex cones. Checking the consistency of and drawing inferences from such models requires solving feasibility and optimization problems. We consider finitely generated such models. For closed cones, we can use linear programming; for conditional lower prevision-based cones, there is an efficient algorithm using an iteration of linear programs. We present an efficient algorithm for general cones that also uses an iteration of linear programs.
KeywordsConsistency convex cones feasibility inference linear programming
Unable to display preview. Download preview PDF.
- 4.Quaeghebeur, E.: Desirability. In: Coolen, F.P.A., Augustin, T., De Cooman, G., Troffaes, M.C.M. (eds.) Introduction to Imprecise Probabilities. John Wiley & Sons, Ltd., New York City (at the editor)Google Scholar
- 5.Quaeghebeur, E.: murasyp: Python software for accept/reject statement-based uncertainty modeling (in progress), http://equaeghe.github.com/murasyp
- 6.Quaeghebeur, E., De Cooman, G., Hermans, F.: Accept & reject statement-based uncertainty models (in preparation)Google Scholar