1988
DOI: 10.1007/bf00938312
|View full text |Cite
|
Sign up to set email alerts
|

Optimal value function in semi-infinite programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0
1

Year Published

1988
1988
2020
2020

Publication Types

Select...
4
3
2

Relationship

2
7

Authors

Journals

citations
Cited by 25 publications
(10 citation statements)
references
References 15 publications
0
9
0
1
Order By: Relevance
“…Ž . Ž w x D c , c g int M, which also guarantees the boundedness of F* c see 16 . and references therein .…”
Section: žmentioning
confidence: 90%
“…Ž . Ž w x D c , c g int M, which also guarantees the boundedness of F* c see 16 . and references therein .…”
Section: žmentioning
confidence: 90%
“…-In [31], by means of an appropriate use of the subdifferential mapping, the connections among duality theory, solvability properties, and convergence properties of sequences of discretized linear semi-infinite programs were made explicit.…”
Section: Research Contributionsmentioning
confidence: 99%
“…in other words, there exist a subsequence of optimal solutions of the problems P (T r ; c) converging to an optimal solution of P: Statement (i) was proved in [43]. Concerning (ii), (a) is in [165]; (b) in [88] (in [96], for convex in…nite-dimensional optimization); (c) in [90, §8.3], although the study of the relationship between discretizability and absence of duality gap started with A. Charnes, W. Cooper and K. Kortanek ([41], [42], [43]), R.J. Du¢ n and L.A. Karlovitz [58], among others; and (d) is Theorem 8.6 in [90].…”
Section: Dualitymentioning
confidence: 99%