Linear Programming Problem - what is feasible size for solution on a PC I need to get feeling for the feasible size of a LPP, that can be solved on a PC.
Say, its a good one (8 cores @ 3+GHz,  64GB RAM).
We also assume that number of variables is close to the number of additional conditions.
I know it depends on the solver, but what size is feasible for solution in several hours/few days?
1000 of variables? A million?
Order of magnitude would be enough.
Update. Let's consider a general form:
matrix is not sparce/diagonal/blotchy or whatever.
Let's say matrix's rows are filled with many hundreds of values (@ thousands of variables).
I would assume a few times n^3 operations for n variables. How many operations per second can you perform? Using vector operations is not too difficult. Using 8 cores for one problem is hard. Depending on your programming effort you will be able to do between 1 and 100 billion operations per second, or 100 to 10,000 trillion operations per day, or very roughly n = 20,000 to 100,000. Buy a lot of RAM as well.