On Robust Nonsmooth Semi-Infinite Multiobjective Optimization Problems Involving Intersection of Closed Sets

This paper investigates robust optimality and mixed-type duality for robust semi-infinite multiobjective optimization problems involving the intersection of closed sets within the robust optimization framework (UP), using limiting subdifferentials, where uncertainties are incorporated into both the objective and inequality constraint functions. Using the concepts of advanced variational analysis techniques, we first derive the robust Karush-Kuhn-Tucker (KKT) necessary optimality conditions for its robust counterpart (RP) under the assumption of robust limiting constraint qualification (RLCQ). We further establish robust sufficient optimality conditions using the notions of generalized convexity and generalized pseudoquasiconvexity. Additionally, we formulate a mixed-type robust dual model corresponding to the primal problem and analyze robust weak and strong duality. To validate our theoretical findings, we present numerical examples that demonstrate the applicability and effectiveness of the proposed approach.

Authors

Institutions

Publication Details

Journal
Journal of convex analysis
Published
2026-10-30
DOI
https://doi.org/10.68381/jca34016
Primary Topic
Optimization and Variational Analysis
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On Robust Nonsmooth Semi-Infinite Multiobjective Optimization Problems Involving Intersection of Closed Sets

Vivek Laha, Priyanka Bharati
2 links
Journal of convex analysis
Optimization and Variational Analysis
article

On Robust Nonsmooth Semi-Infinite Multiobjective Optimization Problems Involving Intersection of Closed Sets

Vivek Laha, Priyanka Bharati
article en

Abstract

This paper investigates robust optimality and mixed-type duality for robust semi-infinite multiobjective optimization problems involving the intersection of closed sets within the robust optimization framework (UP), using limiting subdifferentials, where uncertainties are incorporated into both the objective and inequality constraint functions. Using the concepts of advanced variational analysis techniques, we first derive the robust Karush-Kuhn-Tucker (KKT) necessary optimality conditions for its robust counterpart (RP) under the assumption of robust limiting constraint qualification (RLCQ). We further establish robust sufficient optimality conditions using the notions of generalized convexity and generalized pseudoquasiconvexity. Additionally, we formulate a mixed-type robust dual model corresponding to the primal problem and analyze robust weak and strong duality. To validate our theoretical findings, we present numerical examples that demonstrate the applicability and effectiveness of the proposed approach.

Journal of convex analysisVol. 34(1)
Banaras Hindu University (IN)
University Grants Commission
Openalex Percentile: Top 14%
Optimization and Variational Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
On Robust Nonsmooth Semi-Infinite Multiobjective Optimization Problems Involving Intersection of Closed Sets — Vivek Laha, Priyanka Bharati · Journal of convex analysis (2026) | TGRS Research Map | TGRS