Question: max s.t. 2= X1 + 3x2 + x3 X1 + x2 + x3 + x4 2:11 + 22 23 - 25 -12 + 13 -

max s.t. 2= X1 + 3x2 + x3 X1 + x2 + x3 + x4 2:11 + 22 23 - 25 -12 + 13 - 16 X1, X2, X3, X4, X5, X6 = 40 = 10 = 10 > 0 Someone told us that x1 = 10, X2 = 0, X3 = 10, 24 = 20, 25 = 0, X6 = 0 is a feasible solution. Check if the given point is actually a feasible point. Start from the given point and use the Simplex algorithm to find the optimum
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
