第二章测试1.If the relaxed LP problem has feasible solution, then the related ILP problem has nonempty feasible region
A:对 B:错
答案:B
2.After adding the cutting plane, the new simplex table corresponds to a regular solution to the new LP problem
A:错 B:对
答案:B
3.In the branch-and-bound method, the bound is the value of cost function on a integer optimal solution to some relaxed sub-problem
A:错 B:对
答案:B
4.Which of the following assertions for the branch-and-bound method are correct?
A:If the current sub-problem has integer optimal solution and the value is smaller than the bound, then the integer optimal solution is the solution to the original problem. B:If the corresponding relaxed LP problem has an integer optimal solution, then this solution is the optimal solution of ILP problem C:If the value of the sub-problem is smaller than the current bound and the optimal solution is not an integer solution, then this branch should be cut off. D:If the value of current sub-problem is larger than the bound, the branch for this sub-problem should be cut off.
答案:BD
5.Which of the following assertions for the cutting plane method are correct?
A:After adding the cutting plane, if the new relaxed problem is unsolvable then, the original ILP is unsolvable B:After adding the cutting plane,one should using the dual simplex method to solve the new relaxed problem C:In the procedure of solving ILP by cutting plane method,the feasible region of the relaxed LP problem will become smaller in each iteration. D:If the relaxed problem has feasible solution, then the ILP problem has feasible solution
答案:ABC
