title: Finding optimal combination of elements that minimizes evaluation function
body: <p>The optimal grouping of elements is that in which the evaluation function is the smallest.</p>
  <p>Wherein:</p>
  <ul>
  <li>each group must have a fixed number of elements - N=3,</li>
  <li>all elements of the sequence must necessarily be included in some group,</li>
  <li>there are 24 elements</li>
  <li>each element can be used once</li>
  <li>each element is described by three values ​​(id - number, ValueA, ValueB).</li>
  </ul>
  <p>Each distribution of elements into groups is described by an evaluation function:</p>
  <ol>
  <li><p>V = E + C,</p>
  </li>
  <li><p>E = MAX (sum (ValueA)) - Min (sum (ValueA)), where sum    (ValueA) is
  the sum of ValueА of one group</p>
  </li>
  <li><p>С = avg (c1, C2, c3),    where c1 = ABS (SUM (ValueA) - Sum
  (ValueB)) - group 1</p>
  </li>
  </ol>
  <p>I have tried bruteforce method , but it seems it would take ages to complete.  What is the name of problems like that ? It looks like linear programming problem, but i might be wrong. If i could know type of problem , i would probably be able to research on my own.</p>