Sublinear scalarizations for proper and approximate proper efficient points in nonconvex vector optimization

5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We show that under a separation property, a Q -minimal point in a normed space is the minimum of a given sublinear function. This fact provides sufficient conditions, via scalarization, for nine types of proper efficient points; establishing a characterization in the particular case of Benson proper efficient points. We also obtain necessary and sufficient conditions in terms of scalarization for approximate Benson and Henig proper efficient points. The separation property we handle is a variation of another known property and our scalarization results do not require convexity or boundedness assumptions.

Cite

CITATION STYLE

APA

García-Castaño, F., Melguizo-Padial, M. Á., & Parzanese, G. (2023). Sublinear scalarizations for proper and approximate proper efficient points in nonconvex vector optimization. Mathematical Methods of Operations Research, 97(3), 367–382. https://doi.org/10.1007/s00186-023-00818-z

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free