第一章 单元测试

1、 问题:A basic feasible solution of an LP problem have one and only one related feasible basis.
选项:
A:对
B:错
答案: 【


2、 问题:If the primal LP problem is unbounded, then the feasible region of dual problem must be empty.
选项:
A:对
B:错
答案: 【

3、 问题:If the LP problem is solvable, then
选项:
A:The value of the LP problem is finite
B:There exists an optimal basic feasible solution to this LP problem
C:The feasible region of this LP problem is nonempty
D:There is a feasible regular solution of this LP problem
答案: 【
The value of the LP problem is finite
There exists an optimal basic feasible solution to this LP problem
The feasible region of this LP problem is nonempty
There is a feasible regular solution of this LP problem

4、 问题:If the primal LP problem has optimal solutions, then
选项:
A:The dual problem is bounded
B:The feasible region of the dual problem is nonempty
C:The dual problem has an optimal basic feasible solution
D:The dual problem is non-degenerate
答案: 【
The dual problem is bounded
The feasible region of the dual problem is nonempty
The dual problem has an optimal basic feasible solution

5、 问题:Which of the following assertions for the feasible region of a standard LP problem is incorrect?
选项:
A:The feasible region is convex
B:The feasible region might not have vertex
C:The feasible region might have infinitely many vertices
D:The feasible region might be unbounded
答案: 【
The feasible region might have infinitely many vertices

第二章 单元测试

1、 问题:If the relaxed LP problem has feasible solution, then the related ILP problem has nonempty feasible region
选项:
A:对
B:错
答案: 【

2、 问题:After adding the cutting plane, the new simplex table corresponds to a regular solution to the new LP problem
选项:
A:对
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:错
答案: 【

4、 问题:Which of the following assertions for the branch-and-bound method are correct?
选项:
A:If the value of current sub-problem is larger than the bound, the branch for this sub-problem should be cut off.
B: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.
C:If the corresponding relaxed LP problem has an integer optimal solution, then this solution is the optimal solution of ILP problem
D: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.
答案: 【
If the value of current sub-problem is larger than the bound, the branch for this sub-problem should be cut off.
If the corresponding relaxed LP problem has an integer optimal solution, then this solution is the optimal solution of ILP problem

5、 问题:Which of the following assertions for the cutting plane method are correct?
选项:
A:If the relaxed problem has feasible solution, then the ILP problem has feasible solution
B:After adding the cutting plane, if the new relaxed problem is unsolvable then, the original ILP is unsolvable
C:After adding the cutting plane,one should using the dual simplex method to solve the new relaxed problem
D:In the procedure of solving ILP by cutting plane method,the feasible region of the relaxed LP problem will become smaller in each iteration.
答案: 【
After adding the cutting plane, if the new relaxed problem is unsolvable then, the original ILP is unsolvable
After adding the cutting plane,one should using the dual simplex method to solve the new relaxed problem
In the procedure of solving ILP by cutting plane method,the feasible region of the relaxed LP problem will become smaller in each iteration.

第三章 单元测试

1、 问题:Which of the following assertions for the descent direction is incorrect?
选项:
A:The value of the cost function will decrease along the descent direction
B:For an unconstrained optimization problem,there is no descent direction on the local minimizer of the cost function
C:When one uses the descent direction to construct a iteration algorithm, the step size should be sufficiently large.
D:In an optimization problem, the descent direction might not be a feasible direction.
答案: 【
When one uses the descent direction to construct a iteration algorithm, the step size should be sufficiently large.

本门课程剩余章节答案为付费内容
本文章不含期末不含主观题!!
本文章不含期末不含主观题!!
支付后可长期查看
有疑问请添加客服QQ 2356025045反馈
如遇卡顿看不了请换个浏览器即可打开
请看清楚了再购买哦,电子资源购买后不支持退款哦

   

发表评论

电子邮件地址不会被公开。 必填项已用*标注