Efficiency criteria and dual models for multi-objective semi-infinite constrained minimization problems with vanishing restrictions

Abstract This article delves into the analysis of semi-infinite multi-objective optimization problems characterized by constraints that gradually vanish. We establish sufficient efficiency criteria to determine whether a feasible solution attains a Pareto solution in the given multi-objective optimization problem considering the presence of vanishing constraints and suitable generalized convexity assumptions. We provide illustrative examples to confirm the validity of our findings. Additionally, we derive weak, converse, strong converse, and strong duality theorems for a dual model based on Mond–Weir principles, relying on generalized convexity assumptions.

Authors

Institutions

Publication Details

Journal
Computational and Applied Mathematics
Published
2025-02-04
DOI
https://doi.org/10.1007/s40314-025-03120-2
Citations
4
Primary Topic
Optimization and Variational Analysis
Type
article
Field-Weighted Citation Impact
6.02
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficiency criteria and dual models for multi-objective semi-infinite constrained minimization problems with vanishing restrictions

Savin Treanţă, Bhuwan Chandra Joshi, Cristina-Florentina Marghescu, Murari Kumar Roy
4 citations
Computational and Applied Mathematics
Optimization and Variational Analysis
6.02
article

Efficiency criteria and dual models for multi-objective semi-infinite constrained minimization problems with vanishing restrictions

Savin Treanţă, Bhuwan Chandra Joshi, Cristina-Florentina Marghescu, Murari Kumar Roy
article en
4 citations

Abstract

Abstract This article delves into the analysis of semi-infinite multi-objective optimization problems characterized by constraints that gradually vanish. We establish sufficient efficiency criteria to determine whether a feasible solution attains a Pareto solution in the given multi-objective optimization problem considering the presence of vanishing constraints and suitable generalized convexity assumptions. We provide illustrative examples to confirm the validity of our findings. Additionally, we derive weak, converse, strong converse, and strong duality theorems for a dual model based on Mond–Weir principles, relying on generalized convexity assumptions.

Computational and Applied MathematicsVol. 44(3)
Academia Oamenilor de Știință din România (RO), University of Petroleum and Energy Studies (IN), Graphic Era University (IN), Universitatea Națională de Știință și Tehnologie Politehnica București (RO)
Openalex Percentile: Top 4%
Optimization and Variational Analysis
6.02
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.