In this paper, Levitin-Polyak well-posedness for set-valued optimization problems with constraints is introduced. Some sufficient and necessary conditions for the Levitin-Polyak well-posedness of these problems are established under some suitable conditions. The equivalence between the wellposedness of optimization problems with constraints and the existence and uniqueness of their solutions are proved. Finally, we give some examples to illustrate the presented results.