Changeset 1577:15098fb5275c in lemon-0.x for demo/lp_demo.cc

Timestamp:

07/20/05 18:05:04 (19 years ago)

Author:

athos

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2078

Message:

Documentation (lp_demo,lp_maxflow) and slight changes (rest).

File:

• demo/lp_demo.cc (modified) (4 diffs)

demo/lp_demo.cc

@@ +1 @@
+/* -*- C++ -*-
+ * demo/graph_to_eps.cc - Part of LEMON, a generic C++ optimization library
+ *
+ * Copyright (C) 2005 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
+ * (Egervary Research Group on Combinatorial Optimization, EGRES).
+ *
+ * Permission to use, modify and distribute this software is granted
+ * provided that this copyright notice appears in all copies. For
+ * precise terms see the accompanying LICENSE file.
+ *
+ * This software is provided "AS IS" with no warranty of any kind,
+ * express or implied, and with no claim as to its suitability for any
+ * purpose.
+ *
+ */
+
+/// \ingroup demos
+/// \file
+/// \brief A program demonstrating the LEMON LP solver interface
+///
+/// This program is a simple application of the LEMON LP solver
+/// interface: we formulate a linear programming (LP) problem and then
+/// solve it using the underlying solver (GLPK or CPLEX for
+/// example). For the detailed documentation of the LEMON LP solver
+/// interface read \ref lemon::LpSolverBase "this".
+
 #ifdef HAVE_CONFIG_H
 #include <config.h>
@@ -14 +40 @@
 using namespace lemon;
 
+
+
 #ifdef HAVE_GLPK
 typedef LpGlpk LpDefault;
+const char default_solver_name[]="GLPK";
 #elif HAVE_CPLEX
 typedef LpCplex LpDefault;
+const char default_solver_name[]="CPLEX";
 #endif
 
@@ -30 +60 @@
   typedef LpDefault::Col Col;
   
+
+  std::cout<<"A program demonstrating the LEMON LP solver interface"<<std::endl; 
+  std::cout<<"Solver used: "<<default_solver_name<<std::endl;
 
   //This will be a maximization
@@ -55 +88 @@
   //Print results
   if (lp.primalStatus()==LpSolverBase::OPTIMAL){
-    printf("Z = %g; x1 = %g; x2 = %g; x3 = %g\n", 
+    std::cout<<"Optimal solution found!"<<std::endl;
+    printf("optimum value = %g; x1 = %g; x2 = %g; x3 = %g\n", 
            lp.primalValue(), 
            lp.primal(x1), lp.primal(x2), lp.primal(x3));