Consider the linear programming problem: Maximise subject to For which value(s) of is…

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

Problem

Consider the linear programming problem: Maximise

Z = 2x + 3y

subject to

x + y \le 6,\; x + k y \ge 2,\; x \ge 0,\; y \ge 0.

For which value(s) of

k

is the optimal value of

Z

attained at the vertex

(0,6)