运筹学题（Operations research topic）.docVIP

运筹学题（Operations research topic） A linear programming problem with linear programming: (2 points per space, 16 points) The solution of linear programming is the only optimal linear programming solution, infinite number of optimal solutions, unbounded solutions and insolvable solutions. 2. In the scheduling transport problem with the least cost of linear programming, if the test number of a non-basic variable is 4, it indicates that if a freight volume is increased in the space, the freight will be increased by 4. 3. if there is a feasible solution to the original linear programming of linear programming, there must be a feasible solution to the dual problem. wrong 4. If an integral plan of a linear programming: MaxZ = X1 + X2 The X1 x2 + 9/14 51/14 or less - 2 x1 + X2 one-third or less X1, X2 is greater than or equal to 0 and both are integers The optimal solution for the corresponding linear programming (relaxation problem) is X1 = 3/2, X2 = 10/3, MaxZ = 6/29, and we now have to branch out X1, which should be divided into X1 is less than or equal to 1 and X1 is greater than or equal to 2. 5. When using reverse solutions for dynamic programming, the meaning of fk (sk) is the optimal solution from the k stage to the n th phase. 6. Assuming that the feasible solution of a linear programming is D, and the feasible solution of the corresponding integer programming is B, the relationship between D and B contains B 7. It is known that the following table is the optimal single form table for the development of production planning problems (the maximization problem, the constraint condition is the less than or equal type inequality), where X3, X4 and X5 are the relaxation variables. XB, b, X1, X2, X3, X4, X5 X4, 0, 0, minus 2, 1, 3 X1, 4/3, 1, 0, minus 1/3, 0, 2/3 X2 1 0 1 0 0 minus 1 Cj-zj 0 0-5 0-23 Q: (1) write b-1 = (2) optimal solution to the dual problem: Y = (5, 0, 23, 0, 0) T 8. If there are infinitely many optimal solutions for linear programming problems, the test