An iterative linear computational method which utilizes the theory of condensation of polynomials and varies parametrically the objective function of a linearized geometric programme is extended and applied hero to minimize a polynomial subject to polynomial constraints. Applications to dynamic planning and scheduling problems are also briefly referred to.