koorio.com
海量文库 文档专家
当前位置:首页 >> 数学 >>

11-12-2Operations Research期末试题(应数)A


山东财经大学 2011--2012 学年第 2 学期期末试题
Operations Research(05005022)试卷 (A)
题号 得分 签字
学 号





















总分

注意事项:所有的答案都必须写在答题纸(答题卡)上,答在试卷上一律无效。

I. Judgement(2’×5=10’) 1.A basic solution to the linear programming problem corresponds to a point of its feasible region.( ) ) )

2.A basic solution is inevitably a feasible solution.(
姓 名

3.The dual simplex method is devised for the dual problems.(

4.The big M method is able to find an initial feasible base for the linear programming problem.( )

5.The traveling salesman problem is related to the Hamiltonian graphs.(
班 级

)

II. Cloze(2’×5=10’) 1.An optimal solution to the linear programming problem

?min z ? x1 ? x 2 ?s.t. x1 ? x 2 ? ?1 ? is_______________. ? x1 ? x 2 ? ?1 ? ? x1 , x 2 ? 0 ?
学 院

2.The

conventional

algorithm

for

the

assignment

problem

第 1 页 共 4 页

is_______________. 3.The content of the strong duality is that_______________. 4.Write out the LINGO program for the integer programming problem
?max z ? 2 x1 ? x 2 ?s.t. 5 x1 ? 4 x 2 ? 24 ? :_______________. ? 2 x1 ? 5 x 2 ? 13 ? ? x1 , x 2 ? 0, int egers ?

5.A tree is_______________. III. Computation(60’) 1.(15 分)A plant plans to manufacture two kinds of products A and
B with 3500 labors,4000 kilograms materials and 2000 kilowatt-hours

electric power. The labors,materials and electric power consumed by per kilogram A and B ,as well as the profits of per kilogram A and
B ,are given as the table below:

products
A B

labors 7 5

materials electric power profit 5 8 2 5 6 7

Then how should a production plan be made to maximize the total profits?You are required to construct a linear programming model for this problem and solve it with the simplex method. 2.(15 分)Let the following data be for a certain transportation problem: m ? 3 , n ? 4 , d ? (10,7,5,5,6,3,8)T , c ? (7,9,4,2,3,6,2,1,1,2,5,4)T . You are asked to formulate it as a mathematical model(concrete model needed) and find its initial basic feasible solution(two methods needed). 3.(10 分)Consider the following linear programming problem
第 2 页 共 4 页

?max z ? x1 ? 2 x 2 ? 3 x3 ? 4 x 4 ?s.t. x1 ? 2 x 2 ? 3 x3 ?2 ? ? 2 x1 ? x 2 ? 2 x4 ? 2 ? ? x1 , x 2 , x3 , x 4 ? 0 ?

Given an optimal solution y ? (1,2)T to the dual problem for it,you are asked to find an optimal solution to it. 4.(10 分)A warehouse stores three kinds of commodities,the unit weight(ton per article) and unit value(dollar per article) of which are provided by the following table: unit weight 2 3 4

commodities 1 2 3

unit value 100 140 180

These commodities are to be transported to a market with a total transportation capacity of 10 tons. Then how should we make a transportation plan to maximize the total values? You are requested to formulate the problem as a mathematical programming model and write out the dynamic programming recursion formula for it. 5. 10 分) ( When we use the simplex method to solve the linear programming problem
?min z ? ?4 x1 ? 5 x 2 ? x3 ? 7 x 4 ?s.t. 8 x1 ? 4 x 2 ? 6 x3 ? x 4 ? 120 ? ? x1 ? 3 x 2 ? 2 x3 ? 2 x 4 ? 30 ? ? 3x1 ? 8 x 2 ? 2 x3 ? 2 x 4 ? 150 ? ? x1 , x 2 , x3 , x 4 ? 0 ?

we get the final simplex table

第 3 页 共 4 页

xB
x1 x4 x7

x1 x2 x3 x4 x5
1 0 0 0
1 3 4 3 13 3 17 ? 3 2 3 2 3 5 3 19 ? 3

x6
1 ? 15 8 15 13 ? 15 52 ? 15

x7
0 0 1 0

b
14 8 92 -112

0 1 0 0

z

2 15 1 ? 15 4 ? 15 1 ? 15

(1)Analyze the sensitivity for the coefficient c2 in the objective function ; ( 2 ) If the objective function changes into z ? ?4x1 ? 10x2 ? x3 ? 7 x4 ,then what about the optimal solution? IV. Graphing(10’) Find the shortest paths from the vertex v1 to the rest in the following weighted digraphs:
v2
3 4 2 1 2 4

v5
2 1

v1

v3

5 1 2 4

v6 5
2

v8

v4

v7

V. Application(10 分) The hydrocarbon(烃),the mother of organic compounds,is one kind of organic compound composed by carbon and hydrogen. The combination price of hydrogen tom in any type of hydrocarbon is always 1. The alkanes(烷烃) belong to the saturated group of hydrocarbons,the combination price of carbon atom in which is 4. Moreover,there is no cycle formed by any chemical bonds. According to the information above you are asked to prove that the molecular formula of alkanes is Cn H 2n?2 .

第 4 页 共 4 页


推荐相关:

11-12-2Operations Research期末试题(应数)A

11-12-2Operations Research期末试题(应数)A 隐藏>> 山东财经大学 2011--2012 学年第 2 学期期末试题 Operations Research(05005022)试卷 (A) 题号 得分 签字...


11-12-2线性代数A期末试卷A卷答案

参考答案与评分标准考试科目 线性代数 A 拟题人工程数学组审核人 考试方式 闭 批准人 完成时限 2 小时 2012 年 6 月 2 日 一、填空题(每小题 3 分,共 ...


11-12-2-A概率试题及答案

2011-2012-2《概率论与数理统计》期末试题(A) 一...1 2 3 4 5 6 7 8 9 10 11 12 B D B D...得分数,Y 表对目标独立射击 4 发命中目标发数, ...


11-12学年第二学期期末考试A卷

11-12(2)学期概率论与数... 6页 免费 10-11学...期末考试试卷(A 卷)考试科目:轮机英语 考试时间:...100 分 姓名 共 5 页 cargo/ballast operations. ...


11-12-2离散数学A卷试题

2 学期)考试专业、年级:计科、软件 11 级三四五六七八九十 总分 2. ...下列集合中___对于数的加法和乘法同时满足封闭性。 A. A ? {0,1} C. B...


11-12-1-试卷A

暂无评价 3页 2下载券 11-12(1)期末线代试卷A 暂无评价 5页 免费1...可用资源数能满足进程 P2,当 P2 运行结束后,释放它所占有的资源,使可用资 源...


《英语语法》期末试卷(A)11-12(2)

《英语语法》期末试卷(A)11-12(2)_文学_高等教育_教育专区。这是大学外国语学院的综合语法期末测试题,题目难度不大,高中生也可以做,格式都很好,不用再调整。大...


11-12学年第2学期本科11级java试题(A卷)

11-12学年第2学期本科11级java试题(A卷)_理学_...软件学院 2011~2012 学年第学期期末考试 《Java...11-12一数电A卷试题 暂无评价 2页 免费 11-12...


《数据通信与计算机网络》试题及答案_A_11-12-2

《数据通信与计算机网络》试题及答案_A_11-12-2_院校资料_高等教育_教育专区。数据通信与计算机网络,期末考,有很大参考价值卷号:(A) 数据通信与计算机网络 考试...


《毛中特》11-12(2)期末试题B2

期末试卷 (B) 一、单项选择题 1 2 3 4 5 6 7 8 9 10 11 12 13 14...(共 15 分,每题 1 分) ⒈我国新时期最鲜明的特点是( A ) A.改革开放;...

网站首页 | 网站地图
All rights reserved Powered by 酷我资料网 koorio.com
copyright ©right 2014-2019。
文档资料库内容来自网络,如有侵犯请联系客服。zhit325@126.com