Generic well-posedness in mathematical programming (Q2720938)
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: Generic well-posedness in mathematical programming |
scientific article; zbMATH DE number 1611739
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generic well-posedness in mathematical programming |
scientific article; zbMATH DE number 1611739 |
Statements
1 July 2001
0 references
convex programming
0 references
minimization
0 references
Generic well-posedness in mathematical programming (English)
0 references
This paper deals with generic well-posedness of mathematical programming problems such as minimizing an objective function under inequality and equality constraints. A general variational principle is provided for studying such problems. Several important classes of mathematical programming problems are considered as well.
0 references
