[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Help-glpk] Re: Sudoku - can anyone make this work?

From: Martin
Subject: [Help-glpk] Re: Sudoku - can anyone make this work?
Date: Sun, 6 May 2007 21:22:16 +0100


Holy Moley - done in 4.9 seconds with your suggestion. That is faster than my OPL version.

Thanks again Andrew.


----- Original Message ----- From: "Andrew Makhorin" <address@hidden>
To: "Martin" <address@hidden>
Cc: "Ricardo Martins" <address@hidden>; <address@hidden>; <address@hidden>
Sent: Sunday, May 06, 2007 9:04 PM
Subject: Re: Sudoku - can anyone make this work?

Thanks to Andrew the small bug in my code has been corrected.
However, rather than obtaining a solution in 42 seconds I ran glpsol
for about 2 hours before terminating with no solution. The last few
lines of output are listed below. What's happening?

|694000:   objval =  0.000000000e+000   infeas =  1.039103772e+002 (315)
|694200:   objval =  0.000000000e+000   infeas =  9.525235136e+001 (315)
|694400:   objval =  0.000000000e+000   infeas =  7.407119664e+001 (315)

This is the output from the dual simplex. It begins if solution of
current subproblem takes more than 5 secs.

Try using the option '--intopt' to enable the mip presolver. It may
reduce the problem size by removing redundant rows and columns.

Andrew Makhorin

No virus found in this incoming message.
Checked by AVG Free Edition.
Version: 7.5.467 / Virus Database: 269.6.4/790 - Release Date: 05/05/2007 10:34

reply via email to

[Prev in Thread] Current Thread [Next in Thread]