I am trying to run an assignment problem. I created the DIMACS "mincost" file,
I used the "glpsol --mincost filename" option. Everything runs, but I'm not
sure if it's using the out-of-kilter algorithm or the Simplex. It kinda seems
like the simplex, see below for the first few lines and last few lines. If it
is using the Simplex, does GLPSOL have an option for call the out-of-kilter
method? I couldn't find it in the documentation.
GLPSOL: GLPK LP/MIP Solver, v4.45
Parameter(s) specified in the command line:
--mincost aa.lp --log log.txt --output out.txt --write solution.txt
Reading min-cost flow problem data from `aa.lp'...
Flow network has 30490 nodes and 3257988 arcs
3288479 lines were read
GLPK Simplex Optimizer, v4.45
30490 rows, 3257988 columns, 6515976 non-zeros
Preprocessing...
19360 rows, 3252321 columns, 6504642 non-zeros
Scaling...
A: min|aij| = 1.000e+000 max|aij| = 1.000e+000 ratio = 1.000e+000
Problem data seem to be well scaled
Constructing initial basis...
Size of triangular part = 19346
0: obj = 1.208490761e+009 infeas = 1.828e+004 (14)
500: obj = 1.181597022e+009 infeas = 1.653e+004 (13)
...
*269500: obj = 6.601862690e+008 infeas = 0.000e+000 (3)
*269719: obj = 6.601862010e+008 infeas = 0.000e+000 (3)
OPTIMAL SOLUTION FOUND
Time used: 10526.6 secs
Memory used: 2543.0 Mb (2666503012 bytes)
Writing basic solution to `out.txt'...
Writing basic solution to `solution.txt'...
3288480 lines were written
________________________________
This e-mail and any attachments may be confidential or legally privileged. If
you received this message in error or are not the intended recipient, you
should destroy the e-mail message and any attachments or copies, and you are
prohibited from retaining, distributing, disclosing or using any information
contained herein. Please inform us of the erroneous delivery by return e-mail.
Thank you for your cooperation.
_______________________________________________
Help-glpk mailing list
[email protected]
http://lists.gnu.org/mailman/listinfo/help-glpk
