A method of Euclidean centers

DOI10.1016/0305-0548(95)00010-JzbMath0844.90053OpenAlexW2085755656MaRDI QIDQ1906945

James T. Fagan, James E. Falk

Publication date: 22 February 1996

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(95)00010-j

zbMATH Keywords

Euclidean centermethod of steepest ascentradius of the maximal inscribed hypersphere

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (4)

Euclidean centers: Computation, properties and a MOLP application ⋮ Interval judgments and Euclidean centers ⋮ Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems ⋮ Weighted Euclidean centers

Cites Work

• A new polynomial-time algorithm for linear programming
• Polytope pairs and their relationship to linear programming
• Finding the closest point to the origin in the convex hull of a discrete set of points
• The Simplex Method for Quadratic Programming
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A method of Euclidean centers