Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | Last revisionBoth sides next revision | ||
user_guide:tutorials:optimization [2019/01/25 09:38] – ↷ Page moved from user_guide:optimization to user_guide:tutorials:optimization oroehrig | user_guide:tutorials:optimization [2019/01/25 10:56] – ↷ Links adapted because of a move operation oroehrig | ||
---|---|---|---|
Line 11: | Line 11: | ||
There are several other tutorials that cover similar topics: | There are several other tutorials that cover similar topics: | ||
- | * [[user_guide: | + | * [[user_guide:tutorials: |
- | * [[user_guide: | + | * [[user_guide:tutorials: |
- | * [[user_guide: | + | * [[user_guide:tutorials: |
- | * [[user_guide: | + | * [[user_guide:tutorials: |
This tutorial is targeted towards the optimization community, since, surprisingly, | This tutorial is targeted towards the optimization community, since, surprisingly, | ||
Line 311: | Line 311: | ||
===== Integral Polytopes and Total Unimodularity ===== | ===== Integral Polytopes and Total Unimodularity ===== | ||
- | As explained in the previous example, the integral points in a polytope are of particular interest in discrete optimization. These points are called //lattice points// in polymake and the corresponding convex hull //lattice polytope//. The handling of such polytopes is explained in more detail in the [[user_guide: | + | As explained in the previous example, the integral points in a polytope are of particular interest in discrete optimization. These points are called //lattice points// in polymake and the corresponding convex hull //lattice polytope//. The handling of such polytopes is explained in more detail in the [[user_guide:tutorials: |
Of particular interest for discrete optimization are properties of the orginal inequality system to define a lattice polytope, i.e., a polytope such that all of its vertices are integral (this can be tested by checking the property '' | Of particular interest for discrete optimization are properties of the orginal inequality system to define a lattice polytope, i.e., a polytope such that all of its vertices are integral (this can be tested by checking the property '' |