DocumentCode
2258453
Title
Polynomial programming using Groebner Bases
Author
Chang, Yao-Jen ; Wah, Benjamin W.
Author_Institution
Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA
fYear
1994
fDate
9-11 Nov 1994
Firstpage
236
Lastpage
241
Abstract
Finding the global optimal solution for a general nonlinear program is a difficult task except for very small problems. 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
Keywords
nonlinear programming; polynomials; Groebner Bases; PP; general nonlinear program; global minimum; global optimal solution; nonlinear programming problems; optimization problem; polynomial constraints; polynomial programming; scalar polynomial objective function; Constraint optimization; Design optimization; Equations; Lagrangian functions; Linear programming; Mathematical programming; Polynomials; Power system modeling; Quadratic programming; Robots;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Software and Applications Conference, 1994. COMPSAC 94. Proceedings., Eighteenth Annual International
Conference_Location
Taipei
Print_ISBN
0-8186-6705-2
Type
conf
DOI
10.1109/CMPSAC.1994.342798
Filename
342798
Link To Document