Skip Navigation

The Computer Journal 1970 13(2):171-177; doi:10.1093/comjnl/13.2.171
© 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 (13)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Allran, R. R.
Right arrow Articles by Johnsen, S. E. J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An algorithm for solving nonlinear programming problems subject to nonlinear inequality constraints

R. R. Allran * and S. E. J. Johnsen *

Advanced Structures Group, Allison Division, General Motors Corporation, Indianapolis, Indiana, USA

An algorithm of the penalty function class which solves linear or non-linear optimisation problems subject to equality and/or inequality constraints is described. The ‘penalty term’ consists of exponential summands like exp [T·g(x)] where T < 0 and g(x) ≥ 0 is a constraint. Computational experience is discussed. Convergence is proved and is typically first-order. The algorithm has found considerable application in its ability to distinguish readily between feasible and non-feasible (i.e. no-domain) problems.

Received November 1968.

* Advanced Structures Group, Allison Division, General Motors Corporation, Indianapolis, Indiana, U.S.A.


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.