A filled function with adjustable parameters is suggested in this paper for finding a global minimum point of a general class of nonlinear programming problems
Two cases of the nested configurations in R^3 consisting of two regular quadrilaterals are discussed. One case of them do not form central configuration, the ot