Description
| Abstract: | This report develops a numerical solution to the problem of maximizing a polynomial, not necessarily concave, over the closure of a bounded domain in the n-dimensional 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 non-linear 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 non-linear functions is made. |
|---|
| Item Description: | "March 1972."
"Research conducted through the Texas A & M Research Foundation." |
|---|
| Physical Description: | 53 leaves, 8 unnumbered leaves ; 28 cm |
|---|
| Bibliography: | Includes bibliographical references (leaves 46-47). |
|---|