Methods of embedding-cutting off in problems of mathematical programming

摘要

A class of functions, which reach their minima on a compact subset of the n-dimensional Euclidean space E", is considered. This is a rather wide class of functions, which are stable with respect to operations traditional for optimization problems. Functions of this class represent a tool suitable from the viewpoint of formal description of various applied problems. Furthermore, it is possible to develop rather efficient techniques for the purpose of rinding global minima of such functions on a compact set. One of such techniques is discussed in Sect. 3 of the present paper.