MathPlotAI Logo MathPlotAI

Linear Programming Example 3

Linear Programming Example 3
Loading the math board and drawing, please wait…
2020-01-20 01:23
Coordinate GeometryOptimizationGraphing
In collections Discrete: Linear Programming
This example illustrates the basic concepts of linear programming, involving the optimization of linear inequalities and objective functions. Using GeoGebra commands such as a, b, d, e, c, P, text1, OF, it visually demonstrates the feasible region and optimal solution. Suitable for high school mathematics education and learning.

GeoGebra Commands & Parameters

  1. a(x, y) = x + y ≥ 20
  2. b(x, y) = (30 * x) + (20 * y) ≥ 480
  3. d(x) = x ≤ 0
  4. e(y) = y ≤ 0
  5. c(x, y) = x + (2 * y) ≥ 36
  6. Numeric P(1100)
  7. (100 * x) + (120 * y) = P