Skip Navigation

The Computer Journal 1974 17(3):261-266; doi:10.1093/comjnl/17.3.261
© 1974 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 (9)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Ballard, D. H.
Right arrow Articles by Schinzinger, R.
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 the solution of constrained generalised polynomial programming problems

D. H. Ballard, C. O. Jelinek * and R. Schinzinger §

School of Engineering, University of California, Irvine, California, USA

An algorithm is presented for the solution of a class of constrained, nonlinear programming problems. The problems considered may be formulated as generalised polynomials. This class of problems, which encompasses linear, quadratic and geometric programming problems, can be extended to include functions which are the ratios of generalised polynomials. Computational experience with some typical examples is also reviewed.

Received November 1972.

* Now with Xerox Corporation.

§ On leave 1972-73 at University of Manchester Institute of Science and Technology.

School of Engineering, University of California, Irvine, California 92664, USA


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.