Simplex method and groups generated by reflections

DOI10.1007/BF00049569zbMath0719.20020MaRDI QIDQ2639965

Leonid Faybusovich

Publication date: 1990

Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)

zbMATH Keywords

trajectoriespresentationsCoxeter groupspolyhedraconvex hullssorting problemssimplex-methodBruhat orderingorbits of Weyl groups

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Generators, relations, and presentations of groups (20F05) Reflection and Coxeter groups (group-theoretic aspects) (20F55)

Related Items (1)

Hamiltonian structure of dynamical systems which solve linear programming problems

Cites Work

• A new polynomial-time algorithm for linear programming
• Some characterizations of Coxeter groups
• Geometry and combinatorics of groups generated by reflections
• The simplex method in coordinate-free formulation
• On the efficiency of algorithms of analysis
• Combinatorial geometries and torus strata on homogeneous compact manifolds
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Simplex method and groups generated by reflections