We survey recent results on the existence of polynomial time approximation schemes for some dense instances of NP-hard combinatorial optimization problem. We indicate further some inherent limits for existence of such schemes for some other dense instances of optimization problems. We also go beyond the dense optimization problems and show how other approximation problems can be solved by using dense techniques.