Linear Programming & Geometric Transformations Demo

Linear Programming & Geometric Transformations Demo
Loading the math board and drawing, please wait…
2017-02-15 00:43
This example dynamically demonstrates linear programming, showing how the optimal solution of an objective function within a feasible region is determined through geometric transformations (translation, rotation). Key math concepts include linear programming, feasible region, objective function, vector, and geometric transformations. GeoGebra commands and objects like Point, Vector, Textfield, and Sequence are used to create and interact with geometric elements. Suitable for high school and above learners to understand the intuitive representation of abstract optimization problems.

GeoGebra Commands & Parameters

  1. Point(yAxis) → A_1
  2. Vector(A_1, B) → u
  3. Textfield(f) → inputBox1
  4. Sequence((0, k), k, -3, 3) → SourcePtsMD
  5. Sequence((k, f(k)), k, -3, 3) → ExpGraphpts
  6. Vector(A_1, B_2) → v
  7. Sequence(Vector[(0, k), (2, (y_{zoom} * f(k)))], k, -3, 3) → ExpMD
  8. Sequence((2, (y_{zoom} * f(k))), k, -3, 3) → ExpTargPts
  9. Sequence(Vector[(2, k), (4, (y_{zoom} * f(k)))], k, -3, 3) → InvLogMD
  10. Sequence(Vector[(0, base^(k) + 1), (2, (y_{zoom} * g(base^(k) + 1)))], k, -3, 3) → logMD
  11. Sequence((base^(k) + 1, (2 * k) + n), k, -2, 3) → logGraphpts