Abstract
In this paper, we present a duality approach using conjugacy for a semivectorial bilevel programming problem (S) where the upper and lower levels are vectorial and scalar respectively. This approach uses the Fenchel–Lagrange duality and is given via a regularization of problem (S) and the operation of scalarization. Then, using this approach, we provide necessary optimality conditions for a class of properly efficient solutions of (S). Finally, sufficient optimality conditions are given for (S) regardless of the duality approach. Examples are given for illustration.
from # All Medicine by Alexandros G. Sfakianakis via alkiviadis.1961 on Inoreader http://ift.tt/2m7pYTi
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.