This work includes a generalization of Bacopoulos’s and Singer’s theorem refering to the scalarization of a vectorial programming for a pair of convex functions defined on a vector space. It has been proved that Bacopoulos’s and Singer’s method of scalarization can also be applied in the case when the first function is linearly upper semi-continuous and the second is strictly quasi-convex. The relation between the local and global solutions of the problem of a vectorial programming and the behaviour of the set of minimal elements under their passing to the limit of the sequence of pairs of functions have also been studied. Remove selected