You are not currently logged in.
Access JSTOR through your library or other institution:
An Aggregate Constraint Method for Non-Linear Programming
The Journal of the Operational Research Society
Vol. 42, No. 11 (Nov., 1991), pp. 1003-1010
Stable URL: http://www.jstor.org/stable/2583221
Page Count: 8
You can always find the topics here!Topics: Algorithms, Entropy, Infinity, Approximation, Lagrange multipliers, Constrained optimization, Operations research, Inequality constraints, Mathematical problems, Technology
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
This paper presents a new and efficient method, referred to as an aggregate constraint method, for the solution of general non-linear programming problems in which a multi-constrained problem is converted to one with a single parametric constraint. This is derived by using the two concepts of constraint surrogation and maximum entropy, and represents a uniform approximation to the original constraint set. An augmented Lagrangean algorithm is then used to solve the resulting problem. Numerical examples are given to show the high efficiency of the present method.
The Journal of the Operational Research Society © 1991 Operational Research Society