Find an ethical issue which occurred within the last year or find an ethical issue faced by a fictional character.

TITLE – type the name of the person or article title and the philosophy you are applying.

Example – President Bush – Kant

If you use an article be sure your article was published within the last year.

• SUMMARIZE – In paragraph one give a summary of the article/person/character, in case I am not familiar with them.

• ETHICAL ISSUE – State the ethical issue that person faced – Use proper format – Make it bold print and a SHOULD QUESTION.

• APPLICATION – Using the steps outlined in your text, apply each step of Kantian Ethics to the situation. Fully show your application.  
  
•     CONCLUSION (last step in the application) – Choose the best option. If that person were a true Kantian  – what would that person have done. What would the Kantian theory say is the morally right or best thing to do?

• See the sample format below

SAMPLE FORMAT – Apply Kantian Ethics 

• What should X do about ________________?

  1.     List possible options.  

  Options

  1.    X could ____________________________________.

  2.    X could ____________________________________.

  3.    X could ____________________________________.

  4.    X could ____________________________________.

   

  Apply Categorical Imperative/Universality

  1.    X could ____________________________________.  Would I want all people, consistently, universally to _____________________?  Yes

   

  Apply universality to all of the options. 

  Apply Respect (to remaining options) Is X exploiting someone (using someone for her own benefit)

  1.    X could ____________________________________.  Is X exploiting anyone (using someone as a means to an end for her own gain)?  No (so this is a good option)

   

  Apply respect to all of the options. 

  Conclusion – If X were a Kantian she could use options 1, 3 or 4 (or some combination of all three if necessary).

  
  

1. Which of the following could be a linear programming objective function?

2. Which of the following could not be a linear programming problem constraint?

3. Types of integer programming models are _____________

4. The production manager for Beer etc. produces 2 kinds of beer: light (L) and dark (D). Two resources used to produce beer are malt and wheat. He can obtain at most 4800 oz of malt per week and at most 3200 oz of wheat per week respectively. Each bottle of light beer requires 12 oz of malt and 4 oz of wheat, while a bottle of dark beer uses 8 oz of malt and 8 oz of wheat.

Profits for light beer are $2 per bottle, and profits for dark beer are $1 per bottle. If the production manager decides to produce of 0 bottles of light beer and 400 bottles of dark beer, it will result in slack of

5. The reduced cost (shadow price) for a positive decision variable is 0

TRUE/FALSE

6. Decision variables

 7. A plant manager is attempting to determine the production schedule of various products to maximize profit. Assume that a machine hour constraint is binding. If the original amount of machine hours available is 200 minutes., and the range of feasibility is from 130 minutes to 340 minutes, providing two additional machine hours will result in the

8. Decision models are mathematical symbols representing levels of activity.

TRUE/FALSE

9. The integer programming model for a transportation problem has constraints for supply at each source and demand at each destination.

TRUE/FALSE

10. In a transportation problem, items are allocated from sources to destinations

11. In a media selection problem, the estimated number of customers reached by a given media would generally be specified in the _________________. Even if these media exposure estimates are correct, using media exposure as a surrogate does not lead to maximization of ___.

12. ____________ solutions are ones that satisfy all the constraints simultaneously.

13. In a linear programming problem, a valid objective function can be represented as

14. The standard form for the computer solution of a linear programming problem requires all variables to the right and all numerical values to the left of the inequality or equality sign

TRUE/FALSE

15. Constraints representing fractional relationships such as the production quantity of product 1 must be at least twice as much as the production quantity of products 2, 3 and 4 combined cannot be input into computer software packages because the left side of the inequality does not consist of consists of pure numbers.

TRUE/FALSE

16. In a balanced transportation model where supply equals demand

17. The objective function is a linear relationship reflecting the objective of an operation.

TRUE/FALSE

18. The owner of Chips etc. produces 2 kinds of chips: Lime (L) and Vinegar (V). He has a limited amount of the 3 ingredients used to produce these chips available for his next production run: 4800 ounces of salt, 9600 ounces of flour, and 2000 ounces of herbs. A bag of Lime chips requires 2 ounces of salt, 6 ounces of flour, and 1 ounce of herbs to produce; while a bag of Vinegar chips requires 3 ounces of salt, 8 ounces of flour, and 2 ounces of herbs. Profits for a bag of Lime chips are $0.40, and for a bag of Vinegar chips $0.50. Which of the following is not a feasible production combination?

19. The linear programming model for a transportation problem has constraints for supply at each source and demand at each destination.

TRUE/FALSE

 20. For a maximization problem, assume that a constraint is binding. If the original amount of a resource is 4 lbs., and the range of feasibility (sensitivity range) for this constraint is from

 3 lbs. to 6 lbs., increasing the amount of this resource by 1 lb. will result in the

21. In a total integer model, all decision variables have integer solution values.

TRUE/FALSE

23. Linear programming is a model consisting of linear relationships representing a firm’s decisions given an objective and resource constraints.

TRUE/FALSE

24. When using linear programming model to solve the “diet” problem, the objective is generally to maximize profit.

TRUE/FALSE

25. In a balanced transportation model where supply equals demand, all constraints are equalities.

TRUE/FALSE

26. In a transportation problem, items are allocated from sources to destinations at a minimum cost.

TRUE/FALSE

27. Mallory Furniture buys 2 products for resale: big shelves (B) and medium shelves (M). Each big shelf costs $500 and requires 100 cubic feet of storage space, and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75000 to invest in shelves this week, and the warehouse has 18000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150.  Which of the following is not a feasible purchase combination?

28. In a mixed integer model, some solution values for decision variables are integer and others can be non-integer.

TRUE/FALSE

29. In a 0 – 1 integer model, the solution values of the decision variables are 0 or 1.

TRUE/FALSE

30. Determining the production quantities of different products manufactured by a company based on resource constraints is a product mix linear programming problem.

TRUE/FALSE

31. When the right-hand sides of 2 constraints are both increased by 1 unit, the value of the objective function will be adjusted by the sum of the constraints’ prices.

TRUE/FALSE

32. The transportation method assumes that

33. A constraint is a linear relationship representing a restriction on decision making.

TRUE/FALSE

34. When formulating a linear programming model on a spreadsheet, the measure of performance is located in the target cell.

TRUE/FALSE

35. The linear programming model for a transportation problem has constraints for supply at each ________ and _________ at each destination.

36. The 3 types of integer programming models are total, 0 – 1, and mixed.

TRUE/FALSE

37. In using rounding of a linear programming model to obtain an integer solution, the solution is

38. If we use Excel to solve a linear programming problem instead of QM for Windows,

 then the data input requirements are likely to be much less tedious and time consuming.

TRUE/FALSE

39. In a _______ integer model, some solution values for decision variables are integer and others can be non-integer.

40. Which of the following is not an integer linear programming problem?

STAT200 : Introduction to Statistics   Final Examination, Fall 2014 OL1                         Page 6 of 6

Is there evidence to suggest that the mean number of words recalled after 1 hour exceeds the mean recall after 24 hours by more than 3?

Assume we want to use a 0.01 significance level to test the claim.

(a)    Identify the null hypothesis and the alternative hypothesis.

(b)   Determine the test statistic. Show all work; writing the correct test statistic, without supporting work, will receive no credit.

(c)    Determine the critical value. Show all work; writing the correct critical value, without supporting work, will receive no credit.

(d)   Is there sufficient evidence to support the claim that the mean number of words

recalled after 1 hour exceeds the mean recall after 24 hours by more than 3? Justify your conclusion. (25 pts)

Refer to the following data for Questions 28 and 29.

28.              Find an equation of the least squares regression line.  Show all work; writing the correct

equation, without supporting work, will receive no credit.                              (15 pts)

29.               Based on the equation from # 28, what is the predicted value of y if x = 4?  Show all work

and justify your answer.                                                                                  (10 pts)

“Dracula’s Guest” by Bram Stoker at http://www.literature.org/authors/stokerbram/

draculas-guest/

• “Good Friday” by F. Paul Wilson in your 999 text

• “Hemophage” by Steven Spruill in your 999 text

Identify the setting for each of the three required stories. Discuss in a sentence or

two how important each is to its respective storyline. You will not receive credit if

you just write: “The setting plays a crucial part in all of these stories.” A good way

to think about this is to ask, “If this story took place somewhere else at a different

time, would it still be as effective as a horror story?”

For each of the three required vampire stories sum up in one word how you

would describe the atmosphere (the overall mood). Each story will have its own

answer. The options are endless but give a sentence or two explaining why you

came up with your word. You will not receive credit if you take the easy way out

and write, “They were all dark.”