运筹作业.11doc1.doc_第1页
运筹作业.11doc1.doc_第2页
运筹作业.11doc1.doc_第3页
运筹作业.11doc1.doc_第4页
运筹作业.11doc1.doc_第5页
已阅读5页,还剩3页未读 继续免费阅读

下载本文档

版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领

文档简介

Logistics operation2.1-1 (P. 15)Farmer Jones must determine how many acres of corn and wheat to plant this year. An acre of wheat yields 25 bushels of wheat and requires 10 hours of labor per week. An acre of corn yields 10 bushels of corn and requires 4 hours of labor per week. All wheat can be sold at $4 a bushel, and all corn can be sold at $3 a bushel. Seven acres of land and 40 hours per week of labor are available. Government regulations require that at least 30 bushels of corn be produced during the current year. Let x1=number of acres of corn plated, x2=number of acres of wheat planted. Using these decision variables, formulate an LP whose solution will tell Farmer Jones how to maximize the total revenue from wheat and corn.Solution O.f. mix=30X1+100X2 S.T. X1+X2=7 4X1+100X2=30 X1 、X2=0 By constraints and objective function, by use of excel find out optimal value, if the maximal profit and qualified: when clamps its X1 = 3 X2 = 2.8 yields Z biggest, is 370.2.2-2 (P. 23)Leary Chemical manufactures three chemicals: A, B, and C. These chemicals are produced via 2 production processes: 1 and 2. Running process for 1 h costs $4, and yield 3 units of A, 1 of B, and 1 of C. Running process 2 for 1 hour costs $1 and produces 1 unit of A and 1 of B. To meet customer demands, at least 10 units of A, 5 of B, and 3 of C must be produced daily. Graphically determine a daily production plan that minimizes the cost of meeting Leary Chemicals daily demands.Solution:X1=hours of precess 1 X2=hours of precess 2O.F. Min Z=4X1+X2S.T. 3X1+X2=10 X1+X2=5 X1=3 X20Make clamps its x1 x2 seperately process 1, 2 production process of the amount of time. By TiYi know there is nothing beats A, five of tenve of B, and 3 of C daily. Wish all demoting listed constraint conditions, by use of excel ask out clamps its X1, X2 respectively 3, 2, the least expensive, is 14.Problem 2.4-1There are 3 factories on the Momiss River. Each emits 2 types of pollutants into the river. If the waste from each factory is processed, the pollution in the river can be reduced. It costs ($15, $10, $20) to process a ton of (factory 1, factory 2, factory 3) waste , and each ton processed reduces the amount of pollutant 1 and 2 by(0.10, 0.45),(0.20,0.25),(0.40,0.30) ton. The sate wants to reduce pollutants at least (30,40) tons. Formulate an LP that will minimize the total cost.Solution: x1=reduced pollution of the factory 1 x2=reduced pollution of the factory 2 x3=reduced pollution of the factory 3O.F. Min z=15x1+10x2+20x3S.T. 0.1x1+0.20x2+0.40x3=30 0.45x1+0.25x2+0.30x3=30 x1 x2 x30To make the minimum, according to the regulation pollutants cost constraint, finally proper clamps its x1 =7.692308472, x2 = 146.1538458, spend a minimum, for 1576.923085.2.5-4 (P 35) *Suppose the post office has 25 full-time employees and was not allowed to hire or fire any employees. Formulate an LP that could be used to schedule the employees in order to maximize the number of weekend days off received by the employees.Employees RequiredDay 1=Monday17Day 2=Tuesday13Day 3=Wednesday15Day 4=Thursday19Day 5=Friday14Day 6= Saturday16Day 7= Sunday11 Solution:Defining xi to the number of employees working on day i.O.F. max z=x5+2x6+x7 S.T. x1+x2+x3+x4+x5+x6+x7=25x1+x4+x5+x6+x7=15x1+x2+x5+x6+x7=19x1+x2+x3+x6+x7=14x1+x2+x3+x4+x7=16x1+x2+x3+x4+x5=11x2+x3+x4+x5+x6=17x3+x4+x5+x6+x7=13To make the number of weekend days off received by the employees is the biggest, so only two forms, Friday, Saturday rest and on Saturday and Sunday rest, the objective function is Max z = x5 + 2x6 + x7, according to the topic request list constraint, finally come to a maximum of z is 23. 2.6 2 (P. 39) *Two investments with varying cash flows ( in thousands of dollars) are available, as shown in Table 7. At time 0, $10,000 is available for investment, and at time 1, $7,000 is available. Assuming that r = 0.10, set up and LP whose solution maximizes the NPV obtained from these investments. Graphically find the optimal solution to the LP. (Assume that any fraction of an investment may be purchased.)Cash flow (in thousands)Time 0123Investment 1-6-579Investment 2-8-397Solution:x1=fraction oftheinvestment1purchased,x2=fraction oftheinvestment2 purchased, O.F. Z=12.547x1+12.697x2 S.T. 6x1+8x2=10 5x1+3x20 Z is with net present value formula calculate out of,0 period shall not exceed 10 thousand, pxix can not be more than seven thousand, but do not need to be a net present value2.8 1 *You have decided to enter the candy business. You are considering producing two types of candies: Slugger Candy and Easy Out Candy, both of which consist solely of sugar, nuts, and chocolate. At present, you have in stock 100 oz of sugar, 20 oz of nuts, and 30 oz of chocolate. The mixture used to make Easy Out Candy must contain at least 20% nuts. The mixture used to make Slugger Candy must contain at least 10% nuts and 10% chocolate. Each ounce of Easy Out Candy can be sold for 25 cents, and each ounce of Slugger Candy for 20 cents. Formulate an LP that will enable you to maximize your revenue from candy sales.Solution: x1= the acount of suger in Easy Out Candy x2=the acount of suger in Slugger Candy y1=the acount of nut in Easy Out Candy y2=the acount of nut in Slugger Candy z1=the acount of chocolate in Easy Out Candy z2=the acount of chocolate in Slugger Candyw=20(x1+y1+z1)+25(x2+y2+z2)x1+x2=100y1+y2=20z1+z2=0.2(x1+y1+z1)y2=0.1(x2+y2+z2)x1 x2 y1 y2 z1 z20 By report knowable clamps its x1 = 0, x2 y1 = = 100, 1.91897E-08, y2 = 19.99999998, z1 = = 29.99999992 when 7.67588E-08, z2, can make the maximal profit and for 3750 centProblem 2.10-1 A customer requires during the next four months, respectively, 50,65,100, and 70 units of a commodity ( no backloggin

温馨提示

  • 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
  • 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
  • 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
  • 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
  • 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
  • 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
  • 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。

评论

0/150

提交评论