On sufficiency and duality for semi-infinite multiobjective optimisation problems involving V-invexity
by Pushkar Jaisawal; Tadeusz Antczak; Vivek Laha
International Journal of Mathematics in Operational Research (IJMOR), Vol. 18, No. 4, 2021

Abstract: In the present paper, we study a non-convex non-smooth semi-infinite multiobjective programming problem with a finite number of Lipschitz continuous objective functions and infinite number of inequality constraints which is applicable in economics, engineering, optimal control theory, robust optimisation, social work and in different fields of mathematics. We derive sufficient conditions for the optimality of a feasible point under V-invexity and generalised V-invexity assumptions in terms of Clarke subdifferential. We formulate Mond-Weir type dual model for the primal non-smooth semi-infinite multiobjective programming problem and establish weak, strong and strict converse duality results under the V-invexity and generalised V-invexity conditions. The results established in the paper extend and unify several similar results in the literature.

Online publication date: Tue, 13-Apr-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com