I have an integer programming problem with $L$ variables $x_1, x_2, x_{L}$ which all assume integer values and the following constraints must stand:
- $x_i \geq 0$
- $x_1 = 10$
- $x_2 + x_3 + ... + x_{L} = 36$
how can I find the max and min of the following quantity?
- $\displaystyle{\sum_{l = 1}^{L-1} x_{l}\,x_{l + 1}}$
My question is more oriented towards finding out the algorithm used to solve this problem that the exact number of max and min value but obviously if you can come up with an answer without using integer programming that is still more than welcome!