ABSTRACT
Unlike the case of scalar optimization, the subject of multicriteria optimization is characterized by far more theories than solution methods/algorithms. This is understandable since the computation of a solution set is clearly much harder than the computation of a solution point. In particular, the theory of duality in multicriteria optimization has attracted the attention of many researchers. Notwithstanding a more complex notion of optimality, it turns out that most of the duality results in scalar optimization can be extended and generalized to the multicriteria case, albeit in non-trivial ways.
