合肥工业大学mba数据模型与决策课后作业参考答案完整版
数据模型与决策习题与参考答案
数据模型与决策习题与参考答案《数据模型与决策》复习题及参考答案第⼀章绪⾔⼀、填空题1．运筹学的主要研究对象是各种有组织系统的管理问题，经营活动。
2．运筹学的核⼼是运⽤数学⽅法研究各种系统的优化途径及⽅案，为决策者提供科学决策的依据。
3．模型是⼀件实际事物或现实情况的代表或抽象。
4、通常对问题中变量值的限制称为约束条件，它可以表⽰成⼀个等式或不等式的集合。
5．运筹学研究和解决问题的基础是最优化技术，并强调系统整体优化功能。
运筹学研究和解决问题的效果具有连续性。
6．运筹学⽤系统的观点研究功能之间的关系。
7．运筹学研究和解决问题的优势是应⽤各学科交叉的⽅法，具有典型综合应⽤特性。
8．运筹学的发展趋势是进⼀步依赖于_计算机的应⽤和发展。
9．运筹学解决问题时⾸先要观察待决策问题所处的环境。
10．⽤运筹学分析与解决问题，是⼀个科学决策的过程。
11.运筹学的主要⽬的在于求得⼀个合理运⽤⼈⼒、物⼒和财⼒的最佳⽅案。
12．运筹学中所使⽤的模型是数学模型。
⽤运筹学解决问题的核⼼是建⽴数学模型，并对模型求解。
13⽤运筹学解决问题时，要分析，定议待决策的问题。
14．运筹学的系统特征之⼀是⽤系统的观点研究功能关系。
15.数学模型中，“s·t”表⽰约束。
16．建⽴数学模型时，需要回答的问题有性能的客观量度，可控制因素，不可控因素。
17．运筹学的主要研究对象是各种有组织系统的管理问题及经营活动。
⼆、单选题1.建⽴数学模型时，考虑可以由决策者控制的因素是（ A ）A．销售数量 B．销售价格 C．顾客的需求 D．竞争价格2．我们可以通过（ C ）来验证模型最优解。
A．观察 B．应⽤ C．实验 D．调查3．建⽴运筹学模型的过程不包括（ A ）阶段。
A．观察环境 B．数据分析 C．模型设计 D．模型实施4.建⽴模型的⼀个基本理由是去揭晓那些重要的或有关的（ B ）A数量 B变量 C 约束条件 D ⽬标函数5.模型中要求变量取值（ D ）A可正 B可负 C⾮正 D⾮负6.运筹学研究和解决问题的效果具有（ A ）A 连续性B 整体性C 阶段性D 再⽣性7.运筹学运⽤数学⽅法分析与解决问题，以达到系统的最优⽬标。
MBA《数据、模拟与决策》案例报告
《数据、模型与决策》案例一《火花塞铁壳的质量抽样检验》第２小组案例分析报告组员：陈迪学号：17920091150628组员：高霄霞学号：17920091150668组员：陆彬彬学号：17920091150764组员：罗志锐学号：17920091150767组员：王晋军学号：17920091150811组员：许冰学号：17920091150856案例《火花塞铁壳的质量抽样检验》第２小组案例分析报告摘要：产品质量检验是生产过程中的一个重要阶段，实际生产中，检查每批产品中的不合格品的件数，一般用计件抽样检验方案。
计件抽样检验的方法包括：百分比抽样检验方案和标准型一次抽样方案等，本文通过火花塞铁壳的质量抽样检验，对以上两种抽样检验方案的合理性进行了理论分析。
关键字：抽样检验百分比抽样法标准型一次性抽样法 OC曲线Abstract：Quality inspection is a very important step in production process. In actual process, we use sample inspection methods by counting to inspect every batch for the reject products. Sample inspection plans include percentage sampling inspection and standard sampling inspection. This thesis takes ‘the spark plug case’ as an example to analyze the rationality of the two Sample inspection plans.Key words: Sample inspection plans, percentage sampling inspection, standard sampling inspection, OC curve一问题的提出企业生产出的产品是否符合规定要求，要通过检验来判定。
数据模型与决策习题与参考
《数据模型与决议》复习题及参照答案第一章绪言一、填空题1．运筹学的主要研究对象是各样有组织系统的管理问题，经营活动。
2．运筹学的核心是运用数学方法研究各样系统的优化门路及方案，为决议者提供科学决议的依照。
3．模型是一件实质事物或现真相况的代表或抽象。
4、往常对问题中变量值的限制称为拘束条件，它能够表示成一个等式或不等式的会合。
5．运筹学研究和解决问题的基础是最优化技术，并重申系统整体优化功能。
运筹学研究和解决问题的成效拥有连续性。
6．运筹学用系统的看法研究功能之间的关系。
7．运筹学研究和解决问题的优势是应用各学科交错的方法，拥有典型综合应用特征。
8．运筹学的发展趋向是进一步依靠于_计算机的应用和发展。
9．运筹学解决问题时第一要察看待决议问题所处的环境。
10．用运筹学剖析与解决问题，是一个科学决议的过程。
11.运筹学的主要目的在于求得一个合理运用人力、物力和财力的最正确方案。
12．运筹学中所使用的模型是数学模型。
用运筹学解决问题的核心是成立数学模型，并对模型求解。
13用运筹学解决问题时，要剖析，定议待决议的问题。
14．运筹学的系统特色之一是用系统的看法研究功能关系。
15.数学模型中，“s· t ”表示拘束。
16．成立数学模型时，需要回答的问题有性能的客观量度，可控制因素，不行控因素。
17．运筹学的主要研究对象是各样有组织系统的管理问题及经营活动。
二、单项选择题1. 成立数学模型时，考虑能够由决议者控制的因素是（ A ）A．销售数目B．销售价钱C．顾客的需求D．竞争价钱2．我们能够经过（C）来考证模型最优解。
A．察看B．应用C．实验D．检查3．成立运筹学模型的过程不包含（ A ）阶段。
A．察看环境B．数据剖析C．模型设计4. 成立模型的一个基本原由是去揭晓那些重要的或相关的（D．模型实行B）A 数目B变量C拘束条件D目标函数5.模型中要求变量取值（ D ）A可正B可负C非正D非负6. 运筹学研究和解决问题的成效拥有（A）A连续性B整体性C阶段性D重生性7.运筹学运用数学方法剖析与解决问题，以达到系统的最优目标。
数据-模型与决策练习题含答案
1、某企业目前的损益状况如在下：销售收入（1000件×10元/件） 10 000销售成本：变动成本（1000件×6元/件） 6 000固定成本 2 000销售和管理费（全部固定） 1 000利润 1 000（1）假设企业按国家规定普调工资，使单位变动成本增加4％，固定成本增加1％，结果将会导致利润下降。
为了抵销这种影响企业有两个应对措施：一是提高价格5％，而提价会使销量减少10％；二是增加产量20％，为使这些产品能销售出去，要追加500元广告费。
请做出选择，哪一个方案更有利？（2）假设企业欲使利润增加50％，即达到1 500元，可以从哪几个方面着手，采取相应的措施。
2、某企业每月固定制造成本1 000元，固定销售费100元，固定管理费150元；单位变动制造成本6元，单位变动销售费0.70元，单位变动管理费0.30元；该企业生产一种产品，单价10元，所得税税率50％；本月计划产销600件产品，问预期利润是多少?如拟实现净利500元，应产销多少件产品?3、某企业生产甲、乙、丙三种产品，固定成本500000元，有关资料见下表（单位：元）：要求：（1）计算各产品的边际贡献；（2）计算加权平均边际贡献率；（3）根据加权平均边际贡献率计算预期税前利润。
4、某企业每年耗用某种材料3 600千克，单位存储成本为2元，一次订货成本25元。
则经济订货批量、每年最佳订货次数、最佳订货周期、与批量有关的存货总成本是多少？5．有10个同类企业的生产性固定资产年平均价值和工业总产值资料如下：（1）说明两变量之间的相关方向；（2）建立直线回归方程；（3）估计生产性固定资产（自变量）为1100万元时总产值（因变量）的可能值。
6、某商店的成本费用本期发生额如表所示，采用账户分析法进行成本估计。
首先，对每个项目进行研究，根据固定成本和变动成本的定义及特点结合企业具体情况来判断，确定它们属于哪一类成本。
例如，商品成本和利息与商店业务量关系密切，基本上属于变动成本；福利费、租金、保险、修理费、水电费、折旧等基本上与业务量无关，视为固定成本。
数据模型与决策(运筹学)课后习题和案例答案(6)
CHAPTER 7NETWORK OPTIMIZATION PROBLEMS Review Questions7.1-1 A supply node is a node where the net amount of flow generated is a fixed positive number.A demand node is a node where the net amount of flow generated is a fixed negativenumber. A transshipment node is a node where the net amount of flow generated is fixed at zero.7.1-2 The maximum amount of flow allowed through an arc is referred to as the capacity of thatarc.7.1-3 The objective is to minimize the total cost of sending the available supply through thenetwork to satisfy the given demand.7.1-4 The feasible solutions property is necessary. It states that a minimum cost flow problemwill have a feasible solution if and only if the sum of the supplies from its supply nodesequals the sum of the demands at its demand nodes.7.1-5 As long as all its supplies and demands have integer values, any minimum cost flowproblem with feasible solutions is guaranteed to have an optimal solution with integervalues for all its flow quantities.7.1-6 Network simplex method.7.1-7 Applications of minimum cost flow problems include operation of a distribution network,solid waste management, operation of a supply network, coordinating product mixes atplants, and cash flow management.7.1-8 Transportation problems, assignment problems, transshipment problems, maximum flowproblems, and shortest path problems are special types of minimum cost flow problems. 7.2-1 One of the company’s most important distribution centers (Los Angeles) urgently needs anincreased flow of shipments from the company.7.2-2 Auto replacement parts are flowing through the network from the company’s main factoryin Europe to its distribution center in LA.7.2-3 The objective is to maximize the flow of replacement parts from the factory to the LAdistribution center.7.3-1 Rather than minimizing the cost of the flow, the objective is to find a flow plan thatmaximizes the amount flowing through the network from the source to the sink.7.3-2 The source is the node at which all flow through the network originates. The sink is thenode at which all flow through the network terminates. At the source, all arcs point awayfrom the node. At the sink, all arcs point into the node.7.3-3 The amount is measured by either the amount leaving the source or the amount entering thesink.7.3-4 1. Whereas supply nodes have fixed supplies and demand nodes have fixed demands, thesource and sink do not.2. Whereas the number of supply nodes and the number of demand nodes in a minimumcost flow problem may be more than one, there can be only one source and only onesink in a standard maximum flow problem.7.3-5 Applications of maximum flow problems include maximizing the flow through adistribution network, maximizing the flow through a supply network, maximizing the flow of oil through a system of pipelines, maximizing the flow of water through a system ofaqueducts, and maximizing the flow of vehicles through a transportation network.7.4-1 The origin is the fire station and the destination is the farm community.7.4-2 Flow can go in either direction between the nodes connected by links as opposed to onlyone direction with an arc.7.4-3 The origin now is the one supply node, with a supply of one. The destination now is theone demand node, with a demand of one.7.4-4 The length of a link can measure distance, cost, or time.7.4-5 Sarah wants to minimize her total cost of purchasing, operating, and maintaining the carsover her four years of college.7.4-6 When “real travel” through a network can end at more that one node, a dummy destinationneeds to be added so that the network will have just a single destination.7.4-7 Quick’s management must consider trade-offs between time and cost in making its finaldecision.7.5-1 The nodes are given, but the links need to be designed.7.5-2 A state-of-the-art fiber-optic network is being designed.7.5-3 A tree is a network that does not have any paths that begin and end at the same nodewithout backtracking. A spanning tree is a tree that provides a path between every pair of nodes. A minimum spanning tree is the spanning tree that minimizes total cost.7.5-4 The number of links in a spanning tree always is one less than the number of nodes.Furthermore, each node is directly connected by a single link to at least one other node. 7.5-5 To design a network so that there is a path between every pair of nodes at the minimumpossible cost.7.5-6 No, it is not a special type of a minimum cost flow problem.7.5-7 A greedy algorithm will solve a minimum spanning tree problem.17.5-8 Applications of minimum spanning tree problems include design of telecommunicationnetworks, design of a lightly used transportation network, design of a network of high- voltage power lines, design of a network of wiring on electrical equipment, and design of a network of pipelines.Problems7.1a)b)c)1[40] 6 S17 4[-30] D1 [-40] D2 [60] 5 8S2 6[-30] D37.2a)supply nodestransshipment nodesdemand nodesb)[200] P1560 [150]425 [125][0] W1505[150]490 [100]470 [100][-150]RO1[-200]RO2P2 [300]c)510 [175]600 [200][0] W2390 [125]410[150] 440[75]RO3[-150]7.3a)supply nodestransshipment nodesdemand nodesV1W1F1V2V3W2 F21P1W1RO1RO2P2W2RO3[-50] SE3000[20][0]BN5700[40][0]HA[50]BE 4000 6300[40][30] [0][0]NY2000[60]2400[20]3400[10] 4200[80][0]5900[60]5400[40]6800[50]RO[0]BO[0]2500[70]2900[50]b)c)7.4a)LA 3100 NO 6100 LI 3200 ST[-130] [70] [30] [40] [130]1[70]11b)c) The total shipping cost is $2,187,000.7.5a)[0][0] 5900RONY[60] 5400[0] 2900 [50]4200 [80][0] [40] 6800 [50]BO[0] 2500LA 3100 NO 6100 LI 3200 ST [-130][70][30] [40][130]b)c)SEBNHABERONYNY(80) [80] (50) [60](30)[40] ROBO (40)(50) [50] (70)[70]11d)e)f) $1,618,000 + $583,000 = $2,201,000 which is higher than the total in Problem 7.5 ($2,187,000). 7.6LA(70) NO[50](30)LI (30) ST[70][30] [40]There are only two arcs into LA, with a combined capacity of 150 (80 + 70). Because ofthis bottleneck, it is not possible to ship any more than 150 from ST to LA. Since 150 actually are being shipped in this solution, it must be optimal. 7.7[-50] SE3000 [20] [0] BN 5700 [40][0] HA[50] BE4000 6300[40][0] NY2000 [60] 2400 [20][30] [0]5900RO [60]17.8 a) SourcesTransshipment Nodes Sinkb)7.9 a)AKR1[75]A [60]R2[65] [40][50][60] [45]D [120] [70]B[55]E[190]T [45][80] [70][70]R3CF[130][90]SE PT KC SL ATCHTXNOMES S F F CAb)Oil Fields Refineries Distribution CentersTXNOPTCACHATAKSEKCME c)SLSFTX[11][7] NO[5][9] PT[8] [2][5] CA [4] [7] [8] [7] [4] [6][8] CH [7][5][9] [4] ATAK [3][6][6][12] SE KC[8][9][4][8] [7] [12] [11]MESL [9]SF[15][7]d)3Shortest path: Fire Station – C – E – F – Farming Community 7.11 a)A70D40 60O60 5010 B 20 C5540 10 T50E801c)Shortest route: Origin – A – B – D – Destinationd)Yese)Yes7.12a)31,00018,000 21,00001238,000 10,000 12,000b)17.13a) Times play the role of distances.B 2 2 G5ACE 1 31 1b)7.14D F1. C---D: Cost = 14.E---G: Cost = 5E---F: Cost = 1 *choose arbitrarilyD---A: Cost = 4 2.E---G: Cost = 5 E---B: Cost = 7 E---B: Cost = 7 F---G: Cost = 7 E---C: Cost = 4 C---A: Cost = 5F---G: Cost = 7C---B: Cost = 2 *lowestF---C: Cost = 3 *lowest5.E---G: Cost = 5 F---D: Cost = 4 D---A: Cost = 43. E---G: Cost = 5 B---A: Cost = 2 *lowestE---B: Cost = 7 F---G: Cost = 7 F---G: Cost = 7 C---A: Cost = 5F---D: Cost = 46.E---G: Cost = 5 *lowestC---D: Cost = 1 *lowestF---G: Cost = 7C---A: Cost = 5C---B: Cost = 2Total = $14 million7.151. B---C: Cost = 1 *lowest 4. B---E: Cost = 72. B---A: Cost = 4 C---F: Cost = 4 *lowestB---E: Cost = 7 C---E: Cost = 5C---A: Cost = 6 D---F: Cost = 5C---D: Cost = 2 *lowest 5. B---E: Cost = 7C---F: Cost = 4 C---E: Cost = 5C---E: Cost = 5 F---E: Cost = 1 *lowest3. B---A: Cost = 4 *lowest F---G: Cost = 8B---E: Cost = 7 6. E---G: Cost = 6 *lowestC---A: Cost = 6 F---G: Cost = 8C---F: Cost = 4C---E: Cost = 5D---A: Cost = 5 Total = $18,000D---F: Cost = 57.16B 34 2E HA D 2 G I K3C F 12J34B41E6A C41G2 FD1. F---G: Cost = 1 *lowest 6. D---A: Cost = 62. F---C: Cost = 6 D---B: Cost = 5F---D: Cost = 5 D---C: Cost = 4F---I: Cost = 2 *lowest E---B: Cost = 3 *lowestF---J: Cost = 5 F---C: Cost = 6G---D: Cost = 2 F---J: Cost = 5G---E: Cost = 2 H---K: Cost = 7G---H: Cost = 2 I---K: Cost = 8G---I: Cost = 5 I---J: Cost = 33. F---C: Cost = 6 7. B---A: Cost = 4F---D: Cost = 5 D---A: Cost = 6F---J: Cost = 5 D---C: Cost = 4G---D: Cost = 2 *lowest F---C: Cost = 6G---E: Cost = 2 F---J: Cost = 5G---H: Cost = 2 H---K: Cost = 7I---H: Cost = 2 I---K: Cost = 8I---K: Cost = 8 I---J: Cost = 3 *lowestI---J: Cost = 3 8. B---A: Cost = 4 *lowest4. D---A: Cost = 6 D---A: Cost = 6D---B: Cost = 5 D---C: Cost = 4D---E: Cost = 2 *lowest F---C: Cost = 6D---C: Cost = 4 H---K: Cost = 7F---C: Cost = 6 I---K: Cost = 8F---J: Cost = 5 J---K: Cost = 4G---E: Cost = 2 9. A---C: Cost = 3 *lowestG---H: Cost = 2 D---C: Cost = 4I---H: Cost = 2 F---C: Cost = 6I---K: Cost = 8 H---K: Cost = 7I---J: Cost = 3 I---K: Cost = 85. D---A: Cost = 6 J---K: Cost = 4D---B: Cost = 5 10. H---K: Cost = 7D---C: Cost = 4 I---K: Cost = 8E---B: Cost = 3 J---K: Cost = 4 *lowestE---H: Cost = 4F---C: Cost = 6F---J: Cost = 5G---H: Cost = 2 *lowest Total = $26 millionI---H: Cost = 2I---K: Cost = 8I---J: Cost = 37.17a) The company wants a path between each pair of nodes (groves) that minimizes cost(length of road).b)7---8 : Distance = 0.57---6 : Distance = 0.66---5 : Distance = 0.95---1 : Distance = 0.75---4 : Distance = 0.78---3 : Distance = 1.03---2 : Distance = 0.9Total = 5.3 miles7.18a) The bank wants a path between each pair of nodes (offices) that minimizes cost(distance).b) B1---B5 : Distance = 50B5---B3 : Distance = 80B1---B2 : Distance = 100B2---M : Distance = 70B2---B4 : Distance = 120Total = 420 milesHamburgBostonRotterdamSt. PetersburgNapoliMoscowA IRFIELD SLondonJacksonvilleBerlin RostovIstanbulCases7.1a) The network showing the different routes troops and supplies may follow to reach the Russian Federation appears below.PORTSb)The President is only concerned about how to most quickly move troops and suppliesfrom the United States to the three strategic Russian cities. Obviously, the best way to achieve this goal is to find the fastest connection between the US and the three cities.We therefore need to find the shortest path between the US cities and each of the three Russian cities.The President only cares about the time it takes to get the troops and supplies to Russia.It does not matter how great a distance the troops and supplies cover. Therefore we define the arc length between two nodes in the network to be the time it takes to travel between the respective cities. For example, the distance between Boston and London equals 6,200 km. The mode of transportation between the cities is a Starlifter traveling at a speed of 400 miles per hour * 1.609 km per mile = 643.6 km per hour. The time is takes to bring troops and supplies from Boston to London equals 6,200 km / 643.6 km per hour = 9.6333 hours. Using this approach we can compute the time of travel along all arcs in the network.By simple inspection and common sense it is apparent that the fastest transportation involves using only airplanes. We therefore can restrict ourselves to only those arcs in the network where the mode of transportation is air travel. We can omit the three port cities and all arcs entering and leaving these nodes.The following six spreadsheets find the shortest path between each US city (Boston and Jacksonville) and each Russian city (St. Petersburg, Moscow, and Rostov).The spreadsheets contain the following formulas:Comparing all six solutions we see that the shortest path from the US to Saint Petersburg is Boston → London → Saint Petersburg with a total travel time of 12.71 hours. The shortest path from the US to Moscow is Boston → London → Moscow with a total travel time of 13.21 hours. The shortest path from the US to Rostov is Boston →Berlin → Rostov with a total travel time of 13.95 hours. The following network diagram highlights these shortest paths.-1c)The President must satisfy each Russian city’s military requirements at minimum cost.Therefore, this problem can be solved as a minimum-cost network flow problem. The two nodes representing US cities are supply nodes with a supply of 500 each (wemeasure all weights in 1000 tons). The three nodes representing Saint Petersburg, Moscow, and Rostov are demand nodes with demands of –320, -440, and –240,respectively. All nodes representing European airfields and ports are transshipment nodes. We measure the flow along the arcs in 1000 tons. For some arcs, capacityconstraints are given. All arcs from the European ports into Saint Petersburg have zero capacity. All truck routes from the European ports into Rostov have a transportation limit of 2,500*16 = 40,000 tons. Since we measure the arc flows in 1000 tons, the corresponding arc capacities equal 40. An analogous computation yields arc capacities of 30 for both the arcs connecting the nodes London and Berlin to Rostov. For all other nodes we determine natural arc capacities based on the supplies and demands at the nodes. We define the unit costs along the arcs in the network in $1000 per 1000 tons (or, equivalently, $/ton). For example, the cost of transporting 1 ton of material from Boston to Hamburg equals $30,000 / 240 = $125, so the costs of transporting 1000 tons from Boston to Hamburg equals $125,000.The objective is to satisfy all demands in the network at minimum cost. The following spreadsheet shows the entire linear programming model.HamburgBoston Rotterdam St.Petersburg+500-320Napoli Moscow A IRF IELDSLondon -440Jacksonville Berlin Rostov+500-240Istanbul The total cost of the operation equals $412.867 million. The entire supply for SaintPetersburg is supplied from Jacksonville via London. The entire supply for Moscow is supplied from Boston via Hamburg. Of the 240 (= 240,000 tons) demanded by Rostov, 60 are shipped from Boston via Istanbul, 150 are shipped from Jacksonville viaIstanbul, and 30 are shipped from Jacksonville via London. The paths used to shipsupplies to Saint Petersburg, Moscow, and Rostov are highlighted on the followingnetwork diagram.PORTSd)Now the President wants to maximize the amount of cargo transported from the US tothe Russian cities. In other words, the President wants to maximize the flow from the two US cities to the three Russian cities. All the nodes representing the European ports and airfields are once again transshipment nodes. The flow along an arc is againmeasured in thousands of tons. The new restrictions can be transformed into arccapacities using the same approach that was used in part (c). The objective is now to maximize the combined flow into the three Russian cities.The linear programming spreadsheet model describing the maximum flow problem appears as follows.The spreadsheet shows all the amounts that are shipped between the various cities. The total supply for Saint Petersburg, Moscow, and Rostov equals 225,000 tons, 104,800 tons, and 192,400 tons, respectively. The following network diagram highlights the paths used to ship supplies between the US and the Russian Federation.PORTSHamburgBoston Rotterdam St.Petersburg+282.2 -225NapoliMoscowAIRFIELDS-104.8LondonJacksonvilleBerlin Rostov +240 -192.4Istanbule)The creation of the new communications network is a minimum spanning tree problem.As usual, a greedy algorithm solves this type of problem.Arcs are added to the network in the following order (one of several optimal solutions):Rostov - Orenburg 120Ufa - Orenburg 75Saratov - Orenburg 95Saratov - Samara 100Samara - Kazan 95Ufa – Yekaterinburg 125Perm – Yekaterinburg 857.2a) There are three supply nodes – the Yen node, the Rupiah node, and the Ringgit node.There is one demand node – the US$ node. Below, we draw the network originatingfrom only the Yen supply node to illustrate the overall design of the network. In thisnetwork, we exclude both the Rupiah and Ringgit nodes for simplicity.b)Since all transaction limits are given in the equivalent of $1000 we define the flowvariables as the amount in thousands of dollars that Jake converts from one currencyinto another one. His total holdings in Yen, Rupiah, and Ringgit are equivalent to $9.6million, $1.68 million, and $5.6 million, respectively (as calculated in cells I16:K18 inthe spreadsheet). So, the supplies at the supply nodes Yen, Rupiah, and Ringgit are -$9.6 million, -$1.68 million, and -$5.6 million, respectively. The demand at the onlydemand node US$ equals $16.88 million (the sum of the outflows from the sourcenodes). The transaction limits are capacity constraints for all arcs leaving from thenodes Yen, Rupiah, and Ringgit. The unit cost for every arc is given by the transactioncost for the currency conversion.Jake should convert the equivalent of $2 million from Yen to each US$, Can$, Euro, and Pound. He should convert $1.6 million from Yen to Peso. Moreover, he should convert the equivalent of $200,000 from Rupiah to each US$, Can$, and Peso, $1 million from Rupiah to Euro, and $80,000 from Rupiah to Pound. Furthermore, Jake should convert the equivalent of $1.1 million from Ringgit to US$, $2.5 million from Ringgit to Euro, and $1 million from Ringgit to each Pound and Peso. Finally, he should convert all the money he converted into Can$, Euro, Pound, and Peso directly into US$. Specifically, he needs to convert into US$ the equivalent of $2.2 million, $5.5 million, $3.08 million, and $2.8 million Can$, Euro, Pound, and Peso, respectively. Assuming Jake pays for the total transaction costs of $83,380 directly from his American bank accounts he will have $16,880,000 dollars to invest in the US.c)We eliminate all capacity restrictions on the arcs.Jake should convert the entire holdings in Japan from Yen into Pounds and then into US$, the entire holdings in Indonesia from Rupiah into Can$ and then into US$, and the entire holdings in Malaysia from Ringgit into Euro and then into US$. Without the capacity limits the transaction costs are reduced to $67,480.d)We multiply all unit cost for Rupiah by 6.The optimal routing for the money doesn't change, but the total transaction costs are now increased to $92,680.e)In the described crisis situation the currency exchange rates might change every minute.Jake should carefully check the exchange rates again when he performs thetransactions.The European economies might be more insulated from the Asian financial collapse than the US economy. To impress his boss Jake might want to explore other investment opportunities in safer European economies that provide higher rates of return than US bonds.。
《数据模型与决策》复习题及参考答案
《数据模型与决策》复习题及参考答案《数据模型与决策》复习题及参考答案第一章绪言一、填空题1．运筹学的主要研究对象是各种有组织系统的管理问题，经营活动。
2．运筹学的核心是运用数学方法研究各种系统的优化途径及方案，为决策者提供科学决策的依据。
3．模型是一件实际事物或现实情况的代表或抽象。
4、通常对问题中变量值的限制称为约束条件，它可以表示成一个等式或不等式的集合。
5．运筹学研究和解决问题的基础是最优化技术，并强调系统整体优化功能。
运筹学研究和解决问题的效果具有连续性。
6．运筹学用系统的观点研究功能之间的关系。
7．运筹学研究和解决问题的优势是应用各学科交叉的方法，具有典型综合应用特性。
8．运筹学的发展趋势是进一步依赖于_计算机的应用和发展。
9．运筹学解决问题时首先要观察待决策问题所处的环境。
10．用运筹学分析与解决问题，是一个科学决策的过程。
11.运筹学的主要目的在于求得一个合理运用人力、物力和财力的最佳方案。
12．运筹学中所使用的模型是数学模型。
用运筹学解决问题的核心是建立数学模型，并对模型求解。
13用运筹学解决问题时，要分析，定议待决策的问题。
14．运筹学的系统特征之一是用系统的观点研究功能关系。
15.数学模型中，“s〃t”表示约束。
16．建立数学模型时，需要回答的问题有性能的客观量度，可控制因素，不可控因素。
17．运筹学的主要研究对象是各种有组织系统的管理问题及经营活动。
二、单选题1.建立数学模型时，考虑可以决策者控制的因素是第 1 页共40页A．销售数量B．销售价格C．顾客的需求D．竞争价格 2．我们可以通过来验证模型最优解。
A．观察B．应用C．实验D．调查 3．建立运筹学模型的过程不包括阶段。
A．观察环境B．数据分析C．模型设计D．模型实施 4.建立模型的一个基本理是去揭晓那些重要的或有关的 A数量B变量 C 约束条件 D 目标函数5.模型中要求变量取值A可正B可负C非正D非负 6.运筹学研究和解决问题的效果具有A 连续性B 整体性C 阶段性D 再生性7.运筹学运用数学方法分析与解决问题，以达到系统的最优目标。
数据模型与决策期末考试试卷(合肥工业大学)
数据模型与决策期末考试试卷（合肥工业大学）----c299fdee-6eb3-11ec-b318-7cb59b590d7d合肥工业大学工商管理硕士（mba）试卷（试卷a）课程名称：数据模型和决策命题教师：杨爱峰测试类别：开卷考试类：13MBA Spring Tunes 2类考试日期：2022年7月27日试题：一、（10分）库兹公司制造产品1和产品2，两种产品需经过两个部门的制造过程。
下表是两种产品的利润贡献及消耗人工工时的数据。
下一个生产周期内，公司总共有900小时的可用人工工时分配到两个部门。
试建立一个生产计划，使其目标为目标1（第一优先级目标）：利润至少10000美元；目标2（第二优先目标）：两个部门使用的工时应尽可能相等。
注：仅建立模型，未解决产品12二、（10分）合肥艺术馆打算安装一个摄像安全系统以减少其保安费用。
合肥艺术馆共有8间展厅（房间1-房间8），展厅之间的通道为1-13（见下图）。
一家摄像安装公司建议在一些通道处安装双向摄像头，以起到监测通道两侧房间的作用。
例如，在通道4安装，可以监测房间1和房间4。
管理层不打算在艺术馆入口处安装摄像头，并且认为房间7中展览的物品很重要，房间7至少有两个摄像头覆盖。
问应该如何安装最小数目的摄像头使其能够监测到每个房间？注：只建模型，不用求解单位利润（美元）250200工时（小时）a部门611b部门1210三、（10分）安绿电子是一家电子公司，有两家生产工厂，分别记为工厂1和工厂2，从每个工厂生产出来的产品都被运到公司的中转仓库1或者中转仓库2中，再通过中转仓库将其一产品运往三个零售商处。
工厂的供给量，零售商的需求量，以及工厂和中转仓库、中转仓库和零售商之间的单位运输成本见下表。
问如何安排运输方案使得工厂到零售商的运费最省？注：只建模型，不用求解工厂运输成本工厂1工厂2中转仓库运输成本中转仓库1中转仓库2需求量四、（10分）迈宇公司正在考虑如何管理其数据处理操作系统。
MBA数据模型与决策试卷与解答
数据模型与决策试卷一、建模计算分析题（30分）下面两个题目任选一个做即可1艾伦是一个个人投资者，有70000美元可用于不同的投资。
不同投资的年回报率分别为：政府债券8.5%，存款5%，短期国库券6.5%，增长股基金13%。
所有的投资都要满1年后才对收益进行评估。
然而，每项投资都会有不同的风险，因此建议进行多元投资。
艾伦想知道每项投资各位多少可以使收益最大化。
下面的方针可以使投资具有多样性，从而降低投资者的风险：（1）对政府债券的投资比例不要超过全部投资的20%。
（2）在存款方面的投资不要超过其他3种投资的总和。
（3）在存款和短期国库券方面的投资至少要占全部投资的30%（4）为了投资安全，在存款和短期国库券方面的投资与在政府债券和增长股基金方面的投资比例至少是1.2:1。
（5）艾伦想把70000美元全部用来投资。
如果全部投资不再正好是70000美元，其他条件不变，则模型应该如何变化？2某投资咨询公司，为大量的客户管理高达1.2亿元的资金。
公司运用一个很有价值的模型，为每个客户安排投资量，分别投资在股票增长基金、收入基金和货币市场基金。
为了保证客户投资的多元化，公司对这三种投资的数额加以限制。
一般来说，投资在股票方面的资金应该占总投资的20%~40%，投资在收入基金方面的资金应该确保在20%~50%，货币市场方面的投资至少应该占30%。
此外，公司还尝试着引入了风险承受能力指数，以迎合不同投资者的需求。
如该公司的一位新客户希望投资800000元。
对其风险承受能力进行评估得出其风险指数为0.05。
公司的风险分析人员计算出，股票市场的风险指数是0.10，收入基金的风险指数是0.07，货币市场的风险指数是0.01，整个投资的风险指数是各项投资占投资的百分率与其风险指数乘积的代数和。
此外该公司预测股票基金的年收益是18%，收入基金的收益率是12.5%，货币市场基金的收益率是7.5%。
现在基于以上信息，公司应该如何安排这位客户的投资呢？建立线性规划模型，求出使总收益最大的解，并根据模型写出管理报告。