第一章 单元测试
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:less than
B:equal to
C:more than
答案: 【equal to】
2、单选题：
In general, an increase in variable costs will（ ）the break-even point, all other things held constant.
选项：
A:decrease
B:not change
C:increase
答案: 【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:Decision analysis
B:Transportation and assignment
C:Project management (like CPM/PERT)
D:Linear programming models
答案: 【Decision analysis;
Transportation and assignment;
Project management (like CPM/PERT);
Linear programming models】
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:≤5
C:No limitation
D:≥3
答案: 【2】
2、单选题：
In the linear programming model, ( ) restrict the decision variables to zero or positive values.
选项：
A:The features of variables
B:Objective function
C:Resource requirements
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:A straight line connecting two vertices
B:It’s impossible
C:A line segment connecting two vertices
D:Two solutions
答案: 【A line segment connecting two vertices】
4、单选题：
The following features of standard form of Linear programming are correct（ ）.
选项：
A:The decision variables are nonnegative
B:The decision variables are not equal to zero
C:None of above is true
D:There is no limit to the symbol of decision variables
答案: 【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,1,4/5)
D:Y= (0,3/5,4/5,1)
答案: 【Y= (4/5,3/5,1,0)】
2、单选题：
The following statements of 100% rule of objective function coefficient is correct（ ）.
选项：
A:None of above is correct.
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:Only can increasing coefficients follow this 100% rule.
答案: 【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=3
B:Z=4
C:Z=5
答案: 【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+x5≤1, x4+x5≤1
B:x3+x5≥1, x4+x5≥1
C:x3+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、单选题：
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-1
D:m*n
答案: 【m+n】
2、单选题：
The incorrect statement of transportation problem in the following statements is ( ).
选项：
A:The number of constraints equals the number of base variables.
B:It can utilize the simplex algorithm of linear programming to solve.
C:It can utilize the tabular method to solve.
D:It must have the optimal solution.
答案: 【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 traffic volume does not appear negative.
B:make sure that the freight cost can be reduced to a certain extent.
C:make sure that the balance of production and selling can be realized.
D:make sure that the optimal scheme can be realized.
答案: 【make sure that the traffic volume does not appear negative.】
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:7
B:1
C:2
D:-1
答案: 【-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:错
答案: 【错】
第六章 单元测试
1、单选题：
In terms of graph theory, the following statement is incorrect ( ).
选项：
A:If an edge is removed from a tree, the tree won’t be connected.
B:If a tree has n nodes, the number of its edges is n-1.
C:If there is one more edge in the tree, there must be a circle.
D:Nodes in a tree may not be connected to each other.
答案: 【Nodes in a tree may not be connected to each other.】
2、单选题：
There are ( ) odd vertices in the graph.
选项：
A:3
B:4
C:1
D:2
答案: 【2】
3、单选题：
In order to get the minimal spanning tree of this graph by Kruskal Algorithm, the number of remaining edges is (D), and in ascending order of weight, we should remain the edge ( ) with the weight of 5 in order to avoid circle.
选项：
A:6; (v2, v3)
B:5; (v3, v4)
C:5; (v2, v3)
D:6; (v1, v4)
答案: 【5; (v2, v3)】
4、判断题：
Dijkstra algorithm is only used to calculate the shortest route from the first vertex v1 to other vertices. ( ）
选项：
A:对
B:错
答案: 【错】
5、判断题：
The Bellman algorithm can be used to find out the shortest route from v1 to any vertex, even the weight being negative. （ ）
选项：
A:错
B:对
答案: 【对】
第七章 单元测试
1、判断题：
In the Gantt charts, the horizontal axis represents time and the vertical axis represents each activity. （ ）
选项：
A:对
B:错
答案: 【对】
2、单选题：
The critical activity in critical path is ( ).
选项：
A:the most important activity
B:the end activity
C:the longest duration activity
D:the earliest beginning activity
答案: 【the longest duration activity】
3、单选题：
Please indicate the critical path in the following network(every number below the activity represents its duration). ( )
选项：
A:A→B→E→G
B:A→B→D→F→G
C:A→C→F→G
答案: 【A→C→F→G】
4、判断题：
A virtual activity is used in an AOA network to show an actual passage of time, not just the precedence relationship. ( ）
选项：
A:错
B:对
答案: 【错】
5、判断题：
When we carry on the calculation steps for the lowest cost schedule in networks, no matter how we shorten the duration of activities, the critical path won’t change. ( ）
选项：
A:对
B:错
答案: 【错】
第八章 单元测试
1、单选题：
Decision tree consists of ( ).
选项：
A:decision node, state node, and result node
B:decision maker, state node, and result node
C:decision node, decision scheme, and decision criterion
D:decision maker, decision scheme, and decision criterion
答案: 【decision node, state node, and result node】
2、单选题：
The method of decision-making problem includes ( ).
选项：
A:Excel tool
B:Dynamic programming method
C:Graph theory
D:Simplex algorithm
答案: 【Excel tool】
3、判断题：
If the decision maker can gain the probability of each state by investigation, decision problem under uncertainty can be transformed to risky decision problem. ( ）
选项：
A:对
B:错
答案: 【对】
4、判断题：
The decision criteria, which include Maximax, Maximin, Minimax regret, Hurwicz, and Equal likelihood, will result in the same decision. ( )
选项：
A:对
B:错
答案: 【错】
评论0