Generalized Penalty-Function Concepts in Mathematical Optimization

M. Bellmore, H. J. Greenberg and J. J. Jarvis
Additional contact information
M. Bellmore: The Johns Hopkins University, Baltimore, Maryland
H. J. Greenberg: Southern Methodist University, Dallas, Texas
J. J. Jarvis: Georgia Institute of Technology, Atlanta, Georgia

Operations Research, 1970, vol. 18, issue 2, 229-252

Abstract: Given a mathematical program, this paper constructs an alternate problem with its feasibility region a superset of the original mathematical program. The objective function of this new problem is constructed so that a penalty is imposed for solutions outside the original feasibility region. One attempts to choose an objective function that makes the optimal solutions to the new problem the same as the optimal solutions to the original mathematical program.

Date: 1970
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.18.2.229 (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:oropre:v:18:y:1970:i:2:p:229-252

Access Statistics for this article

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