On the connectedness of the set of efficient points n convex optimization problems with multiple or random Objectives

DOI10.1080/02331938408842951zbMath0553.90074OpenAlexW2079678751MaRDI QIDQ3216436

Ralph Wernsdorf

Publication date: 1984

Published in: Mathematische Operationsforschung und Statistik. Series Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938408842951

zbMATH Keywords

connectednessconvex optimizationefficient point setsSufficient conditionsmultiple or random objectives

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Stochastic programming (90C15)

Related Items (2)

On the connectedness of the set of weakly efficient points of a vector optimization problem in locally convex spaces ⋮ Meilleure approximation en norme vectorielle et théorie de la localisation

This page was built for publication: On the connectedness of the set of efficient points n convex optimization problems with multiple or random Objectives