2018Journal of Inequalities and ApplicationsOpen access

Approximate weakly efficient solutions of set-valued vector equilibrium problems

Jian Chen, Yihong Xu, Ke Zhang

Open full text 6 citations

Abstract

In this paper, we introduce a new kind of approximate weakly efficient solutions to the set-valued vector equilibrium problems with constraints in locally convex Hausdorff topological vector spaces; then we discuss a relationship between the weakly efficient solutions and approximate weakly efficient solutions. Under the assumption of near cone-subconvexlikeness, by using the separation theorem for convex sets we establish Kuhn-Tucker-type and Lagrange-type optimality conditions for set-valued vector equilibrium problems, respectively.

Open-access reader

About this research paper

What this paper is about

In this paper, we introduce a new kind of approximate weakly efficient solutions to the set-valued vector equilibrium problems with constraints in locally convex Hausdorff topological vector spaces; then we discuss a relationship between the weakly efficient solutions and approximate weakly efficient solutions. Under the assumption of near cone-subconvexlikeness, by using the separation theorem for convex sets we establish Kuhn-Tucker-type and Lagrange-type optimality conditions for set-valued vector equilibrium problems, respectively.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, we introduce a new kind of approximate weakly efficient solutions to the set-valued vector equilibrium problems with constraints in locally convex Hausdorff topological vector spaces; then we discuss a relationship between the weakly efficient solutions and approximate weakly efficient solutions. Under the assumption of near cone-subconvexlikeness, by using the separation theorem for convex sets we establish Kuhn-Tucker-type and Lagrange-type optimality conditions for set-valued vector equilibrium problems, respectively.

Key concepts: Mathematics, Hausdorff space, Regular polygon, Locally convex topological vector space, Solution set, Set (abstract data type), Type (biology), Applied mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Approximate weakly efficient solutions of set-valued vector equilibrium problems — Research Paper | ScholarLens