[Clp] Re. to John, Hok and Michael

[Alexey Lvov]

  Thank you for your responses!


I have sent the code producing the large example and the output to John.
Unfortunately the attachments do not go through the mailing list, so I am
copying only the text of the message:

Here is the code (Nash equilibrium for a game of simplified poker):

The code consists of a single file:[attachment "x.cpp" deleted by Alexey
Lvov/Watson/IBM]
Some documentation: [attachment "x.ps" deleted by Alexey Lvov/Watson/IBM]
An example of a ready output of the program:[attachment
"h06_f6_sb01_ai0200_ppr.ps" deleted by Alexey Lvov/Watson/IBM]

"x 4" runs the huge example.
"x 3" runs a small example (finishes in <= 3min. even under valgrind)
"x 2" "x 1" "x 0" are medium examples.

The "x 4" gives the segmentation fault after ~30 hours of run on AIX
machine (rios19) with 64GB of memory, peak memory usage is 1.3GB.
Here is the output (I ran it with model->setLogLevel(1), so it does not
have that many details)
[attachment "q.txt" deleted by Alexey Lvov/Watson/IBM]

All smaller examples (up to 50000 var.) run fine.
By the way CLP does not run absolutely clean under "valgrind" memcheck. It
produces a lot of "uninitialized memory reads", but I assume it is ok...
[attachment "errors_under_valgrind.txt" deleted by Alexey Lvov/Watson/IBM]

 - Alexey




----------------------------------------------------
          Dr. Alexey Lvov
IBM T.J. Watson Research Institute
1101 Kitchawan Rd. (Rt. 134) Office 34-159
Yorktown Heights  NY  10598
Tel: (914)-945-3732
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/clp/attachments/20090512/c9317d5b/attachment.html>