[Clp] CLP solve a linear programming model with 35, 000 dec. variables and 100, 000 constraints.

[usa usa]

Julian,

What if I find a machine with memory large enough to hold the matrix ?

Are there some internal limits about the matrix size inside CLP
implementation ?

Especially, the limits about matrix inversion or other matrix operations ?

thanks





On Mon, May 9, 2016 at 4:51 AM, Julian Hall <jajhall at ed.ac.uk> wrote:

> Dear Usa
>
> Not a hope. With no sparsity to exploit, your problem has 3.5G values,
> each needing 8B of memory. To solve the problem with Clp probably needs
> about 80G memory.
>
> Both your problem dimensions are at least half an order of magnitude too
> large.
>
> Julian
>
>
> On 9 May 2016 04:56:45 BST, usa usa <usact2012 at gmail.com> wrote:
>
>> Hi,
>>
>> I would like to solve a linear programming model by CLP on a laptop with
>> 8 GB memory.
>>
>> It has 35,000 dec. variables and 100,000 constraints.
>>
>> The constraint matrix is very dense.
>>
>> Is it possible to solve this size of LP model by CLP ?
>>
>> Any advices would be appreciated.
>>
>> thanks !
>>
>> ------------------------------
>>
>> Clp mailing list
>> Clp at list.coin-or.org
>> http://list.coin-or.org/mailman/listinfo/clp
>>
>>
> --
> Sent from my Android device with K-9 Mail. Please excuse my brevity.
>
> The University of Edinburgh is a charitable body, registered in
> Scotland, with registration number SC005336.
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/clp/attachments/20160509/6ae3537f/attachment.html>