The study of vector optimization problems has recently been a rapidly growing area of research. See, for example, [1–5] and the references mentioned therein. In this paper we study a class of vector minimization problems on a complete metric space such that all its bounded closed subsets are compact. This class of problems is associated with a complete metric space of continuous vector function...

Ordinal Optimization is a tool to reduce the computational burden in simulation-based optimization problems. The major effort in this field so far focuses on single-objective optimization. In this paper we extend this to multi-objective optimization, and develop Vector Ordinal Optimization, which is different from the one introduced in Ref. 1. Alignment probability and ordered performance curve...

We discuss three scalarizations of the multiobjective optimization from the point of view of the parametric optimization. We analize three important aspects: i) What kind of singularities may appear in the diierent parametriza-tions ii) Regularizations in the sense of Jongen, Jonker and Twilt, and in the sense of Kojima and Hirabayashi. iii) The Mangasarian-Fromovitz Constraint Qualiication for...

A variety of applications of Satisfiability Modulo Theories (SMT) require finding a satisfying assignment which optimizes some user-given function. Optimization in the context of SMT is referred to as Optimization Modulo Theories (OMT). Current OMT research is mostly dedicated to optimization in arithmetic domains. This paper is about Optimization modulo Bit-Vectors (OBV). We introduce two OBV ...