AN ALGORITHM FOR SEPARABLE NONCONVEX PROGRAMMING PROBLEMS: NONLINEAR CONSTRAINTS.
RESEARCH ANALYSIS CORP MCLEAN VA
Pagination or Media Count:
The paper extends the algorithm described in a previous report to problems in which the objective function and the constraint functions are the sums of functions of the various decision variables. The important feature of the algorithm is that the global solution to a problem will be found even if the objective function is not convex and the feasible region is not a convex set. Author
- Operations Research