This paper discusses the design and implementation strategies of the monotone matrix search problem. A linear time search algorithm is demonstrated. The algorithm is applied to design an efficient algorithm for the all farthest neighbors problem of a convex polygon.