Use the simplex method to solve the linear programming problem. Maximize z=12x1+5x2 subject to: 6x1+3x2<=15 x1+3x2<=<=4 with x1>=0, x2>=0.

mxb67

step-by-step explanation:

answer

d. 10

explanation

the distance from point y to wx is the height of the triangle.

using pythagoras theorem,

group similar terms to get,

this implies that,

take positive square root of both sides to get,

this implies that,

i have not got your picture clearly so see it once again