Interval-valued optimization problems constitute a rapidly evolving field in applied mathematics and engineering, addressing situations where uncertainty and imprecision are inherent in model ...

In this article, we explore the characterizations of ε-approximate solutions for convex semidefinite programming problems that involve uncertain data. It first reviews essential findings regarding the ...

Mathematical programming with vanishing constraints (MPVC) represents a challenging class of optimisation problems where certain constraints become inactive—or “vanish”—depending on specific ...