In computational complexity theory, the ellipsoid algorithm is attractive because its complexity depends on the number of columns and the digital size of the coefficients, but not on the number of rows.
The ellipsoid algorithm in computational complexity theory is advantageous since its efficiency is determined by the number of columns and the scale of the coefficients, not by the number of rows.