Separating support hyperplanes for a pair of convex polyhedral sets

DOI10.1080/02331939808844378zbMath0903.90128OpenAlexW2087638359MaRDI QIDQ4397409

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/02331939808844378

zbMATH Keywords

separating hyperplanessupporting hyperplanepolar coneprojection coneconvex polyhedral sets

Mathematics Subject Classification ID

Convex programming (90C25) Computational aspects related to convexity (52B55) Nonconvex programming, global optimization (90C26)

Related Items (2)

On the separation of parametric convex polyhedral sets with application in MOLP. ⋮ Parameter spaces of separating hyperplanes

Cites Work

• Redundancy in mathematical programming. A state-of-the-art survey
• Finding all vertices of a convex polyhedron
• The Complexity of Vertex Enumeration Methods
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Separating support hyperplanes for a pair of convex polyhedral sets