In diffie Hellman, is it possible to modify linear combinations so the end result is a multiple of the first result? Does this type of Diffie Hellman problem has a specific name?

Let s say I ve `D=i×A+n×B+k×C` like `D=55×A+36×B+578×C` over an elliptic curve with a large prime number and the discrete logarithm between each point being unknown. If `i` is a whitelisted constant, is it possible to modify `n` and `k` such as the new D is a multiple of the old D, for example 7D? Or getting a multiple of the negative inverse like -55D?