The fixed point theory provides a sound basis for studying many problems in pure and applied sciences. In this paper, we use the notions of sequential compactness and completeness to prove Eldeisten-Suzuki-type fixed point results for self-mappings in various abstract spaces. We apply our results to get a bounded solution of a functional equation arising in dynamic programming.