Non-Linear Programming Via Penalty Functions
AbstractThe non-linear programming problem seeks to maximize a function f(x) where the n component vector x must satisfy certain constraints g i(x) - 0, i - 1, ..., m 1 and g i(z) \geqq 0, i - m 1 + 1, ..., m. The algorithm presented in this paper solves the non-linear programming problem by transforming it into a sequence of unconstrained maximization problems. Essentially, a penalty is imposed whenever x does not satisfy the constraints. Although the algorithm appears most useful in the concave case, the convergence proof holds for non-concave functions as well. The algorithm is especially interesting in the concave case because the programming problem reduces to a single unconstrained maximization problem or, at most, to a finite sequence of unconstrained maximization problems. In addition, the paper presents a new class of dual problems, and the algorithm is shown to be a dual feasible method. Another property of the algorithm is that it appears particularly well suited for large-scale problems with a sizable number of constraints.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 13 (1967)
Issue (Month): 5 (January)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Marco Corazza & Giovanni Fasano & Riccardo Gusso, 2011. "Particle Swarm Optimization with non-smooth penalty reformulation for a complex portfolio selection problem," Working Papers 2011_10, Department of Economics, University of Venice "Ca' Foscari".
- Marco Corazza & Stefania Funari & Riccardo Gusso, 2012. "An evolutionary approach to preference disaggregation in a MURAME-based credit scoring problem," Working Papers 5, Department of Management, Università Ca' Foscari Venezia.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
If references are entirely missing, you can add them using this form.