Assume we are given a set of parallel line segments in the plane, and wish to place point on each segment such that resulting maximizes or minimizes area largest smallest triangle set. We analyze complexity four computational problems, show three them admit polynomial-time algorithms, while fourth is NP-hard. Specifically, maximizing can be done $O(n^2)$ time (or $O(n \log n)$ for unit segments...

This paper focuses on establishing envelope theorems for convex conditional lower previsions, a recently investigated class of imprecise previsions larger than coherent imprecise conditional previsions. It is in particular discussed how the various theorems can be employed in assessing convex previsions. We also consider the problem of dilation for these kinds of imprecise previsions, and point...

The main aim of this paper is to define what imprecise reliability is, and discuss a variety of problems that can be solved by means of a framework of imprecise probabilities. From this point of view, various branches of reliability analysis are considered, including analysis of monotone systems, repairable systems, multi-state systems, structural reliability, software reliability, human reliab...