第五章测试1.In the transportation model, the number of demand places and supply places is n and m respectively. The number of constraints is ( ).
A:m*n B:m+n-1 C:m+n D:m*n-1
答案:C
2.The incorrect statement of transportation problem in the following statements is ( ).
A:It must have the optimal solution. B:It can utilize the simplex algorithm of linear programming to solve. C:It can utilize the tabular method to solve. D:The number of constraints equals the number of base variables. 3.When we adjust the transportation scheme by closed-loop method, the rule is that the maximum value of transportation increasing in the cell equals the minimum value of the numeral cell to be reduced, which is to ( ).
A:make sure that the balance of production and selling can be realized. B:make sure that the traffic volume does not appear negative. C:make sure that the optimal scheme can be realized. D:make sure that the freight cost can be reduced to a certain extent. 4.
A company transports a material from three supply places A1, A2, and A3 to B1, B2, and B3. All information of transportation volume is listed as the following table. The middle cells are the price of unit transportation volume. For the optimal scheme of minimum cost, we utilize the tabular method for solving it and we calculate the test number of A2B3 that is the minimum price of unit volume in non-basic variables ( ). A:-1 B:7 C:2 D:1 5.For the transportation problem of minimum value, the optimal transportation scheme can be gained when the test numbers are less than or equal to zero. ( ）
A:错 B:对
温馨提示支付 ￥3.00 元后可查看付费内容,请先翻页预览!
