Algorithms for the Frame of a Finitely Generated Unbounded Polyhedron
From MaRDI portal
Publication:2892275
DOI10.1287/ijoc.1040.0109zbMath1241.90081OpenAlexW2128857555MaRDI QIDQ2892275
No author found.
Publication date: 18 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1040.0109
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (10)
Efficiency evaluation of very large-scale samples: data envelopment analysis with angle-index synthesis ⋮ Competing output-sensitive frame algorithms ⋮ Generalizing cross redundancy in data envelopment analysis ⋮ Improving envelopment in data envelopment analysis under variable returns to scale ⋮ An algorithm to find the lineality space of the positive hull of a set of vectors ⋮ A computational study of DEA with massive data sets ⋮ Preprocessing DEA ⋮ Identifying the anchor points in DEA using sensitivity analysis in linear programming ⋮ Anchor points in DEA ⋮ Generating random points (or vectors) controlling the percentage of them that are extreme in their convex (or positive) hull
This page was built for publication: Algorithms for the Frame of a Finitely Generated Unbounded Polyhedron
