Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal


TitlePolynomial Programming Using Groebner Bases
Author(s) Yao-Jen Chang, Benjamin W. Wah
TypeTechnical Report, Misc
AbstractFinding 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.
Translation No
Refereed No