A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space

DOI10.1016/0377-2217(94)00366-1zbMath0912.90217OpenAlexW1977222244MaRDI QIDQ1268269

Richard V. Helgason, José H. Dulá

Publication date: 25 May 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00366-1

zbMATH Keywords

data envelopment analysisframeredundancyconvex hull problemextreme points of the polytope

Mathematics Subject Classification ID

Decision theory (91B06) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Computational aspects related to convexity (52B55) Linear programming (90C05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items

Parallel processing of the Build Hull algorithm to address the large-scale DEA problem ⋮ Using lexicographic parametric programming for identifying efficient units in DEA ⋮ On ill-conceived initialization in archetypal analysis ⋮ Efficiency evaluation of very large-scale samples: data envelopment analysis with angle-index synthesis ⋮ Competing output-sensitive frame algorithms ⋮ On characterizing the production possibility set for the CCR ratio model in DEA ⋮ Generalizing cross redundancy in data envelopment analysis ⋮ Improving envelopment in data envelopment analysis under variable returns to scale ⋮ A dimensional decomposition approach to identifying efficient units in large-scale DEA models ⋮ Data envelopment analysis and big data ⋮ Postprocessing and sparse blind source separation of positive and partially overlapped data ⋮ A procedure for large-scale DEA computations ⋮ A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space ⋮ Evaluating Returns to Scale and Convexity in DEA Via Bootstrap: A Case Study with Brazilian Port Terminals ⋮ Generating random points (or vectors) controlling the percentage of them that are extreme in their convex (or positive) hull

Uses Software

• XMP

Cites Work

• Unnamed Item
• Unnamed Item
• Measuring the efficiency of decision making units
• Finding duplicate rows in a linear programming model
• A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space
• Geometry of optimal value functions with applications to redundancy in linear programming
• A note on finding extreme points in multivariate space
• Designing a majorization scheme for the recourse function in two-stage stochastic linear programming
• Preprocessing in Stochastic Programming: The Case of Linear Programs
• Preprocessing in Stochastic Programming: The Case of Uncapacitated Networks
• On Robust Procedures
• Algorithms for frames and lineality spaces of cones