Find in Library

We prove a version of the Ekeland Variational Principle (EkVP) in a weighted graph <i>G</i> and its equivalence to Caristi fixed point theorem and to the Takahashi minimization principle. The usual completeness and topological notions are replaced with some weaker versions expressed in terms of the graph <i>G</i>. The main tool used in the proof is the OSC property for sequences in a graph. Converse results, meaning the completeness of weighted graphs for which one of these principles holds, are also considered.