Consider the following LP model:
maximize Z = 6×1 – x2
subject to
x1- x2 < 2
3×1 – x2 < 6
x1, x2 > 0
Find: (a) The feasible region using the graphical method. (b) The total number of basic solutions. How many of them are feasible? (c)
The feasible optimal corner point and its associated basic solution. (d) An infeasible corner point and its associated basic solution.
TAKE ADVANTAGE OF OUR PROMOTIONAL DISCOUNT DISPLAYED ON THE WEBSITE AND GET A DISCOUNT FOR YOUR PAPER NOW!