Strange results with trivial linear optimization (coin-or-clp) -


i have extremely simple optimization problem:

minimize  obj:  + 400 selected_input_3 + 5000 selected_input_4 + 17592186044416 selected_input_5 + 100 selected_input_0 + 200 selected_input_1 + 300 selected_input_2 subject  c0: + 5000 selected_input_4 + 200 selected_input_1 + 100 selected_input_0 + 17592186044416 selected_input_5 + 300 selected_input_2 + 400 selected_input_3 >= 908 binary  selected_input_4 selected_input_1 selected_input_0 selected_input_5 selected_input_2 selected_input_3 end 

and try solve clp running:

clp test.lp solve solu $

which prints out bizarre:

clp test.lp solve solu $ coin lp version 1.16, build aug 20 2017 command line - clp test.lp solve solu $  presolve 1 (0) rows, 6 (0) columns , 6 (0) elements optimal - objective value 0 optimal objective 0 - 0 iterations time 0.002  optimal objective value               0       0 selected_input_3               0                     400       1 selected_input_4               0                    5000       2 selected_input_5               0           1.7592186e+13       3 selected_input_0               0                     100       4 selected_input_1               0                     200       5 selected_input_2               0                     300 

which if i'm interpreting correctly, telling me value variables 0, makes no sense (as violate constraint). i'm not sure last column trying either.


Comments

Popular posts from this blog

python - Operations inside variables -

Generic Map Parameter java -

arrays - What causes a java.lang.ArrayIndexOutOfBoundsException and how do I prevent it? -