A method of transferring polyhedron between the intersection-form and the sum-form

DOI10.1016/S0898-1221(01)00100-6zbMath0980.90105WikidataQ127451602 ScholiaQ127451602MaRDI QIDQ5948790

Hong Yan, Quan-Ling Wei

Publication date: 12 November 2001

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

convex combinationpolyhedronintersection-formsum-form

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Computing shadow prices with multiple Lagrange multipliers, Dynamic concept of returns to scales and its characteristics on production frontier in intersection form, Quantile-DEA classifiers with interval data, Determining the Viable Unbounded Polyhedron Under Linear Control Systems, The data envelopment analysis model with intersection form production possibility set, Evaluating returns to scale and congestion by production possibility set in intersection form, A DATA ENVELOPMENT ANALYSIS (DEA) EVALUATION METHOD BASED ON SAMPLE DECISION MAKING UNITS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• An algorithm for enumerating all vertices of a convex polyhedron
• An algorithm for determining redundant inequalities and all solutions to convex polyhedra
• The Complexity of Vertex Enumeration Methods
• A method of transferring cones of intersection form to cones of sum form and its applications in data envelopment analysis models
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Relations between half-space and finitely generated cones in polyhedral cone-ratio DEA models
• Technical Note—Vertex Generation and Cardinality Constrained Linear Programs