Comments and answers for "Unreasonable values for decision variables"
https://developer.ibm.com/answers/questions/481332/unreasonable-values-for-decision-variables.html
The latest comments and answers for the question "Unreasonable values for decision variables"Answer by DanielJunglas
https://developer.ibm.com/answers/answers/481366/view.html
Assuming that fsP, fsW are non-negative and vCapacity is strictly positive, it seems to me that Q=0 and x=1 is a feasible solution.
Constraints "pharmacies" and "warehouse" are trivially satisfied for Q=0 because the left-hand side of them will be 0.
That leaves the first three constraints. sum(j in n)(Q[j][i]) is 0 for each i. So (sum(j in n)(Q[j][i]) > vCapacity) is false for each i. So the left side of the '==' constraint is false. The right side of each constraint expands to x[i] == sum(j in n)(Q[j][i]) / vCapacity, which is the same as x[i]==0 since Q=0. Since x=1 this is false. So both sides of the top-level ==-constraint are false: the constraint is satisfied.
So at least the solution is feasible. Whether it is optimal I cannot tell because you did not post your data (maybe edit your question and add it).
Since you think the solution is wrong, I suggest to double-check your first three constraints. Maybe they don't express what they should do. Maybe update your question with a description of what those constraints are supposed to mean.Tue, 20 Nov 2018 20:07:11 GMTDanielJunglas