On efficiency in convex hull of DMUs

Measuring Interval Efficiency in Convex Hull of Data Using DEA

measuring interval efficiency in convex hull of data using dea

0

On Sumsets and Convex Hull

One classical result of Freiman gives the optimal lower bound for the cardinality of A + A if A is a d-dimensional finite set in R. Matolcsi and Ruzsa have recently generalized this lower bound to |A+ kB| if B is d-dimensional, and A is contained in the convex hull of B. We characterize the equality case of the Matolcsi–Ruzsa bound. The argument is based partially on understanding triangulation...

On Constructing Approximate Convex Hull

The algorithms of convex hull have been extensively studied in literature, principally because of their wide range of applications in different areas. This article presents an efficient algorithm to construct approximate convex hull from a set of n points in the plane in O(n+ k) time, where k is the approximation error control parameter. The proposed algorithm is suitable for applications prefe...

On the convex hull of projective planes

We study the finite projective planes with linear programming models. We give a complete description of the convex hull of the finite projective planes of order 2. We give some integer linear programming models whose solution are, either a finite projective (or affine) plane of order n, or a (n + 2)-arc.