Simplex method and groups generated by reflections
From MaRDI portal
The class of polyhedra arising as convex hulls of orbits of Weyl groups is considered. A detailed description of the simplex-method for this class is given. It is shown that there exists a one-to-one correspondence between trajectories of the simplex-method from a particular extreme point and reduced presentations of the related element of the Weyl group. Relationships between Bruhat ordering and sorting problems are studied. Necessary results from the theory of Coxeter groups are given with complete proofs.
Recommendations
Cites work
- A new polynomial-time algorithm for linear programming
- Combinatorial geometries and torus strata on homogeneous compact manifolds
- Geometry and combinatorics of groups generated by reflections
- scientific article; zbMATH DE number 3889273 (Why is no real title available?)
- scientific article; zbMATH DE number 3954641 (Why is no real title available?)
- scientific article; zbMATH DE number 3661606 (Why is no real title available?)
- scientific article; zbMATH DE number 3759173 (Why is no real title available?)
- scientific article; zbMATH DE number 3466805 (Why is no real title available?)
- scientific article; zbMATH DE number 3297198 (Why is no real title available?)
- On the efficiency of algorithms of analysis
- Some characterizations of Coxeter groups
- The simplex method in coordinate-free formulation
Cited in
(3)
This page was built for publication: Simplex method and groups generated by reflections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2639965)