Linear Programming Problems

Author:: Kathryn Brenneman

Topic:: Linear Programming or Linear Optimization

The objective function corresponds to the value to be maximized or minimized (M in this case). The feasible region determined by the set of inequalities is the unshaded region.

New Resources

Parallelogram Properties
Trapezoid Area
Matrix Transformations
Area of a Circle
Coordinate Proofs for Parallelogram

Discover Resources

Slant Asymptotes
Unit circle
Medians of a Triangle
Line Integral of a Scalar Function
Pages from EN_KS3_e (1)

Discover Topics

Correlation
Integers
Polynomial Functions
Upper and Lower Sum or Riemann Sum
Constructions