An algorithm for the solution of constrained generalised polynomial programming problems

Open Access
Publisher Website
Google Scholar
Abstract
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.