The characterizations of optimal solution set in programming problem under inclusion constrains (Q2425984)
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: The characterizations of optimal solution set in programming problem under inclusion constrains |
scientific article; zbMATH DE number 5265356
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The characterizations of optimal solution set in programming problem under inclusion constrains |
scientific article; zbMATH DE number 5265356 |
Statements
The characterizations of optimal solution set in programming problem under inclusion constrains (English)
0 references
17 April 2008
0 references
The authors consider the convex mathematical programming problem with inclusion constraints: \(\min\{f(x): x \in C\), \(0 \in F(x)\}\). They show that the Lagrangian of this problem is constant on its solution set. Basing on this they derive various Lagrange-multiplier based characterizations of its solution set.
0 references
subgradient
0 references
support function
0 references
convex graph
0 references
0 references
0 references
0.8361613154411316
0 references
0.8208087682723999
0 references
0.8179315328598022
0 references
0.8157678842544556
0 references
