Maximise subject to the constraints

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

Problem

Maximise

Z = 3x + 4y

subject to the constraints

x + y \le 5

x \ge 0

and

y \ge 0

. State the maximum value of

Z

and the corresponding vertex of the feasible region.