Characterizations of solution sets of convex vector minimization problems

@article{Jeyakumar2006CharacterizationsOS,
  title={Characterizations of solution sets of convex vector minimization problems},
  author={Vaithilingam Jeyakumar and G. M. Lee and N. Dinh},
  journal={European Journal of Operational Research},
  year={2006},
  volume={174},
  pages={1380-1395}
}
Complete dual characterizations of the weak and proper optimal solution sets of an infinite dimensional convex vector minimization problem are given. The results are expressed in terms of subgradients, Lagrange multipliers and epigraphs of conjugate functions. A dual condition characterizing the containment of a closed convex set, defined by a cone-convex inequality, in a reverse-convex set, plays a key role in deriving the results. Simple Lagrange multiplier characterizations of the solution… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 24 references

Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization

V. Jeyakumar, A. Zaffaroni
Numerical Functional Analysis and Optimization 17 • 1996
View 4 Excerpts
Highly Influenced

Lagrange multiplier conditions characterizing optimal solution sets of convex programs

V. Jeyakumar, G. M. Lee, N. Dinh
Journal of Optimization Theory and Applications 123 (1) • 2004
View 2 Excerpts

Convex Analysis in General Vector Spaces

C. Zalinescu
World Scientific, Singapore • 2002
View 1 Excerpt

Set Containment Characterization

J. Global Optimization • 2002
View 1 Excerpt

Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications

X. X. Huang, X. Q. Yang
Journal of Mathematical Analysis and Applications 264 (2) • 2001
View 1 Excerpt

Similar Papers

Loading similar papers…