Solve the following linear programming problem graphically:
|Maximize||Upper Z equals 4 Upper X 1 plus 4 Upper X 2Z=4X1+4X2|
|Subject to:||3Upper X 1X1plus+5Upper X 2X2||less than or equals 150≤150|
|Upper X 1X1minus−2Upper X 2X2||less than or equals 10≤10|
|5Upper X 1X1plus+3Upper X 2X2||less than or equals 150≤150|
|Upper X 1X1,
Upper X 2X2
|greater than or equals 0|
1) Using the line drawing tool, plot the constraints by picking two endpoints for each line. Do not plot the nonnegativity constraints.
2) Using the point drawing tool, plot the five corner points which define the feasible region.