A rectangular sign has width and height with diagonal fixed at 10. To maximize area, what is the correct constraint?
Opening subject page...
Loading your content
AP Calculus BC Quiz
Practice Introduction To Optimization Problems in AP Calculus BC with focused quiz questions that help you check what you know, review explanations, and build confidence with test-style prompts.
Question 1 / 20
0 of 20 answered
A rectangular sign has width w and height h with diagonal fixed at 10. To maximize area, what is the correct constraint?
This quiz focuses on Introduction To Optimization Problems, giving you a quick way to practice the rules, question types, and explanations that matter most for AP Calculus BC.
Try each quiz question before looking at the correct answer. Use the explanations to review missed ideas, then come back to similar questions until the pattern feels familiar.
A rectangular sign has width w and height h with diagonal fixed at 10. To maximize area, what is the correct constraint?
Explanation: This problem involves maximizing the area of a rectangle with a diagonal length constraint. If the rectangle has width w and height h with diagonal fixed at 10, then the constraint is w² + h² = 100 (since diagonal² = w² + h²). We want to maximize the area A = wh subject to this constraint. Choice B incorrectly uses w + h = 10, which would be a perimeter constraint, not a diagonal constraint. The diagonal of a rectangle with sides w and h is √(w² + h²), so fixing the diagonal at 10 gives w² + h² = 100. The approach is to correctly translate geometric constraints (like fixed diagonal length) into algebraic constraint equations.
A hot-air balloon rises; its height is h(t)=−t2+6t+10. On 0≤t≤6, what should be optimized to find peak height?
Explanation: This problem requires maximizing a quadratic function on a closed interval to find the peak height. The balloon's height is given by h(t) = -t² + 6t + 10, which is a downward-opening parabola. On the interval 0 ≤ t ≤ 6, we want to find the maximum value of h(t). Since this is a standard calculus optimization problem, we maximize h(t) over the given interval. Choice B incorrectly minimizes height, but we want the peak. The vertex occurs at t = -6/(2(-1)) = 3, and h(3) = -9 + 18 + 10 = 19. The fundamental approach is to recognize that finding extreme values (like peak height) requires optimizing the appropriate function over its domain.
A rectangular garden has perimeter 60 m and one side must be twice the other. What should be optimized to maximize space?
Explanation: This problem involves maximizing the area of a rectangle with both a perimeter constraint and a side ratio constraint. The rectangle has perimeter 2l + 2w = 60 and the constraint l = 2w. Substituting the ratio constraint into the perimeter gives 2(2w) + 2w = 60, so 6w = 60 and w = 10, l = 20. However, the problem asks for the optimization setup before solving. We want to maximize area A = lw subject to 2l + 2w = 60 and l = 2w. Choice B incorrectly minimizes perimeter, but perimeter is fixed. The approach is to set up the area maximization with both the perimeter constraint and the geometric constraint on the side ratio.
A rectangular box with no top has square base side x and height h, with volume 32. What should be minimized?
Explanation: This problem involves minimizing surface area for an open-top box with square base and fixed volume. The box has square base with side x and height h, with volume constraint x²h = 32. The surface area includes the base (x²) and four sides (each xh), giving total S = x² + 4xh. Using the volume constraint h = 32/x², we get S(x) = x² + 4x(32/x²) = x² + 128/x. We minimize this surface area to reduce material costs. Choice B incorrectly maximizes surface area, increasing material usage. The modeling strategy is to use the volume constraint to express surface area as a function of one variable, then optimize to minimize material costs.
A rectangle is inscribed in the first quadrant with one corner at the origin and opposite corner on xy=16. What should be maximized?
Explanation: This problem requires minimizing the perimeter of a rectangle with vertices constrained by a hyperbola. The rectangle has one vertex at the origin and the opposite vertex at point (x,x16) on the curve xy=16. The rectangle has width x and height x16, giving perimeter P(x)=2x+2(x16)=2x+x32 for x>0. The area is A(x)=x(x16)=16, which is constant. Since we want to minimize material used for the frame (perimeter), we minimize P(x). Choice C incorrectly maximizes perimeter, which would waste material. The key insight is that hyperbola constraints create rectangles with constant area, so optimization focuses on minimizing perimeter to reduce material costs.
A cone-shaped paper cup must hold volume V with fixed slant height s. To maximize volume, what variable should be optimized?
Explanation: This problem requires maximizing the volume of a cone with fixed slant height constraint. For a cone with base radius r, height h, and slant height s, the relationship is r2+h2=s2. The volume is V=(1/3)πr2h. With s fixed, we can write h=s2−r2 and substitute to get V(r)=(1/3)πr2s2−r2. We maximize this volume as a function of r, with domain 0≤r≤s. Choice B incorrectly minimizes volume, but we want the largest possible cup. The key insight is to use the geometric constraint (relating r, h, and s) to express volume as a function of one variable, then optimize that single-variable function.
A rectangular sheet is folded to form an open-top box by cutting out squares of side x from corners. What quantity is maximized?
Explanation: This problem involves maximizing the volume of a box created by cutting and folding a flat sheet. When squares of side x are cut from each corner of a rectangular sheet and the sides are folded up, the resulting box has height x. If the original sheet has dimensions L × W, the box has base dimensions (L - 2x) × (W - 2x) and volume V(x) = x(L - 2x)(W - 2x). The domain is 0 < x < min(L/2, W/2). Choice B incorrectly focuses on surface area, but we want maximum storage capacity. The modeling approach is to express the three-dimensional volume in terms of the cut parameter x, accounting for how the cuts affect each dimension of the resulting box.
A Norman window consists of a rectangle topped by a semicircle; the perimeter is 10 m. What is the correct setup?
Explanation: This problem requires maximizing the area of a Norman window subject to a perimeter constraint. A Norman window consists of a rectangle of width w and height h topped by a semicircle of diameter w. The total area is A=wh+21π(2w)2=wh+8πw2. The perimeter constraint includes the rectangle's base and two sides plus the semicircular arc: w+2h+π2w=10. Choice C incorrectly treats it as a simple rectangle, ignoring the semicircular top. The modeling strategy is to carefully account for all geometric components in both the objective function and constraint equation.
A box with square base has volume 108 in3. If surface area is to be minimized, what is the objective function?
Explanation: This problem involves minimizing surface area for a box with fixed volume constraint. Given that the box has a square base with side x and height h, the volume constraint is x²h = 108. The surface area consists of the base (x²), top (x²), and four sides (each xh), giving total surface area S = 2x² + 4xh. Since we want to minimize material usage, we minimize surface area as a function of x using the volume constraint to eliminate h. Choice B incorrectly suggests maximizing surface area, which would use the most material rather than least. The fundamental approach is to express the objective function in terms of a single variable using the constraint equation.
A wire of length 24 cm is cut into two pieces to form a square and an equilateral triangle. What should be minimized?
Explanation: This problem requires minimizing the total area of two shapes formed from a single wire of fixed length. Let x be the length of wire used for the square, so (24 - x) is used for the equilateral triangle. The square has side length x/4 and area (x/4)² = x²/16. The triangle has perimeter (24 - x) and side length (24 - x)/3, giving area (√3/4)((24 - x)/3)². The total area is A(x) = x²/16 + (√3/36)(24 - x)². Choice A incorrectly focuses on perimeter, but total perimeter is fixed at 24 cm. The optimization approach is to express the combined objective (total area) as a function of how the constraint resource (wire length) is allocated between competing uses.
A company’s demand is p=80−2x dollars per unit. Revenue is R=xp. What should be maximized to find best sales level?
Explanation: This problem involves maximizing revenue using a linear demand function. The demand relationship is p = 80 - 2x, where p is price and x is quantity. Revenue is R = xp = x(80 - 2x) = 80x - 2x². This is a quadratic function in x, and we maximize it to find the optimal sales level. The maximum occurs at x = 80/(2·2) = 20, giving maximum revenue R = 80(20) - 2(20)² = 1600 - 800 = 800. Choice B incorrectly minimizes revenue, which would minimize profit. The fundamental approach is to substitute the demand function into the revenue equation and optimize the resulting quadratic function.
A right circular cylinder must hold 500 cm3. To minimize material, which quantity should be minimized?
Explanation: This problem involves minimizing the material needed (surface area) for a cylinder with fixed volume constraint. The cylinder must hold 500 cm³, so the volume constraint is πr²h = 500. The total surface area includes the base (πr²), top (πr²), and lateral surface (2πrh), giving S = 2πr² + 2πrh. To minimize material usage, we minimize this surface area as a function of r, using the volume constraint to express h in terms of r. Choice A incorrectly suggests maximizing volume, but volume is fixed by the problem requirement. The optimization approach is to minimize cost-related quantities (here, material surface area) subject to performance constraints (required volume).
A rectangle is formed with one side on the x-axis and two vertices on y=4x−x2. What quantity should be maximized?
Explanation: This problem involves maximizing the area of a rectangle with vertices constrained by a parabola and the x-axis. The rectangle has one side along the x-axis and two vertices on the parabola y = 4x - x². If the rectangle extends from x = 0 to x = a, then its width is a and height is 4a - a², giving area A(a) = a(4a - a²) = 4a² - a³. The domain is 0 ≤ a ≤ 4 since the height must be non-negative. Choice B incorrectly focuses on perimeter, but we want maximum enclosed area. The modeling strategy is to parameterize the rectangle using one coordinate (the rightmost x-coordinate), then use the parabola equation to determine the height and express area as a single-variable function.
A rectangle has vertices on the coordinate axes and the line 3x+2y=12 in the first quadrant. What should be maximized?
Explanation: This problem requires maximizing the area of a rectangle with vertices on coordinate axes and a line. The rectangle has vertices at (0,0), (x,0), (0,y), and (x,y) where the point (x,y) lies on the line 3x + 2y = 12 in the first quadrant. The rectangle's area is A = xy, and we maximize this subject to the line constraint. Using the constraint y = (12 - 3x)/2, we get A(x) = x(12 - 3x)/2 = (12x - 3x²)/2. This is maximized when x = 2, giving y = 3 and maximum area 6. Choice B incorrectly minimizes area, but we want maximum enclosed space. The fundamental approach is to use the line constraint to express area as a function of one coordinate, then optimize that function.
A student wants to minimize the distance from point (2,5) to a point (x,0) on the x-axis. What should be minimized?
Explanation: This problem requires minimizing the distance from a fixed point to a variable point constrained to lie on the x-axis. The fixed point is (2,5) and the variable point is (x,0). The distance is D(x) = √[(x-2)² + (0-5)²] = √[(x-2)² + 25]. Since we want to minimize this distance, and x can be any real number, we minimize D(x) = √[(x-2)² + 25]. Choice C incorrectly uses (x+2)² instead of (x-2)², and choice D unnecessarily restricts the domain. The fundamental approach is to use the distance formula and recognize that minimizing distance is equivalent to minimizing the squared distance when the square root complicates differentiation.
A rectangle is to be placed inside a circle of radius 5. To maximize area, what should be optimized?
Explanation: This problem involves maximizing the area of a rectangle inscribed in a circle. For a rectangle inscribed in a circle of radius 5, the diagonal of the rectangle equals the diameter of the circle, which is 10. If the rectangle has length l and width w, then l² + w² = 100 (since diagonal = 10). We want to maximize the area A = lw subject to this constraint. Choice B incorrectly minimizes area, but we want the largest possible rectangle. Using the method of Lagrange multipliers or substitution, the maximum occurs when l = w = 5√2, giving maximum area 50. The approach is to use the geometric constraint (rectangle inscribed in circle means diagonal equals diameter) to set up the optimization problem.
A farmer has 200 m of fencing to enclose a rectangular pen; one side borders a river needing no fence. What should be maximized?
Explanation: This problem requires setting up an optimization to maximize enclosed area with a constraint on available fencing. The farmer wants to create the largest possible rectangular pen using 200 m of fencing, where one side borders a river and needs no fence. If the pen has width w (perpendicular to river) and length l (parallel to river), then the constraint is w + w + l = 200, or 2w + l = 200. The objective is to maximize the area A = wl as a function of the fence dimensions. Choice B incorrectly suggests maximizing perimeter, but perimeter is fixed by the constraint. The key insight is that optimization problems maximize or minimize an objective function (here, area) subject to constraint equations involving the decision variables.
A runner runs from (0,0) to a point (x,0) then to (10,6). If speeds differ on each segment, what should be minimized?
Explanation: This problem involves minimizing total travel time when speeds differ on different segments of a path. The runner travels from (0,0) to point (x,0) at one speed, then from (x,0) to (10,6) at a different speed. If the speeds are v₁ and v₂ respectively, the total time is T(x) = x/v₁ + √[(10-x)² + 36]/v₂. The first distance is x, and the second distance is √[(10-x)² + 6²] by the distance formula. We minimize total travel time as a function of the intermediate point x. Choice B incorrectly maximizes time, seeking the slowest route. The fundamental approach is to express total time as the sum of segment times, each calculated as distance divided by speed for that segment.
A rectangle of width x is inscribed in a semicircle of radius r. What should be maximized to find the largest rectangle?
Explanation: This problem involves maximizing the area of a rectangle inscribed in a semicircle with geometric constraints. The rectangle has width x and is symmetric about the y-axis, so it extends from -x/2 to x/2 horizontally. The height is determined by the semicircle equation: x² + y² = r², so y = √[r² - (x/2)²]. The rectangle's area is A(x) = x · √[r² - (x/2)²]. The domain is 0 ≤ x ≤ 2r. Choice B incorrectly focuses on the semicircle's area, which is fixed. The modeling strategy is to use one parameter (width) and the constraint curve to express the area as a single-variable function.
A rectangle has its upper corners on the line y=10−x in the first quadrant and sides on axes. What should be maximized?
Explanation: This problem requires maximizing the area of a rectangle with vertices constrained by a line and the axes. The rectangle has one side on the x-axis from (0,0) to (x,0) and extends up to the line y = 10 - x. The rectangle's width is x and height is 10 - x, giving area A(x) = x(10 - x) = 10x - x². The domain is 0 ≤ x ≤ 10 since both width and height must be non-negative. Choice B incorrectly minimizes area, but we want maximum enclosed space. The key insight is to parameterize the rectangle using one coordinate, then use the constraint (the line equation) to express the area as a single-variable function.