The ellipsoid method is presented. The least squers functional of the basic solution linear constrains is used as ellipsoid. The Klee-Minty linear programming problem is used to compare the ellipsoid and simplex methods.
This work is licensed under a Creative Commons Attribution 4.0 International License.