1. A pottery shop is gearing up for the spring season and is ready to make bird baths. They produce two different bird baths, one glazed and one not glazed. It takes the potter a half hour to make an unglazed bird bath and one hour to make a glazed bird bath. To dry the baths, unglazed takes 3 hours in the kiln while glazed takes 18 hours. The potter works for 8 hours a day. The kiln can be on for a maximum of 60 hours at a time. If the shop makes $10 profit for unglazed, and $40 profit for glazed, how many of each pot should they make to maximize profit? g. Define the variables. x . and y= h. Write the constraints as inequalities and graph them (hint: find the x and y intercepts to graph them) i. List the vertices of the feasible region. If you can not accurately read them off of your graph, you will need to solve a system of equations to find each point.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Topic Video
Question
Linear Programming
Name:
1. A pottery shop is gearing up for the spring season and is ready to make bird baths. They produce two different bird baths, one
glazed and one not glazed. It takes the potter a half hour to make an unglazed bird bath and one hour to make a glazed bird bath. To
dry the baths, unglazed takes 3 hours in the kiln while glazed takes 18 hours. The potter works for 8 hours a day. The kiln can be on
for a maximum of 60 hours at a time. If the shop makes $10 profit for unglazed, and $40 profit for glazed, how many of each pot
should they make to maximize profit?
g. Define the variables. x=
and y=
h.
Write the constraints as inequalities and graph them (hint: find the x and y intercepts to graph them)
List the vertices of the feasible region. If
you can not accurately read them off of
your graph, you will need to solve a
system of equations to
i.
d each point.
j.
Give the profit equation
k.
Test each vertex in the profit equation.
Write a statement describing how many
of each item should be made in order to
1.
maximize the profit?
Transcribed Image Text:Linear Programming Name: 1. A pottery shop is gearing up for the spring season and is ready to make bird baths. They produce two different bird baths, one glazed and one not glazed. It takes the potter a half hour to make an unglazed bird bath and one hour to make a glazed bird bath. To dry the baths, unglazed takes 3 hours in the kiln while glazed takes 18 hours. The potter works for 8 hours a day. The kiln can be on for a maximum of 60 hours at a time. If the shop makes $10 profit for unglazed, and $40 profit for glazed, how many of each pot should they make to maximize profit? g. Define the variables. x= and y= h. Write the constraints as inequalities and graph them (hint: find the x and y intercepts to graph them) List the vertices of the feasible region. If you can not accurately read them off of your graph, you will need to solve a system of equations to i. d each point. j. Give the profit equation k. Test each vertex in the profit equation. Write a statement describing how many of each item should be made in order to 1. maximize the profit?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Knowledge Booster
Optimization
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,