Is there a solver that is capable of solving a linear program, that has a quadratic objective function....where this program is made up of 800,000,000 binary variables and less than 50 constraints. My guess is that about 10,000 of the binary variable will be non-zero in the optimal solution.
asked
Redshorts |

The value of each binary variable in a typical solver is a 64-bit double precision number. I estimate that 8e8 variables will take up about 6 GB of RAM just to hold their values -- without any constraints, without the objective function, without any other structures the solver might create. Zeros still consume the full eight bytes per variable. That's the root node. If the problem doesn't solve at the root, start adding nodes to the tree. I'm not sure how much data is stored at each node, but my guess is that it's enough to make this a non-starter.
answered
Paul Rubin ♦♦ |

I suggest you using column generation approach.
answered
Duc Minh Vu |