zoukankan      html  css  js  c++  java
  • VS2013调用GLPK求解线性规划

    最近做线性规划问题,要用到GLPK工具,VS2013环境下鼓捣了好久终于成功.下面一步步来展示一下环境的配置.

    1.下载GLPK4.45版本 http://glpk-for-windows.soft112.com/ 然后解压.

    2.用VS2013新建一个项目,命名为GLPK_TEST,源文件里建一个cpp文件命名为TESTGLPK.cpp

    3.右键选择这个工程的属性,选择常规,看到右边的"附加包含目录",点击它,选择GLPK下的include文件夹路径,然后确定.

    4.再找到属性下"链接器"-输入,可以看到右边第一个是添加依赖项,编辑它,在GLPK文件夹下面找到glpk_4_45.lib,选择并确定.

    5.跟glpk_4_45.lib相同目录下有glpk_4_45.dll文件,把它直接复制到你的工程目录下面.

    6.完成配置后可以输入代码测试一下,在GLPK说明文档里找一个例子,输入代码.

     1 #include "stdio.h"
     2 #include "glpk.h"
     3 
     4 int main()
     5 {
     6     glp_prob *lp;
     7     int ia[1 + 1000], ja[1 + 1000];
     8     double ar[1 + 1000], z, x1, x2, x3;
     9     s1: lp = glp_create_prob();
    10     s2: glp_set_prob_name(lp, "sample");
    11     s3: glp_set_obj_dir(lp, GLP_MAX);
    12     s4: glp_add_rows(lp, 3);
    13     s5: glp_set_row_name(lp, 1, "p");
    14     s6: glp_set_row_bnds(lp, 1, GLP_UP, 0.0, 100.0);
    15     s7: glp_set_row_name(lp, 2, "q");
    16     s8: glp_set_row_bnds(lp, 2, GLP_UP, 0.0, 600.0);
    17     s9: glp_set_row_name(lp, 3, "r");
    18     s10: glp_set_row_bnds(lp, 3, GLP_UP, 0.0, 300.0);
    19     s11: glp_add_cols(lp, 3);
    20     s12: glp_set_col_name(lp, 1, "x1");
    21     s13: glp_set_col_bnds(lp, 1, GLP_LO, 0.0, 0.0);
    22     s14: glp_set_obj_coef(lp, 1, 10.0);
    23     s15: glp_set_col_name(lp, 2, "x2");
    24     s16: glp_set_col_bnds(lp, 2, GLP_LO, 0.0, 0.0);
    25     s17: glp_set_obj_coef(lp, 2, 6.0);
    26     s18: glp_set_col_name(lp, 3, "x3");
    27     s19: glp_set_col_bnds(lp, 3, GLP_LO, 0.0, 0.0);
    28     s20: glp_set_obj_coef(lp, 3, 4.0);
    29     s21: ia[1] = 1, ja[1] = 1, ar[1] = 1.0; /* a[1,1] = 1 */
    30     s22: ia[2] = 1, ja[2] = 2, ar[2] = 1.0; /* a[1,2] = 1 */
    31     s23: ia[3] = 1, ja[3] = 3, ar[3] = 1.0; /* a[1,3] = 1 */
    32     s24: ia[4] = 2, ja[4] = 1, ar[4] = 10.0; /* a[2,1] = 10 */
    33     s25: ia[5] = 3, ja[5] = 1, ar[5] = 2.0; /* a[3,1] = 2 */
    34     s26: ia[6] = 2, ja[6] = 2, ar[6] = 4.0; /* a[2,2] = 4 */
    35     s27: ia[7] = 3, ja[7] = 2, ar[7] = 2.0; /* a[3,2] = 2 */
    36     s28: ia[8] = 2, ja[8] = 3, ar[8] = 5.0; /* a[2,3] = 5 */
    37     s29: ia[9] = 3, ja[9] = 3, ar[9] = 6.0; /* a[3,3] = 6 */
    38     s30: glp_load_matrix(lp, 9, ia, ja, ar);
    39     s31: glp_simplex(lp, NULL);
    40     s32: z = glp_get_obj_val(lp);
    41     s33: x1 = glp_get_col_prim(lp, 1);
    42     s34: x2 = glp_get_col_prim(lp, 2);
    43     s35: x3 = glp_get_col_prim(lp, 3);
    44     s36: printf("
    z = %g; x1 = %g; x2 = %g; x3 = %g
    ",
    45     z, x1, x2, x3);
    46     s37: glp_delete_prob(lp);
    47      return 0;
    48 }

    运行一下,可以看到测试结果.

    关于更多的GLPK使用与语法问题,可以参考doc文件夹下的说明文档.

  • 相关阅读:
    HDU 2853 (KM最大匹配)
    HDU 2852 (树状数组+无序第K小)
    HDU 2851 (最短路)
    HDU 2846 (AC自动机+多文本匹配)
    MyBatis使用示例
    Hessian示例:Java和C#通信
    SQL Server2005配置同步复制
    【问】如何应对关系型数据库中列的不断增加
    Prolog学习:数独和八皇后问题
    Prolog学习:基本概念
  • 原文地址:https://www.cnblogs.com/duanqiong/p/4476570.html
Copyright © 2011-2022 走看看