Abstract. This article is devoted to the study of sufficient conditions for using the completeness or quasicompleteness properties in two-criteria discrete optimization problems with the same and different weight-type criteria. The authors evaluated the cardinalities of sets of acceptable solutions, the Pareto set, and a complete set of alternatives for several two-criteria problems.

Keywords: vector optimization, Pareto set, complete set of alternatives, complete problem, quasi-complete problem.