恨磁沃哀毁科瘟谎来茬丝狈肝
第一章 单元测试
1、 The purpose of break-even analysis is to determine the number of units of a product to sell or produce that will equate total revenue with total cost. At the break-even point, the profit is ( ) zero.
A:more than
B:less than
C:equal to
答案: equal to
2、 In general, an increase in variable costs will（ ）the break-even point, all other things held constant.
A:increase
B:decrease
C:not change
答案: increase
3、 It’s important to make full use of techniques in management science process, which techniques are commonly used for the purpose of decision-making（ ）?
A:Linear programming models
B:Decision analysis
C:Transportation and assignment
D:Project management (like CPM/PERT)
答案: Linear programming models
Decision analysis
Transportation and assignment
Project management (like CPM/PERT)
4、 Manufacturing companies develop linear programming models to help decide how many units of different products they should produce to maximize their profit (or minimize their cost), given scarce resources such as capital, labor, and facilities. ( ）
A:对
B:错
答案: 对
第二章 单元测试
1、 If the graphical method is used to solve the linear programming problem, the number of decision variables should be ( ).
A:2
B:≥3
C:≤5
D:No limitation
答案: 2
2、 In the linear programming model, ( ) restrict the decision variables to zero or positive values.
A:Objective function
B:Resource requirements
C:The features of variables
D:Nonnegativity constraints
答案: Nonnegativity constraints
3、 If the optimal solution of the linear programming problem is reached at two vertices of feasible domain at the same time, then the optimal solution has ( ).
A:Two solutions
B:A line segment connecting two vertices
C:A straight line connecting two vertices
D:It’s impossible
答案: A line segment connecting two vertices
4、 The following features of standard form of Linear programming are correct（ ）.
A:The decision variables are not equal to zero
B:There is no limit to the symbol of decision variables
C:The decision variables are nonnegative
D:None of above is true
答案: The decision variables are nonnegative
5、 The optimal solution of the linear programming problem must be the feasible solution. （ ）
A:对
B:错
答案: 对
第三章 单元测试
1、 
Given that a linear programming problem is as following, the optimal solution of dual problem is ( ).
A:Y= (1,0,3/5,4/5)
B:Y= (4/5,3/5,1,0)
C:Y= (0,3/5,4/5,1)
D:Y= (0,3/5,1,4/5)
答案: Y= (4/5,3/5,1,0)
2、 The following statements of 100% rule of objective function coefficient is correct（ ）.
A:Only can increasing coefficients follow this 100% rule.
B:The sum of all changed coefficients percentages of allowable increase and allowable decrease equals 100%, the optimal solution won’t change.
C:The sum of all changed coefficients percentages of allowable increase and allowable decrease does not reach 100%, the optimal solution won’t change.
D:None of above is correct.
答案: The sum of all changed coefficients percentages of allowable increase and allowable decrease does not reach 100%, the optimal solution won’t change.
3、 The duality of a dual problem is not necessarily the primal problem. ( ）
A:对
B:错
答案: 错
4、 Shadow price is actually a marginal price. ( ）
A:对
B:错
答案: 对
5、 If the primal problem of linear programming adds a constraint, it is equivalent to adding a variable to the dual problem.（ ）
A:对
B:错
答案: 对
第四章 单元测试
1、 
Please solve the following integer problem and get the maximum Z= ( ).
A:Z=4
B:Z=5
C:Z=3
答案: Z=4
2、 A drilling team needs to determine 5 exploration wells from 10 alternative wells to minimize the total drilling cost. If 10 wells are represented by s1, s2, …s10, the costs being c1, c2, …c10, one of constraints is: if the plan chooses s3 or s4, then s5 cannot be selected and vice versa. We set a 0-1 variable, xj(j=1, 2, …10), then this constraint can be expressed ( )
A:x3+x4+x5≤1
B:x3+x5=1, x4+x5=1
C:x3+x5≥1, x4+x5≥1
D:x3+x5≤1, x4+x5≤1
答案: x3+x5≤1, x4+x5≤1
3、 Branch-and-cut technique is only suitable for solving pure integer programming problems. ( ）
A:对
B:错
答案: 错
4、 Simply rounding off non-integer simplex solution values for models requiring integer solutions is not always appropriate. Rounding can often lead to suboptimal results. ( ）
A:对
B:错
答案: 对
5、 Assignment problem doesn’t belong to 0-1 integer programming problem. ( ）
A:对
B:错
答案: 错
上方为免费预览版答案，如需购买完整答案，请点击下方红字
为了方便下次阅读，建议在浏览器添加书签收藏本网页
添加书签方法：
1.电脑按键盘的Ctrl键+D键即可收藏本网页
2.手机浏览器可以添加书签收藏本网页
我们的公众号
打开手机微信，扫一扫下方二维码，关注微信公众号：萌面人APP
本公众号可查看各种网课答案，还可免费查看大学教材答案
焦滦漂速涡林狼凛刚纤峦烽胎