Answers are grounded in this paper and cite their sources.
A general algorithm for solving the nonlinear programming problem is pre- sented. Comprised of a modified direct search routine coupled to a newly developed multiple-gradient summation technique for handling the constraints, the algorithm converges to either a constrained or unconstrained local optimum for fairly loose restrictions on the forms of the objective function and the constraints, and consequently will converge to a global optimum if the objective function is concave and the constraints convex. A FORTRAN code was developed from this algorithm and several small-scale test problems have been solved.
No takes yet. Share an insight, caveat, or question.
Klingman et al. (1964) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: