If you need an accessible version of this item please contact JSTOR User Support

An Aggregate Constraint Method for Non-Linear Programming

Li Xingsi
The Journal of the Operational Research Society
Vol. 42, No. 11 (Nov., 1991), pp. 1003-1010
DOI: 10.2307/2583221
Stable URL: http://www.jstor.org/stable/2583221
Page Count: 8
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
An Aggregate Constraint Method for Non-Linear Programming
Preview not available

Abstract

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.

Page Thumbnails

  • Thumbnail: Page 
1003
    1003
  • Thumbnail: Page 
1004
    1004
  • Thumbnail: Page 
1005
    1005
  • Thumbnail: Page 
1006
    1006
  • Thumbnail: Page 
1007
    1007
  • Thumbnail: Page 
1008
    1008
  • Thumbnail: Page 
1009
    1009
  • Thumbnail: Page 
1010
    1010