Methods of concave minimization and reverse convex programming are treated in the general framework of d.c. optimization. The presentation is self-contained and can serve as an introduction to deterministic global optimization.