Non-Linear Programming Via Penalty Functions

Willard I. Zangwill
Additional contact information
Willard I. Zangwill: University of California, Berkeley

Management Science, 1967, vol. 13, issue 5, 344-358

Abstract: The 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.

Date: 1967
References: Add references at CitEc
Citations: View citations in EconPapers (21)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.13.5.344 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:13:y:1967:i:5:p:344-358

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().