In a media selection problem, the estimated number of customers reached by a given media would generally be specified in the _________________.

1. 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 ______________. (Points : 2) problem constraints, salesproblem constraints, profitsobjective function, profitsproblem output, marginal revenueproblem statement, revenue 2. In a media selection problem, instead of having an objective of maximizing profit or minimizing cost, generally the objective is to maximize the audience exposure. (Points : 2) True False 3. ____________ solutions are ones that satisfy all the constraints simultaneously. (Points : 2) alternatefeasibleinfeasibleoptimalunbounded4. In an unbalanced transportation model, supply does not equal demand and supply constraints have signs. (Points : 2) True False 5. When using linear programming model to solve the “diet” problem, the objective is generally to maximize profit. (Points : 2) True False 6. Linear programming model of a media selection problem is used to determine the relative value of each advertising media. (Points : 2) True False 7. The production manager for the Softy soft drink company is considering the production of 2 kinds of soft drinks: regular and diet. Two of her resources are constraint production time (8 hours = 480 minutes per day) and syrup (1 of her ingredient) limited to 675 gallons per day. To produce a regular case requires 2 minutes and 5 gallons of syrup, while a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case. What is the optimal daily profit? (Points : 2) $220$270$320$420$5208. Media selection is an important decision that advertisers have to make. In most media selection decisions, the objective of the decision maker is to minimize cost. (Points : 2) True False 9. When formulating a linear programming model on a spreadsheet, the measure of performance is located in the target cell. (Points : 2) True False 10. 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 (Points : 2) True False 11. _________ is maximized in the objective function by subtracting cost from revenue. (Points : 2) ProfitRevenueCostProductivity12. 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? (Points : 2) 0L and 0V0L and 1000V1000L and 0V0L and 1200V13. A constraint for a linear programming problem can never have a zero as its right-hand-side value. (Points : 2) True False 14. Profit is maximized in the objective function by (Points : 2) subtracting cost from revenuesubtracting revenue from costadding revenue to costmultiplying revenue by cost15. The production manager for Liquor etc. produces 2 kinds of beer: light and dark. Two of his resources are constrained: malt, of which he can get at most 4800 oz per week; and wheat, of which he can get at most 3200 oz per week. 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. What is the objective function? (Points : 2) Z = $1L + $2DZ = $4L + $8DZ = $12L + $8DZ = $2L + $1DZ = $2L + $4D16. Determining the production quantities of different products manufactured by a company based on resource constraints is a product mix linear programming problem. (Points : 2) True False 17. In a multi-period scheduling problem the production constraint usually takes the form of : (Points : 2) beginning inventory + demand – production = ending inventorybeginning inventory – demand + production = ending inventorybeginning inventory – ending inventory + demand = productionbeginning inventory – production – ending inventory = demandbeginning inventory + demand + production = ending inventory18. In a balanced transportation model, supply equals demand such that all constraints can be treated as equalities. (Points : 2) True False 19. A croissant shop produces 2 products: bear claws (B) and almond filled croissants (C). Each bear claw requires 6 ounces of flour, 1 ounce of yeast, and 2 TS of almond paste. An almond filled croissant requires 3 ounces of flour, 1 ounce of yeast, and 4 TS of almond paste. The company has 6600 ounces of flour, 1400 ounces of yeast, and 4800 TS of almond paste available for today’s production run. Bear claw profits are 20 cents each, and almond filled croissant profits are 30 cents each. What is the optimal daily profit? (Points : 2) $380$400$420$440$48020. The dietician for the local hospital is trying to control the calorie intake of the heart surgery patients. Tonight’s dinner menu could consist of the following food items: chicken, lasagna, pudding, salad, mashed potatoes and jello. The calories per serving for each of these items are as follows: chicken (600), lasagna (700), pudding (300), salad (200), mashed potatoes with gravy (400) and jello (200). If the maximum calorie intake has to be limited to 1200 calories. What is the dinner menu that would result in the highest calorie in take without going over the total calorie limit of 1200. (Points : 2) chicken, mashed potatoes and gravy, jello and saladlasagna, mashed potatoes and gravy, and jellochicken, mashed potatoes and gravy, and puddinglasagna, mashed potatoes and gravy, and salad

Calculate Your Essay Price
(550 words)

Approximate price: $22

Calculate the price of your order

550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
The price is based on these factors:
Academic level
Number of pages
Basic features
  • Free title page and bibliography
  • Unlimited revisions
  • Plagiarism-free guarantee
  • Money-back guarantee
  • 24/7 support
On-demand options
  • Writer’s samples
  • Part-by-part delivery
  • Overnight delivery
  • Copies of used sources
  • Expert Proofreading
Paper format
  • 275 words per page
  • 12 pt Arial/Times New Roman
  • Double line spacing
  • Any citation style (APA, MLA, Chicago/Turabian, Harvard)

Our guarantees

Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.

Money-back guarantee

You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.

Read more

Zero-plagiarism guarantee

Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.

Read more

Free-revision policy

Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.

Read more

Privacy policy

Your email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.

Read more

Fair-cooperation guarantee

By sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.

Read more

Order your essay today and save 10% with the coupon code: best10