[PPL-devel] [GIT] ppl/ppl(sparse_matrices): For checking purposes, use the exact LP solver of GLPK.

[Roberto Bagnara]

Module: ppl/ppl
Branch: sparse_matrices
Commit: 108769b7f3ca869c9c852da8f0fdaed22d4e6d64
URL:    http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=108769b7f3ca869c9c852da8f0fdaed22d4e6d64

Author: Roberto Bagnara <bagnara at cs.unipr.it>
Date:   Sun Aug 29 14:10:03 2010 +0200

For checking purposes, use the exact LP solver of GLPK.

---

 demos/ppl_lpsol/ppl_lpsol.c |    2 +-
 1 files changed, 1 insertions(+), 1 deletions(-)

diff --git a/demos/ppl_lpsol/ppl_lpsol.c b/demos/ppl_lpsol/ppl_lpsol.c
index 5b8abed..abf9fbd 100644
--- a/demos/ppl_lpsol/ppl_lpsol.c
+++ b/demos/ppl_lpsol/ppl_lpsol.c
@@ -589,7 +589,7 @@ maybe_check_results(const int ppl_status, const double ppl_optimum_value) {
     /* Set the problem class to LP: MIP problems are thus treated as
        LP ones. */
     lpx_set_class(glpk_lp, LPX_LP);
-    lpx_simplex(glpk_lp);
+    lpx_exact(glpk_lp);
     glpk_status = lpx_get_status(glpk_lp);
   }
   else {