The feasible region of a linear programming problem has vertices at

MATHEMATICS · Subjective · CBSE · Mathematics · Linear Programming · Linear Programming

Problem

A(0,0)

B(4,0)

and

C(2,3)

. For the objective function

Z = 5x + 2y

, find the maximum value of

Z

and the vertex at which it occurs.