A standard maximization problem in n unknowns is a linear programming problem in which we are required to maximize the objective function: Z = c1x1 + c2x1 + . . . + cn xn subject to constraints of the form a11x1 + a12x2 +. . .+ a1nxn ≤ b1 a21x1 + a22x2 +. . .+ a2nxn ≤ b2 . . . am1x1 + am2x2 +....