A manufacturing company makes two types of water skis, a trick ski and a slalom ski. The trick ski requires 12 labor-hours for fabricating and 1 labor-hour for finishing. The slalom ski requires 6 labor-hours for fabricating and 1 labor-hour for finishing. The maximum labor-hours available per day for fabricating and finishing are 156 and 18, respectively. Find the set of feasible solutions graphically for the number of each type of ski that can be produced. If x is the number of trick skis and y is the number of slalom skis produced per day, write a system of linear inequalities that indicates appropriate restraints on x and y. Write an inequality for the constraint on fabricating time. Complete the inequality below. .....

A manufacturing company makes two types of water skis, a trick ski and a slalom ski. The trick ski requires 12 labor-hours for fabricating and 1 labor-hour for finishing. The slalom ski requires 6 labor-hours for fabricating and 1 labor-hour for finishing. The maximum labor-hours available per day for fabricating and finishing are 156 and 18, respectively. Find the set of feasible solutions graphically for the number of each type of ski that can be produced. If x is the number of trick skis and y is the number of slalom skis produced per day, write a system of linear inequalities that indicates appropriate restraints on x and y. Write an inequality for the constraint on fabricating time. Complete the inequality below. .....

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