... | ... |
@@ -1045,8 +1045,8 @@ |
1045 | 1045 |
for (int i = 0; i != _node_num; ++i) { |
1046 | 1046 |
_sum_supply += _supply[i]; |
1047 | 1047 |
} |
1048 |
if ( !(_stype == GEQ && _sum_supply <= 0 || |
|
1049 |
_stype == LEQ && _sum_supply >= 0) ) return false; |
|
1048 |
if ( !((_stype == GEQ && _sum_supply <= 0) || |
|
1049 |
(_stype == LEQ && _sum_supply >= 0)) ) return false; |
|
1050 | 1050 |
|
1051 | 1051 |
// Remove non-zero lower bounds |
1052 | 1052 |
if (_have_lower) { |
0 comments (0 inline)