On a calculation of an arbitrary separating hyperplane of convex polyhedral sets
From MaRDI portal
Publication:4397408
DOI10.1080/02331939808844377zbMath0902.90130OpenAlexW2057842396MaRDI QIDQ4397408
Publication date: 7 July 1998
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939808844377
convex polytopeconvex hullconvex analysisconvex polyhedrapolar coneprojection coneseparating hyperplane
Convex programming (90C25) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Computational aspects related to convexity (52B55)
Related Items (5)
On the separation of parametric convex polyhedral sets with application in MOLP. ⋮ Unnamed Item ⋮ Penumbras and separation of convex sets ⋮ Parameter spaces of separating hyperplanes ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Redundancy in mathematical programming. A state-of-the-art survey
- Finding all vertices of a convex polyhedron
- Lineare Optimierung in unendlichdimensionalen Vektorräumen
- The Complexity of Vertex Enumeration Methods
- OnR.W. Llewellyn's rules to identify redundant constraints: A detailed critique and some generalizations
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- Zur Identifikation redundanter Nebenbedingungen in linearen Programmen
- An algorithm for determining all extreme points of a convex polytope
- A Calculation of all Separating Hyperplanes of two Convex Polytopes
- Convex Analysis
- An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
This page was built for publication: On a calculation of an arbitrary separating hyperplane of convex polyhedral sets