On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization

We present approximate solutions for the robust semi-infinite multi-objective convex symmetric cone programming problem. By using the robust optimization approach, we establish an approximate optimality theorem and approximate duality theorems for approximate solutions in convex symmetric cone optim...

Full description

Saved in:
Bibliographic Details
Published in:Positivity : an international journal devoted to the theory and applications of positivity in analysis 2022-11, Vol.26 (5), Article 86
Main Authors: Alzalg, Baha, Oulha, Amira Achouak
Format: Article
Language:English
Subjects:
Algebra
Calculus of Variations and Optimal Control
Optimization
Econometrics
Fourier Analysis
Linear programming
Mathematics
Mathematics and Statistics
Multiple objective analysis
Operator Theory
Optimization
Potential Theory
Robustness
Theorems
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present approximate solutions for the robust semi-infinite multi-objective convex symmetric cone programming problem. By using the robust optimization approach, we establish an approximate optimality theorem and approximate duality theorems for approximate solutions in convex symmetric cone optimization problem involving infinitely many constraints to be satisfied and multiple objectives to be optimized simultaneously under the robust characteristic cone constraint qualification. We also give an example to illustrate the obtained results in an important special case, namely the robust semi-infinite multi-objective convex second-order cone program.
ISSN:1385-1292
1572-9281
DOI:10.1007/s11117-022-00952-8