In: Advanced Math
find the minimum and maximum values of z=9x+8y, if possible for the following set of constrains: 4x+3y>=12 x+3y>=6 x>=, y >= please show how to get corners
for the first constraint

divide by 12 both sides


x-intercept is (3,0)
y-intercept is (0,4)
draw a line between these two points

.
.
.
.
for the second constraint

divide by 6 both sides


x-intercept is (6,0)
y-intercept is (0,2)
draw a line between these two points

.
combine both graph

from the graph corner points are

.
.
for point




.
for point




.
for point




.
.
here feasible region is in the right sides so the function has an only minimum value
and that is
at point 
for maximum value, the region is unbound