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

Many-to-many relationship, Many-to-many : Entities in A and B are related w...

Many-to-many : Entities in A and B are related with any number of entities from each other. Example: Taught_by Relationship among course and faculty. One faculty member ca

What is a built-in, What is a Built-in A notation of identity is built-...

What is a Built-in A notation of identity is built-into the data model or programming language and no user-supplied identifier is needed. This form of identity is used in objec

Deletion anomalies-data redundancy, Deletion Anomalies: Loss of important ...

Deletion Anomalies: Loss of important Information: In some cases, useful information may be lost when a tuple is deleted. For instance, if we delete the tuple corresponding to stu

State the rearranging the execution order for efficiency, Define the step -...

Define the step - Rearranging the Execution Order for Efficiency As we know that algorithm and data structure are closely related to one another, but data structure is conside

Design a database table, A database named yourusernameFMA has been set up f...

A database named yourusernameFMA has been set up for you to use for this assignment.  For the FMA you must create the required tables and run the queries using this database.  If y

Example of weak entity, Consider the entity type dependent related to emplo...

Consider the entity type dependent related to employee entity, which is used to keep track of the dependents of every employee. The attributes of dependents are: name, sex, birth d

What is an object id, What is an object ID? Each class-derived table ha...

What is an object ID? Each class-derived table has an ID for primary key, one or more object IDs form primary key for association derived tables. An object ID is equivalent dat

Explain the b+ tree, Explain the B + tree? B + tree is a type of tre...

Explain the B + tree? B + tree is a type of tree which denotes sorted data in a way that permits for efficient insertion, retrieval and removal of records, each of which is

Explain the cascadeless schedule, Explain the Cascadeless Schedule A ca...

Explain the Cascadeless Schedule A cascadeless schedule is one in which for every pair of transactions Ti and Tj like that Tj reads a data item before written by Ti, the commit

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