On a calculation of an arbitrary separating hyperplane of convex polyhedral sets

DOI10.1080/02331939808844377zbMATH Open0902.90130OpenAlexW2057842396MaRDI QIDQ4397408FDOQ4397408

Authors: L.Grygarova 

Publication date: 7 July 1998

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939808844377

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

zbMATH Keywords

convex analysisconvex hullconvex polytopeconvex polyhedrapolar coneprojection coneseparating hyperplane

Mathematics Subject Classification ID

Convex programming (90C25) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Computational aspects related to convexity (52B55)

Cites Work

• Convex Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding all vertices of a convex polyhedron
• Title not available (Why is that?)
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
• Redundancy in mathematical programming. A state-of-the-art survey
• An algorithm for determining all extreme points of a convex polytope
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• A Calculation of all Separating Hyperplanes of two Convex Polytopes
• OnR.W. Llewellyn's rules to identify redundant constraints: A detailed critique and some generalizations
• Lineare Optimierung in unendlichdimensionalen Vektorräumen
• The Complexity of Vertex Enumeration Methods
• Title not available (Why is that?)
• Zur Identifikation redundanter Nebenbedingungen in linearen Programmen

Cited In (23)

• Title not available (Why is that?)
• On the separation of parametric convex polyhedral sets with application in MOLP.
• Title not available (Why is that?)
• On the problem polyhedral separability: a numerical solution
• Separation theorems for convex polytopes and finitely-generated cones derived from theorems of the alternative
• On the dimension of a face exposed by proper separation of convex polyhedra
• On a supporting hyperlane for two convex polyhedral sets
• Title not available (Why is that?)
• Separation of integer points by a hyperplane under some weak notions of discrete convexity
• Separation by linear interpolation families
• Checking the convexity of polytopes and the planarity of subdivisions (extended abstract)
• Penumbras and separation of convex sets
• Separating support hyperplanes for a pair of convex polyhedral sets
• Title not available (Why is that?)
• Separation of convex polyhedral sets with column parameters
• Parameter spaces of separating hyperplanes
• Exact separation of \(k\)-projection polytope constraints
• A theorem on strict separability of convex polyhedra and its applications in optimization
• A linear algorithm for determining the separation of convex polyhedra
• Title not available (Why is that?)
• On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube
• Title not available (Why is that?)
• Towards the computation of the convex hull of a configuration from its corresponding separating matrix

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)