Comparison of the ellipsoid and simplex methods
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.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vilnius University Press
1999-12-01
|
| Series: | Lietuvos Matematikos Rinkinys |
| Online Access: | https://www.zurnalai.vu.lt/LMR/article/view/35493 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|