The main facts concerning the construction principle for equivalent optimization problems are cited. Based on this principle, different notions of equivalence are considered and three approaches (discrete dynamic programming, construction of equivalent discrete problems, decomposition of problems on clutters) are classified and analysed. A generalization of the notion of equivalence concludes the paper.