Given the objective function:
Draw the boundary to the feasible region corresponding to the constraints
If this region is unbounded use the necessary points from the constraints and to show the an unbounded region.
Then use the feasibility region above to find the maximum and minimum of the given objective function.
Maximum: (If needed, separate points with a comma. Use DNE if the value does not exist.)
Minimum: (If needed, separate points with a comma. Use DNE if the value does not exist.)
Draw the boundary to the feasible region corresponding to the constraints
If this region is unbounded use the necessary points from the constraints and to show the an unbounded region.
Clear All Draw: Polygon
Then use the feasibility region above to find the maximum and minimum of the given objective function.
Maximum: (If needed, separate points with a comma. Use DNE if the value does not exist.)
Minimum: (If needed, separate points with a comma. Use DNE if the value does not exist.)
- Question Help:
- Video