Resumo: The most commonly used tools for solving convex feasibility problems, are the so called Projection Methods. The objetive here is to generate two iterative algorithms, based on the Projection Methods, in order to find solutions of Equilibrium Problems. We understand by Equilibruim Problem as a problem which consists of finding a point x (the equilibrium point) in a set K such that a function f, defined on kxK with real values, is no negative at (x,y) for all y in K.