Answer to Question #148611 in Operations Research for VENKATESH

Question

Consider the following Linear Programming Problem (LPP):

Maximize Z = 3X1 + 5X2

Subject to,

X1 - X2 ≤ 6

X1 ≤ 10

X2 ≥ 1

X1, X2 ≥ 0

Find the basic feasible solution and the optimal solution for above Linear Programming

Problem using Two-Phase method. Also interpret the solution

Answer 1

Dear VENKATESH, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order