# data[].attributes.body
Linear Programming - is a method for finding a minimum or maximum value of some quantity, given constraints.

# data[].attributes.body
Feasible Region - all of the points that satisfy all the constraints.

# data[].attributes.body
f(x+h) - shift left h units
f(x-h) - shift right h units
f(x)+h - shift up h units
f(x)-h - shift down h units
-f(x) - reflects graph over x-axis
f(-x) - reflects graph over y-axis
h(f(x)), h>1 - stretch graph vertically (multiply y-values by h)
h(f(x)), 0<h<1 - shrink graph vertically (multiply y-values by h)
f(hx), h>1 - shrink graph horizontally (divide x-values by h)
f(hx), 0<h<1 - stretch graph horizontally (divide x-values by h

# data[].attributes.body
https://i.ytimg.com/vi/MRE_Z-6Z3Tw/maxresdefault.jpg

# data[].attributes.body
https://image.slidesharecdn.com/graphingquadratics-131009061249-phpapp01/95/graphing-quadratics-3-638.jpg?cb=1381299218

# data[].attributes.body
https://image.slidesharecdn.com/factoringandboxmethod-131028080346-phpapp01/95/factoring-and-box-method-23-638.jpg?cb=1382947476