h) By how much a bowls price can increase above 40 without changing the optimal solution?

i) By how much a bowls price can decrease below 40 without changing the optimal solution?

j) By how much a mugs price can increase above 50 without changing the optimal solution?

k) By how much a mugs price can decrease below 50 without changing the optimal solution?

l) By how much can the constraint labor hours increase above 40 without changing the optimal solution?

m) By how much can the constraint labor hours decrease below 40 without changing the optimal solution?

n) By how much can the constraint pounds of clay increase above 120 without changing the optimal solution?

o) By how much can the constraint pounds of clay decrease below 120 without changing the optimal solution?

The decision variables are the number of mugs (M) and the number of bowls (B) to produce The goal is to maximize profit. So the object function is Profit =40B+50M Constraints are that there are only 40 hours of labor available and only 120lbs of clay available Also, B and M>=0 because we cannot produce negative bowls or mugs Maximize Prof it=40B+50M Subject to: z=40xt+50xt Multiple Optimal Solutions Beaver Creek Pottery The objective function is parallel to a constraint line. Maximizesubjectto:Z=$40x1+30x21x1+2x2404x2+3x2120x1,x20 Where: x1= number of bowls Figure 2.20 Graph of the Beaver Creek x2= number of mugs Pottery example with multiple optimal solutions The decision variables are the number of mugs (M) and the number of bowls (B) to produce The goal is to maximize profit. So the object function is Profit =40B+50M Constraints are that there are only 40 hours of labor available and only 120lbs of clay available Also, B and M>=0 because we cannot produce negative bowls or mugs Maximize Prof it=40B+50M Subject to: z=40xt+50xt Multiple Optimal Solutions Beaver Creek Pottery The objective function is parallel to a constraint line. Maximizesubjectto:Z=$40x1+30x21x1+2x2404x2+3x2120x1,x20 Where: x1= number of bowls Figure 2.20 Graph of the Beaver Creek x2= number of mugs Pottery example with multiple optimal solutions