COMPUTER PROGRAM IMPLEMENTING THE SEQUENTIAL UNCONSTRAINED MINIMIZATION TECHNIQUE FOR NONLINEAR PROGRAMMING.
RESEARCH ANALYSIS CORP MCLEAN VA
Pagination or Media Count:
The mathematical programming problem-minimize fx subject to R sub jx or 0 for j 1, ..., m, where f and the R sub js may be nonlinear-is solved by solving a sequence of unconstrained minimization problems. Upper and lower bounds on the optimal solution value, primal and dual feasible points, and estimates of the optimal solution values are generated after each iteration. The program is coded in FORTRAN IV. Author