# HG changeset patch
# User athos
# Date 1113229595 0
# Node ID b261caf79ce7e3edfa0c7900d3496181ffca0fc3
# Parent  6b2bdd70fe99fb7b2b51ad30ded8eb9e9fab97e5
A little modification: a call for primalStatus().

diff -r 6b2bdd70fe99 -r b261caf79ce7 src/work/athos/lp/lp_sample.cc
--- a/src/work/athos/lp/lp_sample.cc	Sun Apr 10 16:26:26 2005 +0000
+++ b/src/work/athos/lp/lp_sample.cc	Mon Apr 11 14:26:35 2005 +0000
@@ -37,10 +37,16 @@
   lp.setObj(10*x1+6*x2+4*x3);
   
   lp.solve();
-  
-  printf("\nZ = %g; x1 = %g; x2 = %g; x3 = %g\n", 
-	 lp.primalValue(), 
-	 lp.primal(x1), lp.primal(x2), lp.primal(x3));
+
+  if (lp.primalStatus()==LpSolverBase::OPTIMAL){
+    printf("Z = %g; x1 = %g; x2 = %g; x3 = %g\n", 
+	   lp.primalValue(), 
+	   lp.primal(x1), lp.primal(x2), lp.primal(x3));
+  }
+  else{
+    std::cout<<"Optimal solution not found!"<<std::endl;
+  }
+
 
   //Here comes the same problem written in C using GLPK API routines