The dual of Philo's shortest line segment problem

Abstract

We study the dual of Philo's shortest line segment problem and find the optimal line segments passing through two given points, with a common endpoint, and with the other endpoints on a given line. This problem is dual, in a point-and-line-exchanging sense, to a famous problem of antiquity used to solve the problem of duplicating the cube. The provided solution uses multivariable calculus and elementary geometry methods. Interesting connections with the angle bisector of the triangle are explored. A generalization of the problem using $l_p$ ($p\ge 1$) norm is proposed. The particular case $p=\infty$ is also studied. It is shown that in the cases $p=0$ and $p=2$ the median and the symedian, respectively, of a triangle do not always give a solution for the corresponding optimization problems. The general case $p\ne 1$ and related problems are proposed as open problems.