[Help-glpk] Sparse vs. Dense problems

[Dragos Ilie]

Hi!

According to the GLPK manual the interior-point solver is fit for 
solving sparse LP problem and is quite inefficient for dense problems.

My understanding is that a sparse problem is one where most of the 
entries in the coefficient matrix are zero. Conversely, a dense problem 
has mostly non-zero entries in the coefficient matrix. Is this correct? 
Is there  a more accurate definition or rule quantifying what "most" 
entries means in terms of the size of the matrix?

Regards,
Dragos