An algorithm for finding the Chebyshev center of a convex polyhedron

DOI10.1007/BF01204183zbMath0793.90047OpenAlexW2062058373MaRDI QIDQ1317311

V. L. Turova-Botkina, Nikolai D. Botkin

Publication date: 16 August 1994

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

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

zbMATH Keywords

Chebyshev centerfinite point set

Mathematics Subject Classification ID

Continuous location (90B85) Quadratic programming (90C20)

Related Items (10)

A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\) ⋮ A farthest-point characterisation of the relative Chebyshev centre ⋮ Unnamed Item ⋮ On the elimination of inessential points in the smallest enclosing ball problem ⋮ CONSTRAINED OPTIMAL LOCATION ⋮ Extremal problems for convex curves with a given self Chebyshev radius ⋮ Chebyshev centres, Jung constants, and their applications ⋮ Chebyshev center and inscribed balls: properties and calculations ⋮ Covering a set by a convex compactum: error estimates and computation ⋮ A Supervised Learning Approach Involving Active Subspaces for an Efficient Genetic Algorithm in High-Dimensional Optimization Problems

This page was built for publication: An algorithm for finding the Chebyshev center of a convex polyhedron