How do you rewrite the linear programming problem as a maximization problem with constraints involving inequalities of the forms =0, y=0, and z=0). Minimize C=2x-3y subject to 3x+5y=20, 3x+y=0

Question

How do you rewrite the linear programming problem as a maximization problem with constraints involving inequalities of the forms <= a constant (with the exception of the inequalities x>=0, y>=0, and z>=0). Minimize C=2x-3y subject to 3x+5y>=20, 3x+y<=16 -2x+y<=1 x>=0,y>=0

anonymous · Answer

Multiply the minimization function by -1. This makes it so that the function is sort of all reversed, so that maximum points now become minimum points and minimum points become maximum points. The constraints determine the domain from which the points can be chosen from. These numbers remain the same, so you do nothing to change the constraints. So now you want to minimize C = -2x + 3y subject to the same constraints as before. This will be the maximum point of 2x - 3y.