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. W
> Does anyone know of a theoretical size limit for a non-integer GLPK
> problem?
Theoretically the problem size is limited by 100,000,000 rows and
columns and 500,000,000 non-zero constraint coefficients; this is
because glpk is a 32-bit application in the sense that it uses 32-bit
integers to acc
w Makhorin" <[EMAIL PROTECTED]>
> To: [EMAIL PROTECTED]
> Subject: Re: [Help-glpk] Problem size limit?
> Date: Tue, 18 Mar 2008 14:24:38 +0300
>
>
> > Does anyone know of a theoretical size limit for a non-integer GLPK
> > problem?
>
> Theoretically the problem si
> Having looked at a problem with two columns that glpk finds
> difficult here is one with over a million that it solves
> suprisingly well.
Mainly due to the simple matrix structure and the fact that your
instance needs no simplex iterations, since the optimal basis is
obvious (to the initial ba
> Benchmark.mod may be included in glpk's examples if you think that
> challenging glpk is interesting.
I have added your model to glpk examples changing its name to huge.mod.
___
Help-glpk mailing list
Help-glpk@gnu.org
http://lists.gnu.org/mailman/
" <[EMAIL PROTECTED]>
> Subject: Re: [Help-glpk] Problem size limit?
> Date: Wed, 19 Mar 2008 19:20:19 +0300
>
>
> > Benchmark.mod may be included in glpk's examples if you think that
> > challenging glpk is interesting.
> My LP problem is one with approximately 400K columns and 400K
> rows--of which, the matrix data is almost completely sparse. Based
> upon your information Andrew, this is well within the limits of GLPK
> (assuming adequate hardware is available). The concept of having to
> setup this many col
