Data Analysis, Database Management System

Assignment Help:
A buyer for a large department store chain must place orders with an athletic shoe manufacturer six months prior to the time the shoes will be sold in the department stores. In particular, the buyer must decide on November 1 how many pairs of the manufacturer’s newest model of tennis shoes to order for sale during the coming summer season. Assume that each pair of this new brand of tennis shoes costs the department store chain $45 per pair. Furthermore, assume that each pair of these shoes can then be sold to the chain’s customers for $70 per pair. Any pairs of these shoes remaining unsold at the end of the summer season will be sold in a closeout sale next fall for $35 each. The probability distribution of consumer demand for these tennis shoes during the coming summer season has been assessed by market research specialists and is provided
Consumer Demand Probability
1 0.05
2 0.15
3 0.25
4 0.30
5 0.15
6 0.10
. Finally, assume that the department store chain must purchase these tennis shoes from the manufacturer in lots of 100 pairs. a. Create a payoff table that specifies the contribution to profit (in dollars) from the sale of the tennis shoes by this department store chain for each possible purchase decision and each outcome with respect to consumer demand. Build the payoff matrix model in each case. In displayed comment boxes or textboxes, show one or two typical formulae used to compute the payoffs. To enable the interpretation of formulae, your model needs to display row and column headings. As we have discussed, this is easy using the Snipping tool. For problem 42 only, apply the following decision criteria: maximin (pessimist’s criterion), minimax regret (doesn’t use probabilities), EMV and EOL. Write a sentence stating the optimal solution for each of the 4 criteria. The statement should contain the recommended strategy and the value of the payoff. Hint for 42: The optimal EMV solution is to order 700 pairs.

Related Discussions:- Data Analysis

Explain controlled redundancy, Explain controlled redundancy? Controll...

Explain controlled redundancy? Controlled redundancy : The replication of data within the data warehouse for the purposes of improved data access or understand ability.

DW Job Scheduling, Define a job scheduling strategy that will meet business...

Define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a pictori

Describe the composite key, Describe the Composite Key Composite Key: ...

Describe the Composite Key Composite Key: Sometimes one key is not enough to uniquely recognize a row. E.g. in a single class Roll is enough to search a student, but in the w

What are the key features of oracle, What are the key features of Oracle? ...

What are the key features of Oracle? Key features of Oracle are as follows: • Read Consistency • Concurrency • Locking Mechanisms • Quiesce Database • RAC • Portability

Distributed Database query processing , I am doing research in this area, e...

I am doing research in this area, especially in sime join and join efficacy when several relations have been queried. Relations located in different sites. I need something like n

Give the reasons for allowing concurrency, Give the reasons for allowing co...

Give the reasons for allowing concurrency? The reasons for allowing concurrency is if the transactions run serially, a short transaction might have to wait for a preceding long

Explain the management of data store, Explain the Management of Data Store ...

Explain the Management of Data Store Every system irrespective of its nature of application requires storing permanent data for consequent use in problem solving. Some objects

Backward recovery (undo), Backward Recovery (UNDO): In this system the unco...

Backward Recovery (UNDO): In this system the uncommitted changes made by a transaction to a database are undone.  Instead the system is reset to the last consistent state of databa

Define the division operation of relational algebra, Define the Division Op...

Define the Division Operation of Relational Algebra Let R be a relation comprising attributes (A1,...Ap,Ap+1,...An) and S comprising attributes (Ap+1,...An)  DEF: Division

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd