Journal
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH
Volume 21, Issue 1, Pages 151-176Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s10288-022-00506-4
Keywords
Robust multiobjective optimization; Semi-infinite optimization; Optimality condition; Duality; Constraint qualification
Categories
Ask authors/readers for more resources
This paper investigates a robust nonsmooth semi-infinite objective optimization problem associated with data uncertainty. It proposes some constraint qualifications and derives sufficient conditions for them. Necessary and sufficient conditions for robust weak Pareto, Pareto, and Benson proper solutions are established under these conditions. The paper also addresses the Wolfe and Mond-Weir duality schemes and presents conditions for linear programming using the obtained results.
In this paper, for a robust nonsmooth semi-infinite objective optimization problem associated with data uncertainty, some constraint qualifications (CQs): Abadie CQ, Mangasarian-Fromovitz CQ, and Pshenichnyi-Levin-Valadire CQ are proposed. Sufficient conditions for them are also derived. Under these CQs, we establish both necessary and sufficient conditions for robust weak Pareto, Pareto, and Benson proper solutions. These conditions are the forms of Karush-Kuhn-Tucker rule. Moreover, the Wolfe and Mond-Weir duality schemes are also addressed. Finally, we employ the obtained results to present some conditions for linear programming. Examples are provided for analyzing and illustrating our results.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available