Subject to the constraints

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

Problem

Subject to the constraints x−y≥2,  x≥0,  y≥0x - y \ge 2,\; x \ge 0,\; y \ge 0, consider the objective function Z=x+3yZ = x + 3y to be maximised. Show that ZZ has no finite maximum value over the feasible region.

Related theory

Browse the problem library