In this paper, focusing on general nonlinear programming problems, we attempt to propose a general and highperformance approximate solution method for them. In recent years, S. Koziel et al. have proposed a floating-point genetic algorithm, GENOCOP V, as a general approximate solution method for nonlinear programming problems and showed its efficiency, there are left some shortcomings of the method. In this paper, incorporating ideas to cope with these shortcomings, we propose a revised GENOCOP V (RGENOCOP V). Furthermore, we show the efficiency of the proposed method RGENOCOP V by comparing it with two existing methods, RGENOCOP III and GENOCOP V through the application of them into the numerical examples.