Details:
Title | Polynomial Programming Using Groebner Bases | Author(s) | Yao-Jen Chang, Benjamin W. Wah | Type | Technical Report, Misc | Abstract | Finding the global optimal solution for a general nonlinear program is a difficult task except for very small problems. In this paper we identify a class of nonlinear programming problems called polynomial programming
problems (PP). A polynomial program is an optimization problem with a scalar polynomial objective function and a set of polynomial constraints.
By using Groebner Bases, we can determine the global minimum of a polynomial program in a reasonable amount of time and memory. |
Language | English | Year | 1994 | Edition | 0 | Translation |
No | Refereed |
No |
|