Greedy vs. Dynamic Programming

Greedy or Dynamic Programming? Which one to apply when is one of the most interesting problem in Computer Sciences. Both are pretty good techniques in solving the optimality problem. However, people like to have a bias for DP in comparison to the greedy approach because Greedy does not always give you the absolute optima, due to hill-climbing problem you might stuck to a local minima. I know a couple of friends of mine are super geeks in applying DP. DP is an elegant method to solve most of the optimization problems.