Thanks, I changed it and I can kind of reproduce glpsol's behaviour, but now I pinpointed the problem to this LP: http://www.mimuw.edu.pl/~mucha/lpQ_bad.txt
glpsol --cpxlp lpQ_bad.txt give UNBOUNDED solution here. However, both glpsol --std --cpxlp lpQ_bad.txt and glpsol --adv --cpxlp lpQ_bad.txt which is kind of weird. Also neither lpx_adv_basis nor lpx_std_basis seem to solve the problem from C++ API level. Could anyone please tell me what I am missing here? Marcin On Tue, Jul 29, 2008 at 1:31 PM, Andrew Makhorin <[EMAIL PROTECTED]> wrote: >> Hello, I have glpk 4.25 installed on my Ubuntu and I am having trouble >> with solving some LPs while glpksol solves them fine. I was trying to >> reproduce glpksol's behaviour in my C++ program but couldn't do it. >> What options should I use with glp_simplex to get the exact same >> behaviour as glpksol? > > You can enable lp presolver (see the second parameter passed to > glp_simplex). On api level it is disabled by default. > > -- Dwell not on close decisions, and thus, when you play against dwellers, you will make reciprocal gains in energy conservation and sanity preservation. Tommy Angelo _______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
