代写Business Analytics: review problems帮做Python语言程序

Business Analytics: review problems. Solutions provided at the end.

Problem 1:

A company produces two products, A and B.  Each unit of A requires 1, 3 and 2 kilograms of wood, plastic and steel respectively and each unit of B requires 3, 4 and 1 kilograms of wood, plastic and steel respectively. A maximum of 240, 360, and 180 kilograms of wood, plastic and steel available. The profit per unit of A and B is $4.00 and $6.00 respectively. The objective is to maximize total profits. Formulate this as a linear programming model.

Problem 2:

A manufacturer produces desks and chairs. Each desk uses 5 units of wood and each chair uses 3 units of wood. Total wood available for a month is 2200 units. Desk production requires 3 hours of labor and a chair needs 1.4 hours.  Total number of hours available per month: 1150. Each desk contributes 40 dollars to profit and each chair contributes $22. Marketing requires that at least 3 chairs be produced for each desk produced. The objective is to maximize total profits. Note: you can ignore the integer requirements. Formulate this as a linear programming model

Problem 3:

A resort hotel is being built in a wooded area. Four locations (“nodes”) are to be connected with paths. All locations must be connected. Building paths is costly, so the objective is to minimize the total distance of building all the paths. Formulate this as a linear program.

Table 1

Node

Node

Distance




1

2

110

1

3

150

1

4

190

2

3

215

2

4

275

3

4

310

1

Hotel

2

Tennis courts

3

Pool

4

Spa

Problem 4:

Formulate an integer linear programming problem from the information provided below:

We want to buy two types of machines (M1 and M2); use variables X1 and X2 to denote number of machines of two types.

Objective function:  Marginal daily profitability per unit of M1 and M2 is 100 dollars and 150 dollars and you want to maximize your total daily profitability.

Resource and production constraints:

· M1 costs 15000 dollars per unit and M2 costs 4000 dollars. Your budget: 140,000 dollars.

· Space available: 200 square feet. M1 needs 15 square feet per unit and M2 needs 25 square feet per unit.

· Number of machines of type M1 must be at least twice as many as type M2.

List integer and/or other constraints at the end.

Problem 5:

Table 1 shows the payoff values for 3 alternative investment options and 3 events. Which alternative would you select if you use Mini-max regret approach?

Table 1: Payoff table

Table 2: Regret table


Rates up

Rates  static

Rates down

Rates up

Rates  static

Rates down

Stocks

-4

4

12

Stocks

Bonds

-2

3

8

Bonds

Money M

3

2

1

Money M.

Problem 6:

Table 1: Payoff

Events

E1

E2

E3

A1

250

80

30

A2

150

140

130

Prob.

0.6

0.1

0.3

Table 1 below shows the payoff values with two alternatives A1 and A2. Each alternative has three chance events (E1, E2 and E3) with probabilities shown.

Draw a tree diagram, calculate expected value (EV) for each alternative and select the preferred alternative under risk-neutrality.

Problem 7:

A company has to decide whether to expand or not. The expansion cost is $2.1 million. If the economy improves substantially (20% probability) the (projected) revenues with expansion will be $6.0 million. If the economy turns worse (30% probability) the revenues will be $2.1 million.  With economy remaining roughly the same (50% probability), the revenues will be 4.2 million. Without expansion, the corresponding revenues will be $3.0 million, $1.2 million and 1.9 million.

(a) Draw a decision tree and calculate the expected value of each alternative.

(b) What decision would you recommend to a risk-neutral decision-maker? Do not forget to take into account the cost of expansion.

Problem 8 (from 2018 final exam):

The associate dean at the Karey Business School needs to allocate instructors to the courses offered in the next semester. There are three instructors, each of whom will be teaching exactly one module. The past evaluation scores of these instructors are as follows:

Prof. Ford

60

Prof. Johnson

80

Prof. Hoover

50

There are 3 modules, each of which has a different number of students, as shown below:

Module 1: Leadership (qualitative)

35 students

Module 2: Data analysis (quantitative)

45 students

Module 3: Financial modeling (quantitative)

50 students

(a) (5 points) The associate dean wants to build a model for assigning the instructors to the modules. Define the decision variables for this model.

(b) (10 points) Formulate a linear program with the objective to maximize total satisfaction (the sum of satisfaction of all students). You can assume that past evaluation scores reflect the satisfaction with each instructor, and that each instructor is capable of teaching each module.

Qualitative courses

Quantitative courses

Prof. Ford

55

75

Prof. Johnson

80

80

Prof. Hoover

70

60

(c)  (10 points) It has been noticed that the instructors received different evaluation scores in the different courses they have taught. The scores are as follows:

Specifically, the dean wants to use the evaluation scores for qualitative courses to predict student satisfaction in module 1, and the evaluation scores for quantitative courses to predict student satisfaction in modules 2 and 3. Formulate a new model using these separate evaluation scores.

Problem 9 (from 2019 final exam)

You have built a fast food business and are now considering selling it. There are several potential acquirers, and you plan to determine the sale price in a sealed bid auction. Under the rules of the auction, the price would be the highest bid.

Due to their limited information the acquirers may underestimate or overestimate what the business is worth.  You have received indication that McDonald’s valuation of your business is uniformly distributed between $100 Million and $120 Million, and that Burger King’s valuation of your business is uniformly distributed between $100 Million and $150 Million. You believe that both companies will bid their valuation during the auction.

In preparation for the auction you want to use simulation to see how much money you can make. You have generated the following random numbers from the [0,1] uniform. distribution (each of the ten numbers has been generated independently):


McDonald’s

Burger King

Trial 1

0.46

0.06

Trial 2

0.56

0.68

Trial 3

0.97

0.33

Trial 4

0.74

0.73

Trial 5

0.15

0.12

(a) (2 points) How can you use these numbers to predict the bids and the final sale price? Describe the approach.

(b) (4 points) Given the numbers in the table above, what sale price do you expect, on average?

(c) (2 points) The bidders have an instinct about the Winner’s curse and they each plan to bid only 75% of their valuation (Winner’s curse is a phenomenon where the winner generally overpays during competitive bidding). How would that change your answer to (b)?

(d) (2 points) BARM Analytica, a startup out of Washington DC, offers to identify an additional bidder whose valuation is equally likely to be 100, 120 or 140. How large a fee should you be willing to pay for this service assuming that each bidder bids their true valuation? Use simulation and the following uniform. [0,1] random numbers: 0.11, 0.65, 0.89, 0.23, 0.53 to justify your answer.


热门主题

课程名

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
站长地图