1.1 --- a/src/demo/lp_demo.cc Sat May 21 21:04:57 2005 +0000
1.2 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000
1.3 @@ -1,113 +0,0 @@
1.4 -#ifdef HAVE_CONFIG_H
1.5 -#include <config.h>
1.6 -#endif
1.7 -
1.8 -#include <iostream>
1.9 -
1.10 -
1.11 -#ifdef HAVE_GLPK
1.12 -#include <lemon/lp_glpk.h>
1.13 -#elif HAVE_CPLEX
1.14 -#include <lemon/lp_cplex.h>
1.15 -#endif
1.16 -
1.17 -using namespace lemon;
1.18 -
1.19 -#ifdef HAVE_GLPK
1.20 -typedef LpGlpk LpDefault;
1.21 -#elif HAVE_CPLEX
1.22 -typedef LpCplex LpDefault;
1.23 -#endif
1.24 -
1.25 -int main()
1.26 -{
1.27 - //The following example is taken from the documentation of the GLPK library.
1.28 - //See it in the GLPK reference manual and among the GLPK sample files (sample.c)
1.29 - LpDefault lp;
1.30 - typedef LpDefault::Row Row;
1.31 - typedef LpDefault::Col Col;
1.32 -
1.33 - lp.max();
1.34 -
1.35 - Col x1 = lp.addCol();
1.36 - Col x2 = lp.addCol();
1.37 - Col x3 = lp.addCol();
1.38 -
1.39 - //One solution
1.40 - // Row p = lp.addRow();
1.41 - // Row q = lp.addRow();
1.42 - // Row r = lp.addRow();
1.43 - // lp.setRow(p,x1+x2+x3 <=100);
1.44 - // lp.setRow(q,10*x1+4*x2+5*x3<=600);
1.45 - // lp.setRow(r,2*x1+2*x2+6*x3<=300);
1.46 -
1.47 - //A more elegant one
1.48 - //Constraints
1.49 - lp.addRow(x1+x2+x3 <=100);
1.50 - lp.addRow(10*x1+4*x2+5*x3<=600);
1.51 - lp.addRow(2*x1+2*x2+6*x3<=300);
1.52 - //Nonnegativity of the variables
1.53 - lp.colLowerBound(x1, 0);
1.54 - lp.colLowerBound(x2, 0);
1.55 - lp.colLowerBound(x3, 0);
1.56 - //Objective function
1.57 - lp.setObj(10*x1+6*x2+4*x3);
1.58 -
1.59 - lp.solve();
1.60 -
1.61 - if (lp.primalStatus()==LpSolverBase::OPTIMAL){
1.62 - printf("Z = %g; x1 = %g; x2 = %g; x3 = %g\n",
1.63 - lp.primalValue(),
1.64 - lp.primal(x1), lp.primal(x2), lp.primal(x3));
1.65 - }
1.66 - else{
1.67 - std::cout<<"Optimal solution not found!"<<std::endl;
1.68 - }
1.69 -
1.70 -
1.71 - //Here comes the same problem written in C using GLPK API routines
1.72 -
1.73 -// LPX *lp;
1.74 -// int ia[1+1000], ja[1+1000];
1.75 -// double ar[1+1000], Z, x1, x2, x3;
1.76 -// s1: lp = lpx_create_prob();
1.77 -// s2: lpx_set_prob_name(lp, "sample");
1.78 -// s3: lpx_set_obj_dir(lp, LPX_MAX);
1.79 -// s4: lpx_add_rows(lp, 3);
1.80 -// s5: lpx_set_row_name(lp, 1, "p");
1.81 -// s6: lpx_set_row_bnds(lp, 1, LPX_UP, 0.0, 100.0);
1.82 -// s7: lpx_set_row_name(lp, 2, "q");
1.83 -// s8: lpx_set_row_bnds(lp, 2, LPX_UP, 0.0, 600.0);
1.84 -// s9: lpx_set_row_name(lp, 3, "r");
1.85 -// s10: lpx_set_row_bnds(lp, 3, LPX_UP, 0.0, 300.0);
1.86 -// s11: lpx_add_cols(lp, 3);
1.87 -// s12: lpx_set_col_name(lp, 1, "x1");
1.88 -// s13: lpx_set_col_bnds(lp, 1, LPX_LO, 0.0, 0.0);
1.89 -// s14: lpx_set_obj_coef(lp, 1, 10.0);
1.90 -// s15: lpx_set_col_name(lp, 2, "x2");
1.91 -// s16: lpx_set_col_bnds(lp, 2, LPX_LO, 0.0, 0.0);
1.92 -// s17: lpx_set_obj_coef(lp, 2, 6.0);
1.93 -// s18: lpx_set_col_name(lp, 3, "x3");
1.94 -// s19: lpx_set_col_bnds(lp, 3, LPX_LO, 0.0, 0.0);
1.95 -// s20: lpx_set_obj_coef(lp, 3, 4.0);
1.96 -// s21: ia[1] = 1, ja[1] = 1, ar[1] = 1.0; /* a[1,1] = 1 */
1.97 -// s22: ia[2] = 1, ja[2] = 2, ar[2] = 1.0; /* a[1,2] = 1 */
1.98 -// s23: ia[3] = 1, ja[3] = 3, ar[3] = 1.0; /* a[1,3] = 1 */
1.99 -// s24: ia[4] = 2, ja[4] = 1, ar[4] = 10.0; /* a[2,1] = 10 */
1.100 -// s25: ia[5] = 3, ja[5] = 1, ar[5] = 2.0; /* a[3,1] = 2 */
1.101 -// s26: ia[6] = 2, ja[6] = 2, ar[6] = 4.0; /* a[2,2] = 4 */
1.102 -// s27: ia[7] = 3, ja[7] = 2, ar[7] = 2.0; /* a[3,2] = 2 */
1.103 -// s28: ia[8] = 2, ja[8] = 3, ar[8] = 5.0; /* a[2,3] = 5 */
1.104 -// s29: ia[9] = 3, ja[9] = 3, ar[9] = 6.0; /* a[3,3] = 6 */
1.105 -// s30: lpx_load_matrix(lp, 9, ia, ja, ar);
1.106 -// s31: lpx_simplex(lp);
1.107 -// s32: Z = lpx_get_obj_val(lp);
1.108 -// s33: x1 = lpx_get_col_prim(lp, 1);
1.109 -// s34: x2 = lpx_get_col_prim(lp, 2);
1.110 -// s35: x3 = lpx_get_col_prim(lp, 3);
1.111 -// s36: printf("\nZ = %g; x1 = %g; x2 = %g; x3 = %g\n", Z, x1, x2, x3);
1.112 -// s37: lpx_delete_prob(lp);
1.113 -// return 0;
1.114 -
1.115 - return 0;
1.116 -}