<table border="1" cellspacing="0" cellpadding="8">
    <tr>
        <th>Issue</th>
        <td>
            <a href=https://github.com/llvm/llvm-project/issues/55554>55554</a>
        </td>
    </tr>

    <tr>
        <th>Summary</th>
        <td>
            Implement integer linear optimization
        </td>
    </tr>

    <tr>
      <th>Labels</th>
      <td>
            mlir:presburger
      </td>
    </tr>

    <tr>
      <th>Assignees</th>
      <td>
      </td>
    </tr>

    <tr>
      <th>Reporter</th>
      <td>
          Superty
      </td>
    </tr>
</table>

<pre>
    Currently linear optimization and feasibility checks for integer linear programming are supported, but not optimizing the objective of an integer linear program. A trivial algorithm using binary search is possible, but see this [paper](https://www.math.uwaterloo.ca/~bico/papers/basis.pdf) for a more sophisticated algorithm. (The feasibility check already implements that part of the paper.)
</pre>
<img width="1px" height="1px" alt="" src="http://email.email.llvm.org/o/eJx1UcuunDAM_RrYWEXAwMywYHF720pdtz_ggAHfBhIlzoymX1-DNLp9qAgRBz_Ow8aNj_41hUCb2AdY3ggDOC-88k8UdhvgNsJEGNmwZXnAsNDwI8LkAvAmNFN4tvng5oDrytsMGAhi8t4FoTGrX8Ekgc3Jc_ZeIwuBM280CN80mhTqPyMLeAEJfGO0gHZ2gWVZIcV9iuENwwOilg8LcATvopK19ESNRAqliaz96NFTyNpPWX1dRHzMTi9Z_UXf-_1erChLke4oFKxzxYB76vLZ8OA0OlqjBka9iIUfp6zuDhsQVrfLdV5RhAcdML7TLEDBvqvUf0zUmkA4PoBXb2nVFUQligIeg-x-7AYdsIVC5WN_GrtTh7mwWOq_Ppv-9uz37eUp2P5PpbOSSqYY3KoXa2_P44N6ve9Crxxjol1qq0-TL31bnqpzey6xm65dW5VV1dXVcG4a_TaX8ZxbNGRjrw5ndb1aDgrnA0WTgjLTf-p5zn1d1nXZVteqrHVMcRk700zUTA22LZ7GrClpRbbFzqdwYc5Df1AzaY6atGpvfE-i7nneiA5YnY9JFhf6b0kdk0d-qOgPCb8Ak10Aqg">