Page MenuHomePhabricator

[MLIR] Introduce LexSimplex to support lexicographic optimization
ClosedPublic

Authored by arjunp on Jan 16 2022, 10:31 AM.

Details

Summary

This patch introduces a class LexSimplex that can currently be used to find the
lexicographically minimal rational point in an IntegerPolyhedron. This is a
series of patches leading to computing the lexicographically minimal integer
lattice point as well parametric lexicographic minimization.

Diff Detail

Event Timeline

arjunp created this revision.Jan 16 2022, 10:31 AM
arjunp requested review of this revision.Jan 16 2022, 10:31 AM
Groverkss added inline comments.Jan 16 2022, 9:22 PM
mlir/include/mlir/Analysis/Presburger/IntegerPolyhedron.h
204
mlir/include/mlir/Analysis/Presburger/Simplex.h
82
83
mlir/unittests/Analysis/Presburger/IntegerPolyhedronTest.cpp
985

Is there any reason for not adding tests with symbols/local variables? If not, could you add one test to just check if they are supported.

arjunp updated this revision to Diff 400489.Jan 17 2022, 4:11 AM
arjunp marked 3 inline comments as done.
  • clang-format
  • Address kunwar's comments
arjunp updated this revision to Diff 400512.Jan 17 2022, 6:18 AM
arjunp marked an inline comment as done.
  • small update to doc
This revision is now accepted and ready to land.Jan 17 2022, 8:54 AM

I'll wait for a couple of days in case @bondhugula has some comments.

This revision was landed with ongoing or failed builds.Jan 28 2022, 8:37 AM
This revision was automatically updated to reflect the committed changes.