Linear Programs and Convex Hulls Over Fields of Puiseux Fractions
From MaRDI portal
Publication:2807865
Abstract: We describe the implementation of a subfield of the field of formal Puiseux series in polymake. This is employed for solving linear programs and computing convex hulls depending on a real parameter. Moreover, this approach is also useful for computations in tropical geometry.
Recommendations
- Convex analysis in \(\mathbb{Z}^n\) and applications to integer linear programming
- The complexity of linear problems in fields
- Separating hyperplanes for convex sets over ordered fields
- Coisotropic invariant tori of hamiltonian systems of the quasiclassical theory of motion of a conduction electron
- On the convex hull of solutions to polynomial congruences
- A Polyhedral Frobenius Theorem with Applications to Integer Optimization
- Semidefinite representation of convex hulls of rational varieties
- Solving linear constraints over real and rational fields
- On constraint sets of infinite linear programs over ordered fields
- Approximating some convex programs in terms of borel fields
Cited in
(7)- Tropical computations in \texttt{polymake}
- Computing convex hulls and counting integer points with \texttt{polymake}
- Convergent Hahn series and tropical geometry of higher rank
- Moduli spaces of codimension-one subspaces in a linear variety and their tropicalization
- Face posets of tropical polyhedra and monomial ideals
- Log-Barrier Interior Point Methods Are Not Strongly Polynomial
- What Tropical Geometry Tells Us about the Complexity of Linear Programming
This page was built for publication: Linear Programs and Convex Hulls Over Fields of Puiseux Fractions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807865)
