Minimizers of Gerstewitz functionals
Abstract: Scalarization in vector optimization is essentially based on the minimization of Gerstewitz functionals. In this paper, the minimizer sets of Gerstewitz functionals are investigated. Conditions are given under which such a set is nonempty and compact. Interdependencies between solutions of problems with different parameters or with different feasible point sets are shown. Consequences for the parameter control in scalarization methods are derived. It is pointed out that the minimization of Gerstewitz functionals is equivalent to an optimization problem which generalizes the scalarization by Pascoletti and Serafini.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.