Consider the objective function subject to the constraints

MATHEMATICS · Multi-part · CBSE · Mathematics · Linear Programming · Linear Programming

Problem

Consider the objective function

Z = x + y

subject to the constraints

x + y \le 6

x \ge 0

and

y \ge 0

. (i) List the coordinates of all vertices of the feasible region. (ii) Find the maximum value of

Z

and state all points in the feasible region at which this value is attained.