The CONEstrip Algorithm

@inproceedings{Quaeghebeur2012TheCA,
  title={The CONEstrip Algorithm},
  author={Erik Quaeghebeur},
  booktitle={SMPS},
  year={2012}
}
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Probabilistic logic in a coherent setting

G Coletti, R Scozzafava
Kluwer Academic Publishers, • 2002

How Good are Convex Hull Algorithms?

Symposium on Computational Geometry • 1995

Statistical Reasoning with Imprecise Probabilities

P Walley
1991
View 1 Excerpt

Similar Papers

Loading similar papers…