An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull
From MaRDI portal
Publication:4427352
DOI10.1287/ijoc.10.3.323zbMath1092.65508OpenAlexW1977193656MaRDI QIDQ4427352
Narayana S. Venugopal, Richard V. Helgason, José H. Dulá
Publication date: 16 December 2003
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.10.3.323
Related Items
On the properties of positive spanning sets and positive bases, Parallel processing of the Build Hull algorithm to address the large-scale DEA problem, Combinatorial redundancy detection, Using lexicographic parametric programming for identifying efficient units in DEA, On characterizing the production possibility set for the CCR ratio model in DEA, Generalizing cross redundancy in data envelopment analysis, An algorithm to find the lineality space of the positive hull of a set of vectors, A dimensional decomposition approach to identifying efficient units in large-scale DEA models, Data envelopment analysis and big data, A procedure for large-scale DEA computations, Generating random points (or vectors) controlling the percentage of them that are extreme in their convex (or positive) hull
