First, multiple-choice questions (a total of 5 questions, a total of 40 points. )CBDDB DCBDD DACAD

1. In linear programming, when the number of constraint equations is m and the number of variables is n, and m < n, variables can be divided into two parts: basic variables and non-basic variables.

If the number of base variables is m, the number of non-base variables is (C. n-m).

2. If the optimal solution of the linear programming problem is not unique, then it is on the optimal simplex table (B).

3. For the canonical form of linear programming, when solving with simplex, the corresponding objective function value can be guaranteed to be (d) every time the base exchange iteration is done.

4. The mathematical model of linear programming problem consists of objective function, constraints and decision variables.

5. The graphic method of linear programming is suitable for linear programming model with decision variable (b.2).

1. The equilibrium transportation model of four producing areas and five sales areas has the characteristics of (D. 20 decision variables).

2. The basic variable of transportation problem is (C. m+n- 1).

3. In the following statements, what constitutes the objective function is (b) a family of parallel lines, which do not belong to the graphic steps of the objective programming model.

4. The task assignment problem has (D. 2m) constraints.

5. Solving the transportation problem by table operation When degradation occurs, a (D. 0) must be filled in the corresponding grid to indicate that this grid is a digital grid.

1. Plan review method has obvious advantages over Gantt chart, and the following statements are incorrect (D. None of the above statements are correct). A. it is easy to grasp the overall situation of the plan

B. it is easy to find weak links, control and manage them. C. it is convenient to analyze and compare all parties. D. None of the above statements are correct.

2. (A. Stage) refers to the number of steps required to make a decision on a problem.

3. The edge of a tree T with n nodes is exactly (C. n- 1).

4. Among the following algorithms, (A. Dixtra algorithm) is used to calculate the shortest path between two nodes.

5. The following statements are incorrect (D. None of the above statements are correct). The route that takes the longest time to complete each operation is called the critical route.

B. The process on the key route is called the key process C. The total time difference of all key processes is 0 d. None of the above statements is correct.

Second, the true and false question BBBBBA ABBA BBBA BBBA BBBA BBBA BBBA BBBA BBBA BBBA BBBA BBBA BBBA BBBA BBBA BBBA BBBA

1. If the linear programming problem has an optimal solution, it must be found in the basic feasible solution. B. correct

2. The optimal solution of linear programming is a feasible solution to optimize the objective function. B. correct

3. Although the graphic method and simplex method have different solutions, they are geometrically consistent. B. correct

4. If the feasible region of linear programming problem is an empty set, it indicates that there are contradictory constraints. B. correct

5. Linear programming problems must have finite optimal solutions. A. mistakes

6. The vertex of the feasible region of linear programming must be the optimal solution. A. mistakes

7. The dual problem of linear programming is the original problem. B. correct

8. When constraints are added, the feasible region of linear programming model will be reduced. A. mistakes

9. The constraint number of linear programming should be equal to that of its dual problem. A. mistakes

10. The test number of the base variable of the linear programming problem is always zero. B. correct

1 1. There is a dual relationship between the original problem of linear programming and its dual problem. B. correct

12. If artificial variables are added to the linear programming problem, when the problem meets the optimality condition, the time-base variables still contain artificial variables, indicating that the problem has no feasible solution. B. correct

13. If the original problem of linear programming has unbounded solution, its dual problem has no feasible solution. B. correct

14. Every basic solution of the linear programming problem should correspond to a vertex of the feasible region. A. mistakes

15. If the feasible region of a linear programming model is not empty and bounded, then there must be an optimal solution at its vertex. B. correct

The optimal solution of the 1. assignment problem has the property that if the smallest element of the column (row) is subtracted from each element of the coefficient matrix (cij),

If the new matrix (bij) is obtained, the optimal solution obtained by taking (bij) as the coefficient matrix is the same as that obtained by the original coefficient matrix. B. correct

2. The goal weight coefficient of goal planning is a quantitative concept. The smaller the value, the more important the goal is. A. mistakes

3. A closed loop refers to a zigzag closed polygon with a digital grid except that the starting point and the ending point are the same space. B. correct

4. When solving the transportation problem by table operation method, if all the figures in the inspection table are less than zero, the given scheme is the best scheme. A. mistakes

5. The table operation method is essentially a simplex method for solving transportation problems. B. correct

6. When solving the transportation problem, the basic feasible solution of the transportation problem can be obtained by using the closed-loop method. A. mistakes

7. The deviation variable refers to the gap between the actual value and the target value, where d+ is used to represent the gap between the actual value and the target value. A. mistakes

8. assignment problem Every element of the efficiency matrix is multiplied by the same constant k, which will not affect the optimal allocation scheme. A. mistakes

9. Table operation method is a method specially used to solve the linear programming model of transportation problems. B. correct

10. The transportation problem with the number of producing areas equal to the number of land sold is called the transportation problem with balanced production and sales. A. mistakes

1 1. If the elements of matrix A can be divided into "0" and non-"0" parts, then the minimum number of rows covering "0" elements is equal to being in different rows.

Maximum number of' 0' elements in different columns. B. correct

12. The transportation problem is a special linear programming model. B. correct

13. For the transportation problem with m starting points and n receiving points, the coefficient matrix of the problem has m×n rows. A. mistakes

14. The adjustment of transportation scheme will inevitably lead to the increase of total freight. A. mistakes

15. For the transportation problem where the total output is not equal to the total demand, the table operation method can also be directly used to solve the optimal transportation scheme. A. mistakes

1. If a dynamic programming problem can be represented by a network, nodes represent the state values of each stage, and each arc represents feasible scheme selection. B. correct

2. If there is at least one chain between any two points in a graph, such a graph is called a connected graph. B. correct

3. The maximum flow of the network refers to the maximum feasible flow that can pass through the network. B. correct

4. If a dynamic programming problem can be represented by a network, nodes represent the state values of each stage, and each arc represents the feasible scheme selection. B. correct

5. The edge of a tree with n nodes is exactly n+ 1. A. mistakes

6. There is only one path between any two points in the tree. B. correct

7. When there is no augmented chain in the network, the network reaches the maximum flow state. B. correct

8. A graph without a self-ring is a simple graph. A. mistakes

9. In the dynamic programming model, the number of stages of the problem should be equal to the number of subproblems in the problem. B. correct

10. The earliest end time of an operation is its earliest start time plus the planned time of the operation. B. correct

1 1.PERT network graph refers to a directed graph composed of nodes, arcs and weights. B. correct

12. The latest start time of an operation is its latest end time minus the operation time. B. correct

13. The optimality principle of dynamic programming ensures that future decisions from a certain state are independent of previous decisions. B. correct

14. The optimization principle holds that "regardless of the initial state and initial decision, the remaining decision sequence must constitute the optimal strategy of the state formed by the previous decision."

B. correct

15. In the dynamic programming problem, when defining the state, we should ensure the mutual independence of the decisions made at each stage. B. correct