Skip to main content
SpringerLink
Log in

Simplex method and groups generated by reflections

  • Published:
Acta Applicandae Mathematica Aims and scope Submit manuscript

Abstract

A detailed account of the simplex method applied to a class of polyhedra (called Coxeter complexes) is given. The specific geometric properties of these polyhedra enable their use as a ‘testing-ground’ for comparison of various linear programming algorithms. Applications to sorting problems are given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bourbaki, N.: Groupes et algébre de Lie, ch. iv–vi. Hermann, Paris, 1968.

    Google Scholar 

  2. Deodhar, V. V.: On Bruhat ordering and weight-lattice ordering for a Weyl group, Nederl. Akad. Wetensch. Proc. A 81 (1978), 423–435.

    Google Scholar 

  3. Deodhar, V. V.: Some characterizations of Bruhat ordering on a Coxeter group and determination of the relative Mobius function. Invent. Math. 39 (1977), 187–198.

    Google Scholar 

  4. Deodhar, V. V.: Some characterizations of Coxeter groups, Enseign. Math. (2) 32 (1986), 111–120.

    Google Scholar 

  5. Faybusovich, L.: The simplex method in coordinate-free formulation, Cybernetics 19 (1983), 247–252.

    Google Scholar 

  6. Faybusovich, L.: Wolfe's algorithm for infinite dimensional quadratic programming problems, Eng. Cybernet. 20 (1983), 20–30.

    Google Scholar 

  7. Faybusovich, L.: The dual simplex method: the infinite-dimensional case, Cybernetics 20 (1984), 124–130.

    Google Scholar 

  8. Gavurin, M. and Malozemov, V.: Extremal Problems with Linear Constraints, LGU, Leningrad, 1984 (in Russian).

    Google Scholar 

  9. Gelfand, I. M. and Serganova, V. V.: Combinatorial geometries and torus strata on homogeneous compact manifolds, Russian Math. Surveys 42 (2) (1987), 133–168.

    Google Scholar 

  10. Gutkin, E.: Geometry and combinatorics of groups generated by reflections, Enseign. Math. (2) 32 (1986), 95–110.

    Google Scholar 

  11. Hiller, H.: Geometry of Coxeter Groups, Pitman, Boston, 1982.

    Google Scholar 

  12. Karmarkar, N.: A new polynomial time algorithm for linear programming, Combinatorica 4 (1984), 373–395.

    Google Scholar 

  13. Klee, V. and Minty, G. J.: How good is the simplex algorithm? in O., Shisha (ed.), Inequalities III, Academic Press, New York, 1972, pp. 159–175.

    Google Scholar 

  14. Smale, S.: On the efficiency of algorithms of analysis, Bull. Amer. Math. Soc. 13 (1985), 87–121.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Applied Sciences, Harvard University, Pierce Hall, Room G8, 02138, Cambridge, MA, U.S.A.

    Leonid Faybusovich

Authors
  1. Leonid Faybusovich
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Faybusovich, L. Simplex method and groups generated by reflections. Acta Appl Math 20, 231–245 (1990). https://doi.org/10.1007/BF00049569

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00049569

AMS subject classifications (1980)

Key words

Search

Navigation