运筹学w（Operations research, w）.doc

运筹学w（Operations research, w） Type of test paper: (A) A single choice (the title of 5 items, each item of 3 points, a total of 15 points) 1. The following statement is correct (A). A. linear programming problem, if there is an optimal solution, it must be a feasible basis solution of the base variable group B. linear programming problem must have feasible basis solution The optimal solution of the C. linear programming problem must be unique When D. simplex method is used to solve linear programming problem, every iteration base must be iterated once, and the value of the objective function will be dropped once 2, let M be a linear programming problem, and N is its dual problem, and (A) is incorrect. A.M has the optimal solution, and N does not necessarily have the optimal solution B. if both M and N have the optimal solution, the two optimal values must be equal C. if M has no feasible solution, then N has no bounded optimal solution The dual problem of D.N is M 3, in the use of test table number operation Faqiugefeiji variables, a closed loop method and the two methods (B). A. northwest corner method B. potential method C. minimum element method D. freight balance method 4, PERT network diagram, (C) expressed as the completion of a process needed for the time or resources and other data. A. node B. arc C. right D. circle 5, a tree with 7 nodes, the edge of T is exactly (B). A.5 B.6 C.7 D.8 Two, determine the title (the title of 6 items, each item of 3 points, a total of 18 points) 1, the optimal solution of the dual variable is equal to the chance cost of the slack variable of the original problem. ((to)) 2, the positive deviation variable should take positive value, and the negative deviation variable should be negative. ((wrong)) In the 3 and PERT network diagrams, the earliest completion time of the job is its earliest start time plus the scheduled time of the job. ((to)) In the 4 and PERT network diagrams, any action that consumes time or resources can be calle