The constraints are:
- −2x−3y≤−6
- x−2y≤2
- 3x+2y≤12
- −3x+2y≤3
- x,y≥0
Rewriting constraint (1) by multiplying by −1:
2x+3y≥6
The boundary lines are:
- 2x+3y=6
- x−2y=2
- 3x+2y=12
- −3x+2y=3
- x=0, y=0
Corner Point A: Intersection of 2x+3y=6 and x−2y=2
From x−2y=2:
x=2+2y
Substituting in 2x+3y=6:
2(2+2y)+3y=6
4+4y+3y=6
7y=2
y=72
x=2+2(72)=718
Point A =(718,72)
Corner Point B: Intersection of x−2y=2 and 3x+2y=12
Adding both equations:
4x=14
x=27
From x−2y=2:
27−2y=2
2y=23
y=43
Point B =(27,43)
Corner Point C: Intersection of 3x+2y=12 and −3x+2y=3
Adding both equations:
4y=15
y=415
From −3x+2y=3:
−3x+2(415)=3
−3x+215=3
−3x=−29
x=23
Point C =(23,415)
Corner Point D: Intersection of −3x+2y=3 and 2x+3y=6
From 2x+3y=6:
x=26−3y
Substituting in −3x+2y=3:
−3[26−3y]+2y=3
2−18+9y+2y=3
−18+9y+4y=6
13y=24
y=1324
x=26−3(1324)=136
Point D =(136,1324)
The feasible region is confined to the first quadrant with x≥0 and y≥0. The four constraints form a closed region connecting the four corner points to form a quadrilateral.
Therefore, the feasible region is bounded and has 4 corner points.