Skip Navigation

The Computer Journal 1970 13(2):178-184; doi:10.1093/comjnl/13.2.178
© 1970 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (63)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Haarhoff, P. C.
Right arrow Articles by Buys, J. D.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A new method for the optimization of a nonlinear function subject to nonlinear constraints

P. C. Haarhoff1 * and J. D. Buys2 §

1 Chemistry Division, Atomic Energy Board, Private Bag 256, Pretoria, South Africa, 2 Physics Division, Atomic Energy Board, Private Bag 256, Pretoria, South Africa

A new method is presented for the optimization of a nonlinear function subject to nonlinear constraints. The required computational effort depends mainly on the total number of variable, and is comparable to that needed for unconstrained optimization. The method is thus very efficient, especially when dealing with functions of a large number of variables subject to relatively few constraints.

Received March 1969.

* Chemistry Division, Atomic Energy Board, Private Bag 256, Pretoria, South Africa

§ Physics Division, Atomic Energy Board, Private Bag 256, Pretoria, South Africa


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.