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 the concept of deadlock, Question: In a multi-user database env...

Question: In a multi-user database environment, locking mechanisms can be used to solve the three basic problems of concurrency. On the other hand, however, locking may also le

State the object design for processing, State the Object Design for Process...

State the Object Design for Processing  The object design phase comes after analysis and system design phase. The object design phase includes implementation details like as i

Define serializable schedule, Define Serializable schedule Serializable...

Define Serializable schedule Serializable schedule: An interleaved schedule of much more than one transaction is known as a serializable schedule, if it is equal to some serial

Physical model of traffic data management, After the completion of the logi...

After the completion of the logical model the physical model is to be made. The oracle 10 G will be used as a database server and all the tables with their column are created and i

Dbms, You are managing the following database system: • DBMS: Oracle 11g ...

You are managing the following database system: • DBMS: Oracle 11g • OS: Sun Solaris • System architecture: Web-based application using ASP.Net • Purpose of Server: HR managem

What is view in sql, What is view in SQL? How is it defined? Any relati...

What is view in SQL? How is it defined? Any relation that is not part of the logical model, but is made visible to a user as a virtual relation is known as a view. We descri

What is hashing file organization, What is hashing file organization? ...

What is hashing file organization? In the hashing file organization, a hash function is computed on some attribute of every record. The result of the hash function specify in

Find a 3nf decomposition , Find a 3NF decomposition of the following relati...

Find a 3NF decomposition of the following relation scheme: University (Faculty, Dean, Department, Chair, Professor, Rank, Student}. The University relation satisfies the following

Read-set(t) and timestamps-optimistic concurrency contents, read-set(T) : E...

read-set(T) : Each data items that are read by a transaction T Timestamps : for all transaction T, the start-time and the end time are reserved for all the three phases.

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