Abstnxct Here the validity of a no-derivative Complex Method for the optiinization of constrained nonlinear } prograrnming (NLP) problerns is discussed. This method, starting with N (N2n+1, where n is the dimension of the pioblem) feasible points, determines the optimum by a typical deseent method, Though this method is capable of determining a nearly optimal feasible solution, its convergence in the general case is not guaranteed, However, this method has good convergence properties for

more »

... rained problems; hence transfbrmation of the constrained NLP problem to a seTies of smooth unconstrained problerns by the use of a pena3ty function and the application of the cornplex method to these functions is proposed for the determination of the optirn.um, A number of problerns are solved by the complex method as well as by the use of a penalty function and the complex method, and the results are compared. The Opeiations Reseaich Society of Japan