New answers tagged solver
2
The problem is feasible only if the sum of the rows equals the sum of the columns. That's true for your Reference table, but not for the other tables.
I'm not clear about what your objective function is intended to do relative to the Reference table. But your formula =((SUM(B19:F31))^2)^(1/2) makes no sense. Perhaps you intend to sum the squared differences ...
2
The question is a bit confusing, in that you say you have a MILP, mention a continuous variable but nothing about integer variables, and then ask about the dual solution (which exists for a continuous model but not for an integer model, at least not in the usual sense of "dual").
Assuming that we are talking about a linear program with the ...
2
MILP with a fixed objective function is hard as finding a feasible solution. Since this can still encode n-queens completion or SAT it is still in the same complexity class.
Depending on your problem some MILP heuristic might find a solution. Constraint satisfaction programming might be fast but it could be that encoding it into sat or pseudo boolean form ...
5
I am not aware of anything in the Coin-OR or AMPL ecosystem that does that as i am not familiar with those ecosystems. However one can convince the open source modeling language JuMP to do what you want with a few lines of Julia.
I assume you have a Julia installed and JuMP installed into your working (or global) environment.
Let's first create a model:
...
Top 50 recent answers are included