in your example its not true that 9 >= 10 + 10 - 1.

see, if you rearrange you get:

Ti + Tj <= 1 + Tij

so there is an upper bound.

]]>i don't understand why the conditions bounds the solution.

for teta_i, teta_j, i can choose any positive integer i like - for example 10 and 10, and for teta_ij i can choose 9.

it seems this assignment stands in all the conditions, and it seems we can choose any greater positive integer and it we will still ger good assignment.

If there is not bound then there is no solution that can max f(teta), right?

]]>