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

X. X. Huang, Xiaoqi Yang

Research output: Journal article publicationJournal articleAcademic researchpeer-review

20 Citations (Scopus)

Abstract

In this paper, we give characterizations for the nonemptiness and compactness of the set of weakly efficient solutions of an unconstrained/constrained convex vector optimization problem with extended vector-valued functions in terms of the 0-coercivity of some scalar functions. Finally, we apply these results to discuss solution characterizations of a constrained convex vector optimization problem in terms of solutions of a sequence of unconstrained vector optimization problems which are constructed with a general nonlinear Lagrangian.
Original languageEnglish
Pages (from-to)270-287
Number of pages18
JournalJournal of Mathematical Analysis and Applications
Volume264
Issue number2
DOIs
Publication statusPublished - 15 Dec 2001

Keywords

  • Coercivity
  • Convexity
  • Nonlinear Lagrangian
  • Vector optimization
  • Weakly efficient solution

ASJC Scopus subject areas

  • Analysis
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications'. Together they form a unique fingerprint.

Cite this