Use simplex method to maximize 𝑓 = 3𝑥 + 5𝑦 + 4𝑧 subject to the conditions 2𝑥 + 3𝑦 ≤ 18 2𝑥 + 5𝑦 ≤ 10 3𝑥 + 2𝑦 + 4𝑧 ≤ 15 and 𝑥, 𝑦, 𝑧 ≥ 0.
One of the theorems of simplex method states that the solution of the linear problem exists at one of the edge points. In our case the region is bounded by 6 planes: , . It is possible to find such solution in Maple via the commands:
with(Optimization):
Minimize(-3*x-5*y-4*z,{2*x+3*y<=18,2*x+5*y<=10,3*x+2*y+4*z<=15,x>=0,y>=0,z>=0});
Since it is the minimization problem, the function has the opposite sign.
It is at the intersection of planes . The value is for the original maximization problem. Thus, the solution is at the point . The value is .
The manual method of finding solution is the following:
One of conditions from the task formulation is: . Thus, . Using the fact that and inequality we get: . Thus, . The point that satisfies equality is: . It satisfies equalities , and .
Comments