Linear programming in \({\mathbb{R}}^ 3\) and the skeleton and largest incircle of a convex polygon

DOI10.1016/0898-1221(87)90008-3zbMath0643.90051MaRDI QIDQ1102184

B. George

Publication date: 1987

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(87)90008-3

zbMATH Keywords

convex polygon; geometrical problem; largest circle

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

65K05: Numerical mathematical programming methods

90C05: Linear programming

52Bxx: Polytopes and polyhedra