# Optimal Stopping

When we solve Bellman equations, I normally would think of the Blanchard Kahn technique. But in the case that I have an optimal stopping problem, or where the decision that the agent has to take is to choose the maximum from two alternatives , I am not sure about how am I supposed to solve/proceed. There is no Euler equation because the problem is discrete. Any suggestions are welcome. Thanks!