7-10 Multiple Choices(Select the only one correct answer, no need to write answers) 7. Binary variables are A) 0 or Lonly. B) any integer value C) any continuous value. D) any negative integer value. 8. In a transportation problem, items are allocated from sources to destinations A) at a maximum cost. B) af a minimum cost C) at a minimum profit. D) at a minimum revenue 9. The linear programming model for a transportation problem has constraints for supply at each and at each destination. A) destination, source B) source, destination C) demand, source D) source, demand 10. In a 0-1 integer programming model, if the constraint x]x2=0, it means when project I is selected, project 2 . be selected. A) can also B) can sometimes C) can never D) must also