# Klee-Minty polytope

### From Glossary

This is an example to show that the elementary simplex method
does not have polynomial time complexity. The polytope is

Maximizing

over this polytope shows the exponential complexity.

[edit]

Polytope |

A bounded polyhedron.