Question

Consider the linear programming problem:
Maximize $z=10 x+5 y$ subject to the constraints
$ 2 x+3 y \leq 120 $
$ 2 x+y \leq 60 $
$ x, y \geq 0$
Then the coordinates of the corner points of the feasible region are

• A. $(0,0),(30,0),(0,40)$ and $(15,30)$
• B. $(0,0),(60,0),(0,40)$ and $(15,30)$
• C. $(0,0),(30,0),(0,60)$ and $(15,30)$
• D. $(0,0),(30,0),(0,40)$ and $(30,40)$
• E. $(0,0),(60,0),(0,40)$ and $(30,40)$

Answer 1

Answer: (A)

Correct answer is (a) $(0,0),(30,0),(0,40)$ and $(15,30)$