Re: [Help-glpk] DIMACS, mincost and GLPSOL

[Meketon, Marc]

Thanks. I was afraid that you were going to recommend something like that.




----- Original Message -----
From: Andrew Makhorin [mailto:address@hidden
Sent: Tuesday, April 05, 2011 05:10 PM
To: Meketon, Marc
Cc: address@hidden <address@hidden>
Subject: Re: [Help-glpk] DIMACS, mincost and GLPSOL


> 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.
>

The --mincost option only means that the input data is in dimacs format.
Currently to solve the mincost instance glpsol converts it to LP and
calls the simplex solver, which is not much efficient in this case. To
use the out-of-kilter algorithm you need to write a simple main program,
which calls glp_read_mincost and then glp_mincost_okalg. Please see an
example of such program on page 32 in the document "GLPK: Graph and
Network Routines" included in the distribution (doc/graphs.pdf).


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.