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 Vol. 26; no. 5
Main Authors:	Alzalg, Baha, Oulha, Amira Achouak
Format:	Journal Article
Language:	English
Published:	Cham Springer International Publishing 01.11.2022 Springer Nature B.V
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 90C20 Semi-infinite programming Robust symmetric cone optimization 90C46 90C25 90C34 Approximate duality theorems 90C29 Multi-objective programming Approximate optimality conditions
ISSN:	1385-1292, 1572-9281
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!