Least distance methods for the scheme of polytopes

DOI10.1007/BF01608995zbMath0406.65033OpenAlexW2150238797MaRDI QIDQ4192906

Balder von Hohenbalken

Publication date: 1978

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01608995

zbMATH Keywords

DistanceFacetsDecompositionQuadratic ProgrammingPolytopeVerticesFacesApl-CodesPoint Set

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Related Items (4)

Least distance methods for the frame of homogeneous equation systems ⋮ An algorithm for set operations on nonconvex polygons (with an application to census tracts) ⋮ A probabilistic dominance measure for binary choices: Analytic aspects of a multi-attribute random weights model ⋮ Finding simplicial subdivisions of polytopes

Cites Work

• Finding all vertices of a convex polyhedron
• An Algorithm for Finding All Vertices of Convex Polyhedral Sets
• A finite algorithm to maximize certain pseudoconcave functions on polytopes
• Finding the nearest point in A polytope
• Simplicial decomposition in nonlinear programming algorithms
• Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
• Algorithms for frames and lineality spaces of cones
• An Algorithm for Convex Polytopes
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
• Optimality and Degeneracy in Linear Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Least distance methods for the scheme of polytopes