Name
Title | ||
|---|---|---|
The characterizations of optimal solution set in programming problem under inclusion constrains |
Abstract | ||
|---|---|---|
The characterizations of the solution set in extremal problem under inclusion constrains: (P)minf(x)s.t.x∈C,0∈F(x)is considered in this paper. When f is continuously convex and F is a set-valued map with convex graph, the Lagrange function of (P) is proved to be a constant on the solution set, and this property is then used to derive various simple Lagrange mulitiplier-based characterizations of the solution set of (P). |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.amc.2007.08.034 | Applied Mathematics and Computation |
Keywords | Field | DocType |
Inclusion constrains,Support function,Subgradient,Solution set | Graph,Mathematical optimization,Support function,Combinatorics,Subgradient method,Mathematical analysis,Convex set,Regular polygon,Solution set,Numerical analysis,Mathematics | Journal |
Volume | Issue | ISSN |
198 | 1 | 0096-3003 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Qingzhen Xu | 1 | 26 | 4.69 |
| Xianping Wu | 2 | 31 | 5.89 |