title: Using min/max *within* an Integer Linear Program
body: <p>I'm trying to set up a linear program in which the objective function adds extra weight to the <code>max</code> out of the decision variables multiplied by their respective coefficients.</p>
  
  <p>With this in mind, is there a way to use <code>min</code> or <code>max</code> operators <b>within</b> the objective function of a linear program?</p>
  
  <p>Example:</p>
  
  <pre><code>Minimize
      (c1 * x1) + (c2 * x2) + (c3 * x3) + (c4 * max(c1*x1, c2*x2, c3*x3)) 
  subject to
      #some arbitrary integer constraints:
      x1 &gt;= ...
      x1 + 2*x2 &lt;= ... 
      x3 &gt;= ...
      x1 + x3 == ...
  </code></pre>
  
  <p>Note that <code>(c4 * max(c1*x1, c2*x2, c3*x3))</code> is the "extra weight" term that I'm concerned about. We let <code>c4</code> denote the "extra weight" coefficient. Also, note that <code>x1</code>, <code>x2</code>, and <code>x3</code> are <b>integers</b> in this particular example. </p>
  
  <p>I think the above might be outside the scope of what linear programming offers. However, perhaps there's a way to hack/reformat this into a valid linear program?</p>
  
  <p>If this problem is completely out of the scope of linear programming, perhaps someone can recommend an optimization paradigm that is more suitable to this type of problem? (Anything that allows me to avoid manually enumerating and checking all possible solutions would be helpful.)</p>