The feasible region of a certain linear programming problem has vertices at

MATHEMATICS · Single correct · CBSE · Mathematics · Linear Programming · Linear Programming

Problem

The feasible region of a certain linear programming problem has vertices at (0,0)(0,0), (4,0)(4,0) and (0,3)(0,3). If the objective function is Z=5x+4yZ = 5x + 4y, the maximum value of ZZ is (a) 15 (b) 20 (c) 12 (d) 16

Related theory

Browse the problem library