论文信息 - Surrogate Mathematical Programming

Surrogate Mathematical Programming

This paper presents an approach, similar to penalty functions, for solving arbitrary mathematical programs. The surrogate mathematical program is a lesser constrained problem that, in some cases, may be solved with dynamic programming. The paper deals with the theoretical development of this surrogate approach.

Harvey J. Greenberg | William P. Pierskalla | H. J. Greenberg | W. Pierskalla

[1] Harvey J. Everett. Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .

[2] B. V. Dean,et al. Studies in Linear and Non-Linear Programming. , 1959 .

[3] F. Glover. A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .

[4] Arthur M. Geoffrion,et al. Letter to the Editor - Finding Everett's Lagrange Multipliers by Linear Programming , 1966, Operational Research.

[5] A. M. Geoffrion. IMPLICIT ENUMERATION USING AN IMBEDDED LINEAR PROGRAM , 1967 .

[6] David G. Luenberger,et al. Quasi-Convex Programming , 1968 .

[7] F. J. Gould. Extensions of Lagrange Multipliers in Nonlinear Programming , 1969 .

[8] H. J. Greenberg,et al. Generalized Penalty-Function Concepts in Mathematical Optimization , 1970, Oper. Res..