Abstract
In this paper, we consider a vector optimization problem involving locally Lipschitz generalized approximately convex functions and provide several concepts of approximate efficient solutions. We formulate approximate vector variational inequalities of Minty and Stampacchia type under the framework of Clarke subdifferentials and use these inequalities as a tool to characterize an approximate efficient solution of the vector optimization problem.
Subject
Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献