《英文版运筹学期末试卷(共4页).doc》由会员分享，可在线阅读，更多相关《英文版运筹学期末试卷(共4页).doc（4页珍藏版）》请在taowenge.com淘文阁网|工程机械CAD图纸|机械工程制图|CAD装配图下载|SolidWorks_CaTia_CAD_UG_PROE_设计图分享下载上搜索。
1、精选优质文档-倾情为你奉上XXXX学年第X学期运筹学期末试卷Class ID Number NameScoreI. 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 be considered.(3) The stepping st
2、one method is used because the transportation problem cannot be solved via the simplex 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 in applying the simplex metho
3、d 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 in “” form in LP problem, then
4、 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 optimal solution is avai
5、lable 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 optimal solution.(A, B, C,
6、 D)II. To solve the problems below:(1) Min. w = 14X1 + 20X2 s.t. X1 + 4X2 4 X1 + 5X2 22X1 + 3X2 7 X1, X2 0Please find out the optimal solutions for both this problem and its dual.(2) The objective function of an LP is Max. Z = 5X1 +6X2 +8X3. This LP is of two constraints (resources #1 and # 2 respec
7、tively) with “”form. Below is a processing step by using simplex method.2551/2-1/23/2-1/2101/2-3/201a) To complete this table;b) Is this table optimal? 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 write out the shadow p
8、rices of resources #1 and #2, and describe the significances.III. To find the shortest path and its length from A to E: 7 B1 C1 1 6 4 4 D1 M+1 2 3 6 A 4 B2 2 C2 E 3 4 3 4 4 1 3 D2 B3 3 C3 3 M is the last place of your ID number.VI. To solve the transportation problem below:D1D2D3supplyS1M+11812S2241
9、14S33674demand91011M is the last place of your ID number.IV. A factory is going to produce Products I, II and III by using raw materials A, B and C. The related data is shown below:Raw material I II IIIRaw material availableABC2 1 11 2 32 2 1200 (kg)500 (kg)600 (kg)Profit ($)4 1 3a) Please arrange p
10、roduction 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. Will the 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?专心-专注-专业