The minimum value of z is -12.
Given that the system of linear programming
z=-3x+5y
x+y≥-22
x-y≥-4
x-y≤2
Firstly, we will convert the given constraints into equality as
x+y=-22
x-y=-4
x-y=2
Now, we will take the equation x+y=-22 and taking x as 0 as find y and taking y as 0 to find x, we get
If x=0 then y is
0+y=-22
y=-22
If y=0 then x=-22
So, the points lie on the line x+y=-22 is (0,-22) and (-22,0).
Further, we will take the equation x-y=-4 and taking x as 0 as find y and taking y as 0 to find x, we get
If x=0 then y=4
If y=0 then x=-4
So, the points lie on the line x-y=-4 is (0,4) and (-4,0).
Furthermore, we will take the equation x-y=2 and taking x as 0 as find y and taking y as 0 to find x, we get
If x=0 then y=-2
If y=0 then x=2
So, the points lie on the line x-y=2 is (0,-2) and (2,0).
now, we will find the feasible region of the given constraints as shown in figure.
We will find that each constraint will contain origin or not by substituting (0,0), we get
0+0≥-22 containing origin
0-0≥-4 containing origin
0-0≤2 containing origin
From the graph we can see that the minimum value of x is -13 and minimum value of y is -12.
z=-3x+5y
z=-3x+3y+2y
z=-3(x-y)+2y
minmum value of x-y from the given constraints is
-4≤x-y≤2
From here minimum value of x-y is -4
So, z=-3(-4)+2y
z=12+2y
For the minimum value of z the value of y should be minimum.
From the graph we can see the minimum value of y=-12
So, z=12+2(-12)
z=12-24
z=-12
Hence, the minimum value of z for the system of Linear Programming:
z=-3x + 5y, x+y≥-22, x-y≥-4, x - y ≤ 2 is -12.
Learn more about linear programming from here brainly.com/question/13154906
#SPJ1
