An optimization problem under partial order constraints on a metric space (Q1742542)

Having an operator \(T: A \rightarrow B\), where \(A\) and \(B\) are nonempty sets in a (complete) metric space \(X\), it is an interesting and important task, to look (under certain conditions) for an element in \(A\), which is closest to its image w.r.t. \(T\) (best proximity problem). In this paper, the authors answer successfully a question addressed in a paper by \textit{M. Jleli} and \textit{B. Samet} [Fixed Point Theory Appl. 2016, Paper No. 18, 14 p. (2016; Zbl 1347.54087)] namely, to study solvability of best proximity, if there are side conditions in form of two inequalities each of them w.r.t. a special partial order in the underlying space \(X\). In that paper such problems had been studied for fixed point problems. Theorem 4.1. is the main result of the paper under review and gives -- in complete metric spaces -- conditions, such that at least one solution exists. The proof succeeds using induction, a sequence \((x_n)\) is constructed which can be shown to be a Cauchy sequence. For this procedure an idea of a monotone increasing comparison function given in the paper [\textit{V. Berinde}, Contracţii generalizate şi aplicaţii (Romanian). Baia Mare: Editura Cub Press 22 (1997; Zbl 0885.47022)] is used. There are two examples which show that all the given solvability conditions can be fullfilled.