《英文版运筹学期末试卷.docx》由会员分享，可在线阅读，更多相关《英文版运筹学期末试卷.docx（8页珍藏版）》请在taowenge.com淘文阁网|工程机械CAD图纸|机械工程制图|CAD装配图下载|SolidWorks_CaTia_CAD_UG_PROE_设计图分享下载上搜索。
1、精品名师归纳总结资料word 精心总结归纳 - - - - - - - - - - - -XXXX学年第 X 学期运筹学期末试卷ClassID NumberNameScoreI. True/False(1) A balanced transportation problem has the same number of supply points as demand points.(2) In the search for an optimal solution of an LP problem, only vertexes of feasible region are needed to b
2、e considered.(3) The stepping stone method is used because the transportation problem cannot be solved via thesimplex method.(4) Linear Programming can be employed to solve problems with single objective.(5) If a resource is not finished out, then its shadow price must be positive.(6) The first step
3、 in applying the simplexmethod is to transform all inequality constraints into equality constraints by adding slack variables and subtracting surplus variables.(7) The optimal value of the primal objective function is equal to the optimal value of the dual objective function.(8) If a constraint is i
4、n “”form in LP problem, then artificial variable is necessary.(9) That the feasible region of LP is not empty means:(A) it includes the origin X=0,0,0;(B) it is bounded;(C) it is unbounded;(D) it is convex.A,B,C,D(10) Both the primal and dual problems are of feasible solution, then may be(A) an opti
5、mal solution is available for primal problem, but the optimal solution is not available for dual problem;(B) at least one problem is unbounded;(C) an optimal solution is available for one problem, and the other problem is of unbounded solution;(D) both the primal and dual problems might be of optima
6、l solution.A,B,C,D可编辑资料 - - - 欢迎下载精品名师归纳总结学习资料 名师精选 - - - - - - - - - -第 1 页，共 4 页 - - - - - - - - - -可编辑资料 - - - 欢迎下载精品名师归纳总结资料word 精心总结归纳 - - - - - - - - - - - -II. To solve the problems below:1Min. w = 14X 1 + 20X2s.t.X 1 + 4X2 4 X 1 + 5X2 2 2X1 + 3X2 7 X 1, X2 0Please find out the optimal soluti
7、ons for both this problem and its dual.2 The objective function of an LP is Max. Z = 5X1 +6X 2 +8X3. This LP is of two constraints resources #1 and # 2 respectively with “” foBrme.low is a processingstep by using simplex method.251/23/211/205-1/2-1/20-3/21a) To complete this table;b) Is this table o
8、ptimal. If “yes”, then do c; if “no”, then find out the optimal table.c) To write out the optimal solution and objective value.d) To writeoutthe shadow prices ofresources #1and #2, and describe the significances.可编辑资料 - - - 欢迎下载精品名师归纳总结学习资料 名师精选 - - - - - - - - - -第 2 页，共 4 页 - - - - - - - - - -可编辑资
9、料 - - - 欢迎下载精品名师归纳总结资料word 精心总结归纳 - - - - - - - - - - - -可编辑资料 - - - 欢迎下载精品名师归纳总结III. To find the shortest path and its length from A to E:7B1C11644D1236M+1可编辑资料 - - - 欢迎下载精品名师归纳总结A4B22C2E3434413D2B33C33M is the last place of your ID number.VI.To solve the transportation problem below:D1D2D3supplyS1
10、M+11812S224114S33674demand91011M is the last place of your ID number.可编辑资料 - - - 欢迎下载精品名师归纳总结学习资料 名师精选 - - - - - - - - - -第 3 页，共 4 页 - - - - - - - - - -可编辑资料 - - - 欢迎下载精品名师归纳总结资料word 精心总结归纳 - - - - - - - - - - - -IV.A factory is going to produce Products I, II and III by using raw materials A, B an
11、d C. The related data is shown below:Raw materialIIIIIIRaw material availableA211200kgB123500kgC221600kgProfit $413a) Please arrange production plan to make the profit maximization.b) If one more kg of raw material A is available, how much the total profit will be increased.c) The market price for raw material B is $1.2. Willthe factory buy it or sell it.Why.d) What is the allowed range for raw materials A, B and C respectively.e) What is the allowed range for the profit of product II.可编辑资料 - - - 欢迎下载精品名师归纳总结学习资料 名师精选 - - - - - - - - - -第 4 页，共 4 页 - - - - - - - - - -可编辑资料 - - - 欢迎下载