Julia 为什么GLPK解算器不';不要在跳跃中罗嗦什么?
我创建了以下简单代码作为演示:Julia 为什么GLPK解算器不';不要在跳跃中罗嗦什么?,julia,glpk,julia-jump,verbosity,Julia,Glpk,Julia Jump,Verbosity,我创建了以下简单代码作为演示: using GLPK using JuMP m = Model(GLPK.Optimizer) @variable(m, y[i=1:100], Bin) @objective(m, Min, sum(y)) @constraint(m, [j=5:50], sum([y[i] for i in j:j+10]) >= 5) optimize!(m) 请注意,这个整数程序并不代表任何东西,它只是一个例子。前面的代码没有输出任何内容,而我记得我使用了Guro
using GLPK
using JuMP
m = Model(GLPK.Optimizer)
@variable(m, y[i=1:100], Bin)
@objective(m, Min, sum(y))
@constraint(m, [j=5:50], sum([y[i] for i in j:j+10]) >= 5)
optimize!(m)
请注意,这个整数程序并不代表任何东西,它只是一个例子。前面的代码没有输出任何内容,而我记得我使用了Gurobi,甚至GLPK和Julia JuMP来输出数据,说明它在当前求解过程中的位置。已经处理了多少个节点,算法运行了多长时间,当前最佳界限等等。请注意,它与我的整数程序的大小无关,因为它不会在我使用更多约束和变量运行的更大程序上输出任何内容
我还尝试:
julia> get_optimizer_attribute(m, MOI.Silent())
false
这与以下内容一致,不改变任何内容:
julia> unset_silent(m)
false
我错过什么了吗
我正在运行Julia 1.5.2、JuMP v0.21.5和GLPK v0.14.4。设置日志记录级别:
julia> set_optimizer_attribute(m, "msg_lev", GLPK.GLP_MSG_ALL)
3
julia> optimize!(m)
GLPK Simplex Optimizer, v4.64
46 rows, 100 columns, 506 non-zeros
67: obj = 2.500000000e+001 inf = 2.000e+001 (5)
74: obj = 2.600000000e+001 inf = 0.000e+000 (0)
* 77: obj = 2.500000000e+001 inf = 0.000e+000 (0)
OPTIMAL LP SOLUTION FOUND
GLPK Integer Optimizer, v4.64
46 rows, 100 columns, 506 non-zeros
100 integer variables, all of which are binary
Integer optimization begins...
+ 77: mip = not found yet >= -inf (1; 0)
+ 77: >>>>> 2.500000000e+001 >= 2.500000000e+001 0.0% (1; 0)
+ 77: mip = 2.500000000e+001 >= tree is empty 0.0% (0; 1)
INTEGER OPTIMAL SOLUTION FOUND
设置日志记录级别:
julia> set_optimizer_attribute(m, "msg_lev", GLPK.GLP_MSG_ALL)
3
julia> optimize!(m)
GLPK Simplex Optimizer, v4.64
46 rows, 100 columns, 506 non-zeros
67: obj = 2.500000000e+001 inf = 2.000e+001 (5)
74: obj = 2.600000000e+001 inf = 0.000e+000 (0)
* 77: obj = 2.500000000e+001 inf = 0.000e+000 (0)
OPTIMAL LP SOLUTION FOUND
GLPK Integer Optimizer, v4.64
46 rows, 100 columns, 506 non-zeros
100 integer variables, all of which are binary
Integer optimization begins...
+ 77: mip = not found yet >= -inf (1; 0)
+ 77: >>>>> 2.500000000e+001 >= 2.500000000e+001 0.0% (1; 0)
+ 77: mip = 2.500000000e+001 >= tree is empty 0.0% (0; 1)
INTEGER OPTIMAL SOLUTION FOUND
太好了:)太好了:)