Optimality conditions and Mond–Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints

In this paper, the class of differentiable semi-infinite multiobjective programming problems with vanishing constraints is considered. Both Karush–Kuhn–Tucker necessary optimality conditions and, under appropriate invexity hypotheses, sufficient optimality conditions are proved for such nonconvex sm...

Full description

Saved in:
Bibliographic Details
Published in:4OR Vol. 20; no. 3; pp. 417 - 442
Main Author: Antczak, Tadeusz
Format: Journal Article
Language:English
Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2022
Springer Nature B.V
Subjects:
Business and Management
Hypotheses
Industrial and Production Engineering
Mathematical programming
Multiple objective analysis
Operations research
Operations Research/Decision Theory
Optimization
Research Paper
90C30
90C46
Differentiable semi-infinite multiobjective programming problem with vanishing constraints
Mond–Weir duality
Invex function
90C29
Karush–Kuhn–Tucker necessary optimality conditions
90C26
ISSN:1619-4500, 1614-2411
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, the class of differentiable semi-infinite multiobjective programming problems with vanishing constraints is considered. Both Karush–Kuhn–Tucker necessary optimality conditions and, under appropriate invexity hypotheses, sufficient optimality conditions are proved for such nonconvex smooth vector optimization problems. Further, vector duals in the sense of Mond–Weir are defined for the considered differentiable semi-infinite multiobjective programming problems with vanishing constraints and several duality results are established also under invexity hypotheses.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1619-4500
1614-2411
DOI:10.1007/s10288-021-00482-1