师涛盎匡凄敬轮貉葛棚森畦母
第一章 单元测试
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.电脑按键盘的Ctrl键+D键即可收藏本网页
2.手机浏览器可以添加书签收藏本网页
如需获取更多网课答案，可在浏览器访问我们的网站：http://www.mengmianren.com/
注：请切换至英文输入法输入域名，如果没有成功进入网站，请输入完整域名：http://www.mengmianren.com/
我们的公众号
打开手机微信，扫一扫下方二维码，关注微信公众号：萌面人APP
本公众号可查看各种网课答案，还可免费查看大学教材答案
点击这里，可查看公众号功能介绍
萌面人优惠券：一键领取淘宝，天猫，京东，拼多多无门槛优惠券，让您购物省省省，点击这里，了解详情
泪抄日洪别夹试隙烹撮唐嗣鸿