Rectangles Enclosed by a Fixed Length of Fencing
An optimization problem asks for the best value that is still allowed by a constraint. For example, a fixed length of fencing can enclose many rectangles, but those rectangles do not all have the same area. A quadratic function models the area of every permitted rectangle in terms of one side length.
Express one dimension in terms of the other, substitute that relationship into the area formula, and then interpret the vertex of the resulting parabola. This procedure works for any rectangular fencing problem with the same type of constraint.
Why a downward opening quadratic has a maximum
A quadratic function has the form
When , its graph opens downward. The vertex is therefore the highest point of the graph. If the vertex lies inside the feasible domain of the problem, its function value is the maximum.
Locating the vertex
For , the vertex coordinates are found from
The equivalent discriminant form is
The algebra identifies the vertex, but the context decides whether that vertex is usable. Lengths cannot be negative, a production count may need to be an integer, and time cannot fall outside the interval described by the model.
Maximum Area of a Rectangular Chicken Coop
A farmer has of fencing and wants to enclose a rectangular chicken coop. What dimensions produce the greatest possible area?
-
Name the dimensions. Let the length be and the width be .
-
Translate the perimeter constraint.
-
Build an area function in one variable.
-
State the feasible domain. Both side lengths must be positive, so . The coefficient is negative, which means the area graph opens downward.
-
Locate the vertex.
-
Recover the other dimension and evaluate the area.
-
Confirm that the vertex gives the maximum area. The vertex lies inside . At the boundary values, the rectangle collapses and the area approaches , so the interior vertex gives the global maximum.
The greatest area is therefore , obtained from a square.
Constraint Model Domain and Vertex
The table collects the four pieces that turn the fence problem into one variable. Each row states a part of the problem beside its mathematical form.
| Part of the problem | Mathematical statement | Meaning |
|---|---|---|
| Fixed perimeter | Every permitted rectangle uses all of fencing. | |
| One-variable model | Each permitted width has exactly one corresponding area. | |
| Feasible domain | Both side lengths remain positive. | |
| Vertex | Width produces area . |
Applying the Same Method to Profit
A profit function also asks for the highest point of the parabola, only the coordinates now mean quantity and profit.
The same method works whenever a quantity follows a downward parabola. A profit function is one such case, and its vertex gives the quantity with the largest profit.
Production profit
Suppose the profit from selling toys, measured in thousands of rupiah, is
Because , the model has a maximum:
The model predicts a maximum profit of when toys are sold. Here the vertex is already an integer, so no rounding comparison is needed.
Projectile height
Suppose a toy rocket's height after is
The physically meaningful interval follows from the times at which the height is zero:
The model therefore starts at ground level when and returns to ground level when , so its physical time domain is . Within that interval, the maximum occurs at
The rocket reaches a maximum height of after .
Practice
The problem fixes the perimeter and asks for the largest rectangle, so the constraint has to replace the second variable. Write the area as a function of one variable first.
A rectangle has perimeter . Determine the length and width that maximize its area, and find the maximum area.
Worked solution
-
Let the length be and the width be .
-
Convert the perimeter constraint into an expression for the length.
-
Substitute into the area formula.
-
The feasible domain is , and , so the vertex gives the maximum.
-
Find the width at the vertex.
-
Find the corresponding length and area.
The maximum area is , produced by a square.