Comparison of the ellipsoid and simplex methods
Articles
Eligijus Laurinavičius
Lithuanian University of Agriculture
Danutė Raškinienė
Lithuanian University of Agriculture
Published 1999-12-17
https://doi.org/10.15388/LMD.1999.35493
PDF

How to Cite

Laurinavičius, E. and Raškinienė, D. (1999) “Comparison of the ellipsoid and simplex methods”, Lietuvos matematikos rinkinys, 39(III), pp. 143–148. doi:10.15388/LMD.1999.35493.

Abstract

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.

PDF
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Downloads

Download data is not yet available.

Most read articles in this journal