
Accession Number : AD0741635
Title : NonConvex Programming for Polynomials.
Descriptive Note : Technical rept.,
Corporate Author : TEXAS A AND M UNIV COLLEGE STATION INST OF STATISTICS
Personal Author(s) : AlHussaini,Essam K. ; Hartley,H. O.
Report Date : MAR 1972
Pagination or Media Count : 32
Abstract : The report develops a numerical solution to the problem of maximizing a polynomial, not necessarily concave, over the closure of a bounded domain in the ndimensional Euclidean space. As an essential part of this solution algorithms for computing integrals of powers of polynomials are developed. For the general problem of maximizing a function over a region defined by the intersection of nonlinear inequalities, a theorem which gives the point of maximum as well as the maximum value of the objective function is stated and proved. Again no assumption on the concavity of the nonlinear functions is made. (Author)
Descriptors : (*POLYNOMIALS, OPTIMIZATION), MATHEMATICAL PROGRAMMING, CONVEX SETS, INTEGRALS, INEQUALITIES, INTERPOLATION, THEOREMS
Subject Categories : Theoretical Mathematics
Distribution Statement : APPROVED FOR PUBLIC RELEASE