Sufficiency in nonlinear programming: A unified theorem (Q584075)
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: Sufficiency in nonlinear programming: A unified theorem |
scientific article; zbMATH DE number 4133849
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sufficiency in nonlinear programming: A unified theorem |
scientific article; zbMATH DE number 4133849 |
Statements
Sufficiency in nonlinear programming: A unified theorem (English)
0 references
1989
0 references
Sufficient optimality conditions are derived for a nonlinear program with quasiconvex constraints and pseudoconvex objective. This result subsumes the Kuhn-Tucker and Fritz John sufficiency theorems discussed separately by several authors.
0 references
Sufficient optimality conditions
0 references
quasiconvex constraints
0 references
pseudoconvex objective
0 references
0.8599807620048523
0 references
0.8483388423919678
0 references
0.8442433476448059
0 references
