This paper is focused on approximate ( <InlineEquation ID="IEq19"> <EquationSource Format="TEX">$$\varepsilon$$</EquationSource> </InlineEquation>-efficient) solutions of multiobjective mathematical programs. We introduce a new <InlineEquation ID="IEq20"> <EquationSource Format="TEX">$$\varepsilon$$</EquationSource> </InlineEquation>-efficiency concept which extends and unifies different notions of approximate solution defined in the literature. We characterize these <InlineEquation ID="IEq21"> <EquationSource...</equationsource></inlineequation></equationsource></inlineequation></equationsource></inlineequation>

In this work, necessary and sufficient conditions for approximate solutions of vector optimization problems are obtained via scalarization, i.e., by considering approximate solutions of associated scalar optimization problems. These conditions are proved through a new [epsilon]-efficiency...

In this paper we focus on minimal points in linear spaces and minimal solutions of vector optimization problems, where the preference relation is defined via an improvement set E. To be precise, we extend the notion of E-optimal point due to Chicco et al. in [4] to a general (non-necessarily...