Polyhedral frameworks are designed to support compilers techniques for analysis and transformation of codes with nested loops, producing exact results for loop nests with affine loop bounds and subscripts ("Static Control Parts" of programs)..
The polyhedral model is a powerful framework for automatic optimization and parallelization.
It is based on an algebraic representa- tion of programs, allowing to construct and search for complex sequences of optimizations..
Polyhedral optimization asks for the optimal value of a linear function, subject to constraints defined by linear inequalities.
The simplex method solves polyhedral optimization problems defined in normal forms..
The polyhedral approach is a powerful tool for solving mixed integer linear programs (1).
This is the topic of this tutorial.
Babylonian tablets show that mathematicians were already solving systems of linear equations over 3000 years ago..
The polyhedral model (also called the polytope method) is a mathematical framework for programs that perform large numbers of operations -- too large to be explicitly enumerated -- thereby requiring a compact representation..
