Question: I have completed parts A-D. can you help on E & F Consider the following LP model: Maximize Z = 3x1 + 2x2 subject to
I have completed parts A-D. can you help on E & F
Consider the following LP model: Maximize Z = 3x1 + 2x2 subject to x1 + x2 3 2x1 + x2 4 and x1 0, x2 0
a. (8 pts) Transform the two problem constraint inequalities to equations by using either slack or surplus variables as needed. Write the complete revised LP model (with objective function and all nonnegativity constraints too) here:
b. (4 pts) How many total variables (decision and slack or surplus) are there in the revised model above? How many equations?
c. (4 pts) How many basic variables will there be in a basic solution of the linear programming problem in part (a)? Why?
d. (4 pts) How many nonbasic variables will there be in a basic solution of the linear programming problem in part (a)? Why?
e. (18 pts) Algebraically compute all six basic solutions of the linear programming problem in part (a), then list them on the lines below. A basic solution should consist of values for all variables in the revised LP model. (Note: Do not draw the graph of the feasible region.)
f. (6 pts) For each of the six basic solutions you found in part (e), write whether it is a basic feasible solution, or a basic solution that is not feasible. Explain your answers.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
