An approach to obtaining global extremums in polynomial mathematical programming problems (Q3801357)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4068631
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approach to obtaining global extremums in polynomial mathematical programming problems |
scientific article; zbMATH DE number 4068631 |
Statements
An approach to obtaining global extremums in polynomial mathematical programming problems (English)
0 references
1987
0 references
duality
0 references
polynomial objective function
0 references
quadratic equality constraints
0 references
Lagrange function
0 references
0.8147458434104919
0 references
0.8071635365486145
0 references
0.7968754768371582
0 references
0.7792011499404907
0 references
