Identify all the vertices of the feasible region determined by the following…

MATHEMATICS · Single correct · CBSE · Mathematics · Linear Programming · Linear Programming

Problem

Identify all the vertices of the feasible region determined by the following constraints:

x + 2y \le 10

2x + y \le 10

x \ge 1

y \ge 1

. (a)

\{(1,1),\,(4,1),\,(5,0),\,(0,5)\}

(b)

\{(1,1),\,(1,8),\,(\tfrac{10}{3},\tfrac{10}{3}),\,(8,1)\}

(c)

\{(1,1),\,(1,\tfrac{9}{2}),\,(\tfrac{10}{3},\tfrac{10}{3}),\,(\tfrac{9}{2},1)\}

(d)

\{(1,1),\,(1,\tfrac{9}{2}),\,(3,3),\,(4,1)\}