On a calculation of an arbitrary separating hyperplane of convex polyhedral sets
From MaRDI portal
Publication:4397408
Recommendations
- A Calculation of all Separating Hyperplanes of two Convex Polytopes
- Separating support hyperplanes for a pair of convex polyhedral sets
- An algorithmic separating hyperplane theorem and its applications
- Separating hyperplanes of convex sets
- On the dimension of a face exposed by proper separation of convex polyhedra
Cites work
- scientific article; zbMATH DE number 3466802 (Why is no real title available?)
- scientific article; zbMATH DE number 3606241 (Why is no real title available?)
- scientific article; zbMATH DE number 3224188 (Why is no real title available?)
- scientific article; zbMATH DE number 3323651 (Why is no real title available?)
- A Calculation of all Separating Hyperplanes of two Convex Polytopes
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
- An algorithm for determining all extreme points of a convex polytope
- Convex Analysis
- Finding all vertices of a convex polyhedron
- Lineare Optimierung in unendlichdimensionalen Vektorräumen
- OnR.W. Llewellyn's rules to identify redundant constraints: A detailed critique and some generalizations
- Redundancy in mathematical programming. A state-of-the-art survey
- The Complexity of Vertex Enumeration Methods
- Zur Identifikation redundanter Nebenbedingungen in linearen Programmen
Cited in
(24)- scientific article; zbMATH DE number 773010 (Why is no real title available?)
- Separation by linear interpolation families
- On the problem polyhedral separability: a numerical solution
- Separating support hyperplanes for a pair of convex polyhedral sets
- scientific article; zbMATH DE number 3065354 (Why is no real title available?)
- Parameter spaces of separating hyperplanes
- scientific article; zbMATH DE number 2206807 (Why is no real title available?)
- Exact separation of \(k\)-projection polytope constraints
- scientific article; zbMATH DE number 89761 (Why is no real title available?)
- Penumbras and separation of convex sets
- Checking the convexity of polytopes and the planarity of subdivisions (extended abstract)
- Separation theorems for convex polytopes and finitely-generated cones derived from theorems of the alternative
- On the separation of parametric convex polyhedral sets with application in MOLP.
- On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube
- Separating hyperplanes of convex sets
- Separation of integer points by a hyperplane under some weak notions of discrete convexity
- scientific article; zbMATH DE number 5066290 (Why is no real title available?)
- An algorithmic separating hyperplane theorem and its applications
- On the dimension of a face exposed by proper separation of convex polyhedra
- A theorem on strict separability of convex polyhedra and its applications in optimization
- A linear algorithm for determining the separation of convex polyhedra
- On a supporting hyperlane for two convex polyhedral sets
- Towards the computation of the convex hull of a configuration from its corresponding separating matrix
- Separation of convex polyhedral sets with column parameters
This page was built for publication: On a calculation of an arbitrary separating hyperplane of convex polyhedral sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4397408)
