An efficient algorithm of obtaining a set of undominated options of processes to be decomposed

An algorithm is proposed whereby options are generated which are undominated in the binary relation in the criterial space. The structure of the process to be decomposed is assumed specified for the set of options. Under certain constraints imposed on consistence of the criterial mapping and the binary relations an analog of the Bellman principle which holds for multicriterial problems is used in development of the algorithm.