On the completeness and constructiveness of parametric characterizations to vector optimization problems

Abstract

Motivated by recent reviews of characterizations of optimal solutions to vector optimization problems and by applications to decision support systems, this paper presents a methodological approach to comparing such characterizations. After specifying attributes of constructiveness, alternative classes of characterizations are reviewed. Characterization theorems are quoted or presented in more detail in cases that supplement those given in recent reviews. One of alternative classes of characterizations — by aspiration levels and order-consistent achievement functions — is discussed in more detail. An impossibility theorem of complete and robustly computable characterization of efficient (as opposed to weakly or properly efficient) solutions to vector optimization problems is presented.