[Help-glpk] Problem size limit?

[orlan]

Hello all,
  Does anyone know of a theoretical size limit for a non-integer GLPK problem?

  At some level, large problems may not be solvable to optimality in a 
'reasonable' amount of time (given available hardware).  Very, very large 
problems may not be solveable to optimality, perhaps ever.  What is GLPK's 
limits in terms of the number of constraints that can be described, etc.  Is 
there a way to feed an array of data (in the appropriate format) directly into 
GLPK instead of generating a huge .MOD file that must be parsed, etc.

  Anyone care to mention how large of a problem that they have solved with GLPK 
in terms of decision variables, constraints, etc.

Thank you,
Orlan Franks