Abstract

In this paper we establish characterizations of the containment of the set {xX: xC,g(x)K}{xX: f (x)0}, where C is a closed convex subset of a locally convex Hausdorff topological vector space, X, K is a closed convex cone in another locally convex Hausdorff topological vector space and g:X Y is a K- convex mapping, in a reverse convex set, define by the proper, lower semicontinuous, convex function. Here, no constraint qualification condition or qualification condition are assumed. The characterizations are often called asymptotic Farkas-type results. The second part of the paper was devoted to variant Asymptotic Farkas-type results where the mapping is a convex mapping with respect to an extended sublinear function. It is also shown that under some closedness conditions, these asymptotic Farkas lemmas go back to non-asymptotic Farkas lemmas or stable Farkas lemmas established recently in the literature. The results can be used to study the optimization

Highlights

  • AND PRELIMINARIESFarkas-type results have been used as one of the main tools in the theory of optimization [8]

  • Typical Farkas lemma for cone-convex systems characterizes the containment of the set where is a closed convex subset of a locally convex Hausdorff topological vector space, is a closed convex cone in another lcHtvs and is a convex mapping, in a reverse convex set, define by the proper, lower semi-continuous, convex function

  • If the characterization holds under some constraint qualification condition or qualification condition it is called non-asymptotic Farkas-type result

Read more

Summary

Tran Hong Mo

Tien Giang University, Tien Giang (Received on June 5th 2015, accepted on November 21th 2016). {x X: x C, g(x) K} {x X: f (x) 0}, where C is a closed convex subset of a locally convex Hausdorff topological vector space, X, K is a closed convex cone in another locally convex Hausdorff topological vector space and g : X Y is a K- convex mapping, in a reverse convex set, define by the proper, lower semicontinuous, convex function. No constraint qualification condition or qualification condition are assumed. The characterizations are often called asymptotic Farkas-type results. The second part of the paper was devoted to variant Asymptotic Farkas-type results where the mapping is a convex mapping with respect to an extended sublinear function. The results can be used to study the optimization

AND PRELIMINARIES
We now set
TÓM TẮT

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.