GENERALIZED PENALTY-FUNCTION CONCEPTS IN MATHEMATICAL OPTIMIZATION.

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. [ABSTRACT FROM AUTHOR]