Linear Programming Example 2: Optimization with Quadratic Functions and Tangents
Loading the math board and drawing, please wait…
In collections
Discrete: Linear Programming
This GeoGebra example demonstrates how to find the optimal solution of a linear objective function within a feasible region bounded by a quadratic curve and its tangent lines, visually illustrating the geometric relationship between the feasible region and the optimum point in linear programming. Core mathematical concepts include linear programming (linear optimization), quadratic functions, tangent lines, conic sections (parabolas), and extremum problems on the boundary of a feasible set. The construction uses objects a, b, d, e, text1, P, and OF, where P likely represents a moving point or target point, and OF may represent the objective function line. GeoGebra commands link algebraic definitions with geometric representations, drawing the quadratic curve, tangents, and the linear objective function, with text annotations for key values. This is suitable for high school or early college mathematics instruction, helping students understand the combination of linear programming with nonlinear constraints and the role of tangents in optimization, as well as exploring curve sketching and optimal positions.
GeoGebra Commands & Parameters
a(x, y) = (3 * x) + (3 * y) ≥ 120b(x, y) = (2 * x) + (4 * y) ≥ 150d(x) = x ≤ 0e(y) = y ≤ 0Numeric P(0)(10 * x) + (12 * y) = P
AI Drawing Prompt Reference
Draw a feasible region bounded by a parabola and its tangent lines, with a linear objective function line. The parabola equation is 3x+3y=120, tangent lines are 2x+4y=150, and the objective function line is 10x+12y=P. The region boundaries are determined by the intersection of tangents with axes, and the objective function line intersects the boundary at the optimal solution point. Label key points like P and the objective function line.
The prompt above was compiled from the original drawing commands and is for reference only.