Hi,(adsbygoogle = window.adsbygoogle || []).push({});

I have a fairly simple problem which but I'm not sure if it should rather be in a computer science forum for algorithms or something.

Given n vectors, how do you choose the sign of each vector as to maximize the modulus of the sum of the vectors?

Sure you could go through all 2^n combinations, but that's not necessarily the most efficient way (really, you only need to go through 2^(n-1) since the second half is just negative the first half, but still). I can't figure out what all the dependencies are.

**Physics Forums | Science Articles, Homework Help, Discussion**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Choose the signs of vectors as to maximize modulus of their sum.

**Physics Forums | Science Articles, Homework Help, Discussion**