代做Operations Management (33:136:386:22-26) Spring 2025 Homework 1代写C/C++语言

Operations Management (33:136:386:22-26) Spring 2025

Homework 1 – Due February 12th, Wednesday 11:50pm

Instructions: All questions are from the textbook. Please submit over the Canvas website as a pdf or a word document. Other formats such as .jpg, .dvi, .eps will not be accepted as it makes the grading difficult, and sometimes impossible in the blackboard grading system. You could also write your homework in hardcopy and scan it. There are some free smart phone applications that would allow you scan your homework if needed. Please do not forget to define decision and the slack variables properly. Explain your work in detail to get full credit. For fairness reasons, late homeworks will be subject to a penalty of 5 points per hour of delay. Please make sure that the format of the homework is correct, because if the submitted files cannot be opened by a pdf viewer, we will not be able to accept resubmissions.

1. (50 points) Universal Claims Processors processes insurance claims for large national insurance companies. Most claim processing is done by a large pool of computer operators, some of whom are permanent and some of whom are temporary. A permanent operator can process 16 claims per day, whereas a temporary operator can process 12 per day, and on average the company processes at least 450 claims each day. The company has 40 computer workstations. A permanent operator generates about 0.5 claim with errors each day, whereas a temporary operator averages about 1.4 defective claims per day. The company wants to limit claims with  errors to 25 per day. A permanent operator is paid $64 per day, and a temporary operator is paid $42 per day. The company wants to determine the number of permanent and temporary operators to hire in order to minimize costs.

a. Formulate a linear programming model for this problem.

b. Solve this model by using graphical analysis.

2. (50 points) A canning company produces two sizes of cans—regular and large. The cans are   produced in 10,000-can lots. The cans are processed through a stamping operation and a coating operation. The company has 30 days available for both stamping and coating. A lot of regular- size cans requires 2 days to stamp and 4 days to coat, whereas a lot of large cans requires 4 days to stamp and 2 days to coat. A lot of regular-size cans earns $800 profit, and a lot of large-size cans earns $900 profit. In order to fulfill its obligations under a shipping contract, the company must produce at least nine lots. The company wants to determine the number of lots to produce   of each size can ( and ) in order to maximize profit.

a. Formulate a linear programming model for this problem.

b. Solve this model by using graphical analysis.

3. (Bonus: 20 points) The Valley Wine Company produces two kinds of wine—Valley Nectar  and Valley Red. The wines are produced from 64 tons of grapes the company has acquired this season. A 1,000-gallon batch of Nectar requires 4 tons of grapes, and a batch of Red requires 8 tons. However, production is limited by the availability of only 50 cubic yards of storage space for aging and 120 hours of processing time. A batch of each type of wine requires 5 cubic yards of storage space. The processing time for a batch of Nectar is 15 hours, and the processing time for a batch of Red is 8 hours. Demand for each type of wine is limited to seven batches. The profit for a batch of Nectar is $9,000, and the profit for a batch of Red is $12,000. The company wants to determine the number of 1,000-gallon batches of Nectar and Red to produce in order to maximize profit.

a. Formulate a linear programming model for this problem.

b. Solve this model by using graphical analysis.

c. How much processing time will be left unused at the optimal solution?

d. What would be the effect on the optimal solution of increasing the available storage space from 50 to 60 cubic yards?

4. (Bonus: 20 points). Excel problem “Julia’s Food Booth” from the book on page 113.




热门主题

课程名

mktg2509 csci 2600 38170 lng302 csse3010 phas3226 77938 arch1162 engn4536/engn6536 acx5903 comp151101 phl245 cse12 comp9312 stat3016/6016 phas0038 comp2140 6qqmb312 xjco3011 rest0005 ematm0051 5qqmn219 lubs5062m eee8155 cege0100 eap033 artd1109 mat246 etc3430 ecmm462 mis102 inft6800 ddes9903 comp6521 comp9517 comp3331/9331 comp4337 comp6008 comp9414 bu.231.790.81 man00150m csb352h math1041 eengm4100 isys1002 08 6057cem mktg3504 mthm036 mtrx1701 mth3241 eeee3086 cmp-7038b cmp-7000a ints4010 econ2151 infs5710 fins5516 fin3309 fins5510 gsoe9340 math2007 math2036 soee5010 mark3088 infs3605 elec9714 comp2271 ma214 comp2211 infs3604 600426 sit254 acct3091 bbt405 msin0116 com107/com113 mark5826 sit120 comp9021 eco2101 eeen40700 cs253 ece3114 ecmm447 chns3000 math377 itd102 comp9444 comp(2041|9044) econ0060 econ7230 mgt001371 ecs-323 cs6250 mgdi60012 mdia2012 comm221001 comm5000 ma1008 engl642 econ241 com333 math367 mis201 nbs-7041x meek16104 econ2003 comm1190 mbas902 comp-1027 dpst1091 comp7315 eppd1033 m06 ee3025 msci231 bb113/bbs1063 fc709 comp3425 comp9417 econ42915 cb9101 math1102e chme0017 fc307 mkt60104 5522usst litr1-uc6201.200 ee1102 cosc2803 math39512 omp9727 int2067/int5051 bsb151 mgt253 fc021 babs2202 mis2002s phya21 18-213 cege0012 mdia1002 math38032 mech5125 07 cisc102 mgx3110 cs240 11175 fin3020s eco3420 ictten622 comp9727 cpt111 de114102d mgm320h5s bafi1019 math21112 efim20036 mn-3503 fins5568 110.807 bcpm000028 info6030 bma0092 bcpm0054 math20212 ce335 cs365 cenv6141 ftec5580 math2010 ec3450 comm1170 ecmt1010 csci-ua.0480-003 econ12-200 ib3960 ectb60h3f cs247—assignment tk3163 ics3u ib3j80 comp20008 comp9334 eppd1063 acct2343 cct109 isys1055/3412 math350-real math2014 eec180 stat141b econ2101 msinm014/msing014/msing014b fit2004 comp643 bu1002 cm2030
联系我们
EMail: 99515681@qq.com
QQ: 99515681
留学生作业帮-留学生的知心伴侣!
工作时间:08:00-21:00
python代写
微信客服:codinghelp
站长地图