A company wishes to produce two types of souvenirs: Type A and Type B. Each Type A souvenir will result in a profit of $1.00, and each Type B souvenir will result in a profit of $1.80. To manufacture a Type A souvenir requires 2 minutes on Machine I and 1 minute on Machine II. A Type B souvenir requires 1 minute on Machine I and 3 minutes on Machine II. There are 3 hours available on Machine I and 5 hours available on Machine II. (a) For a meaningful solution, the time available on Machine II must lie between 100 x and 300 x min. (Enter your answers from smallest to largest.) (b) If the time available on Machine II is changed from 300 min to (300 + k) min, with no change in the maximum capacity for Machine I, then Ace Novelty's profit is maximized by producing Type A souvenirs and Type B souvenirs, where sks (c) Find the shadow price for Resource 2 (associated with constraint 2). (Round your answer to the nearest cent.) $

A company wishes to produce two types of souvenirs: Type A and Type B. Each Type A souvenir will result in a profit of $1.00, and each Type B souvenir will result in a profit of $1.80. To manufacture a Type A souvenir requires 2 minutes on Machine I and 1 minute on Machine II. A Type B souvenir requires 1 minute on Machine I and 3 minutes on Machine II. There are 3 hours available on Machine I and 5 hours available on Machine II. (a) For a meaningful solution, the time available on Machine II must lie between 100 x and 300 x min. (Enter your answers from smallest to largest.) (b) If the time available on Machine II is changed from 300 min to (300 + k) min, with no change in the maximum capacity for Machine I, then Ace Novelty's profit is maximized by producing Type A souvenirs and Type B souvenirs, where sks (c) Find the shadow price for Resource 2 (associated with constraint 2). (Round your answer to the nearest cent.) $

College Algebra (MindTap Course List)

12th Edition

ISBN:9781305652231

Author:R. David Gustafson, Jeff Hughes

Publisher:R. David Gustafson, Jeff Hughes

Chapter6: Linear Systems

Section6.8: Linear Programming

Problem 5SC: If during the following year it is predicted that each comedy skit will generate 30 thousand and...

See similar textbooks