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

Computers and Mathematics with Applications

Volumn 41, Issue 10-11, 2001, Pages 1327-1342

  Wei, Quanling ^a   Yan, Hong ^b  

^a RENMIN UNIVERSITY OF CHINA   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Convex combination; Intersection form; Polyhedron; Sum form

Indexed keywords

COMPUTATION THEORY; ITERATIVE METHODS;

BOUNDED POLYHEDRON; CONVEX COMBINATION; POLYHEDRON TRANSFER;

LINEAR PROGRAMMING;

EID: 0035341770     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(01)00100-6     Document Type: Article

References (13)

1. A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
2. An algorithm for enumerating all vertices of a convex polyhedron
3. Relations between half-space and finitely generated cones in polyhedral cone-ratio DEA models
4. The complexity of vertex enumeration methods
5. An algorithm for determining redundant inequalities and all solutions on polyhedra
6. The double description method
7. Vertex generation and cardinaltiy constrained linear programs
8. Constructing higher-dimensional convex hulls at logarithmic cost per face
9. A method of transferring cones of intersection-form to cones of sum-form and its applications in DEA models