“…The approach of the problem concerning the unicriterial optimality of the innovation strategies could be associated to classical problems of linear programming in integers or with a problem of ordination (Boldur et al, 1982: 204-207). Rephrasing one of the examples presented in the mentioned paper, we shall consider an innovation strategy S = {I , I } where I = {a , a , a }, and I = {a , a , a } represent sequences of operations , = 1,6 , using scarce resources ( = 1, = 1,3 ), , = 1,3 according to Table 1 Maintaining only the achievable sequences, we shall obtain the programmes of ordination: S1 = (a2, a4, a6, a1, a3, a5), S2 = (a1, a2, a3, a4, a5, a6), S3 = (a1, a2, a3, a5, a4, a6), S4 = (a1, a3, a2, a4, a5, a6), S5 = (a1, a3, a5, a2, a4, a6), (12) V1 = (0,2, 7, 11, 12, 17), V2 = (0, 0, 2, 2, 7, 7), V3 = (0, 0, 2, 7, 9, 14), V4 = (0, 1, 6, 8, 13, 13 According to the criterion of optimality, it results that S2 will be the optimal innovation strategy, holding the smallest length of accomplishment.…”