Linear Programming

The constraints:

%5Cleft%5C%7B%5Cbegin%7Barray%7D%7Bl%7Dx%2B2%20y%20%5Cleq%2010%20%5C%5C%20x%2By%20%5Cgeq%202%20%5C%5C%20x%20%5Cgeq%200%20%5C%5C%20y%20%5Cgeq%200%5Cend%7Barray%7D%5Cright.

Identify the corner points (vertices) of the feasible region.Determine the minimum value of

Z

.First, convert the inequalities to equations to find the boundary lines.$

%5Cbegin%7Bgathered%7D%20x%2B2%20y%3D10%20%5C%5C%20x%2By%3D2%20%5Cend%7Bgathered%7D

Intersection%20Points%20with%20Axes1.For

x+2 y=10

%3AWhen

x=0: 2 y=10 \Rightarrow y=5

(Point%3A

(0,5)

)When

y=0: x=10

(Point%3A

(10,0)

)2.For

x+y=2

%3AWhen

x=0: y=2

(Point%3A

(0,2)

)When

y=0: x=2

(Point%3A

(2,0)

)

1.(0,5)$

2.%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C%5C%2C(2%2C0)

%5Cbegin%7Barray%7D%7B%7Cc%7Cc%7C%7D%20%5Chline(x%2C%20y)%20%26%20Z%3Dx-y%20%5C%5C%20(0%2C5)%20%26%20Z%3D0-5%3D-5%20%5C%5C%20%5Chline(2%2C0)%20%26%20Z%3D2-0%3D2%20%5C%5C%20%5Chline%20%5Cend%7Barray%7D

Chapter Questions
1 MCQs