Linear Programming Problem by shanlee

Linear Programming Problem by shanlee
Loading the math board and drawing, please wait…
2014-11-05 22:10
In collections Linear Programming
This example demonstrates the basic concepts of linear programming. By drawing the feasible region defined by inequalities, it finds the maximum or minimum value of the objective function. The construction summary uses commands like Intersect and Point, involving Inequalities and Linear Programming. Suitable for high school math education and learning.

GeoGebra Commands & Parameters

  1. Intersect(h, g) → C
  2. Intersect(yAxis, h) → D
  3. Intersect(g, xAxis) → E
  4. Point(j) → F