True or False
1. The deviational variable di- typically denotes underachievement
2. In goal programming (GP), we have to to satisfy all goals in our solution
3. In a transshipment problem, nodes are considered as either pure supply nodes or pure demand nodes
4. It is possible that there are finite solutions for an integer programming with an unbounded feasible region
5. A goal programming problem assumes that its objective function and constraints are linear
6. In a goal programming problem, we need to minimize the total underachievement of goals instead of the total overachievements of goals
7. In an unbalanced transportation problem where total supply exceeds total demand, the supply constraints will typically have "≥" inequalities
8. If we employ enumerating corner point methods to solve an LP problem, we may skip some alternate optional solution points
9. It is possible that the optimal solution of a transportation problem under a balanced supply-demand situation is not same as that of its corresponding transportation problem under an unbalanced supply-demand situation.
10. For an integer programming problem with binary variables, it must have non-negativity constraints
11. Cassandra and Hbase are distributed noSQL-based databases
12. An Min-max LP problem seeks to find the min of the maximum of a set of decision variables, which are not independent variables.