Optimizing a Gourmet Canned Foods Production

Standard form is the usual and most intuitive form of describing a linear programming problem. It consists of the following three parts:

e.g. maximize c1c1+c2x2

e.g. a11x1+a12x2 = b1

a21x1 + a22x2= b2

a31x1 + a32x2 = b3

e.g. x1 = 0

x2 = 0