Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems (Q2642150)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems |
scientific article; zbMATH DE number 5180363
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems |
scientific article; zbMATH DE number 5180363 |
Statements
Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems (English)
0 references
20 August 2007
0 references
smooth nonlinear programming problems
0 references
global optimization
0 references
sufficient optimality conditions
0 references
box constraints
0 references
Kuhn-Tucker conditions
0 references
0 references
0 references
0 references
0 references
0 references
0.9030714631080629
0 references
0.8787736892700195
0 references
