EASY
MHT-CET
IMPORTANT
Earn 100

Maximize z=2x+3y, subject to the constraints x+y2, x+2y3, x, y0. The feasible region is shaded in the following graph

Question Image

100% studentsanswered this correctly

Important Questions on Linear Programming Problems

EASY
MHT-CET
IMPORTANT

Feasible region for an LPP is shown shaded in the figure. Maximize the objective function z=5x+7y

Question Image

EASY
MHT-CET
IMPORTANT

The feasible region for an LPP is shown shaded in the figure. Determine the maximum and minimum values of z=x+2y.

Question Image

EASY
MHT-CET
IMPORTANT
The corner points of the feasible region are 800, 400, 1050, 150, 600, 0. The objective function is P=12x+6y. The maximum value of P is
MEDIUM
MHT-CET
IMPORTANT
The region represented by 2x+3y-50 and 4x-3y+20, is
EASY
MHT-CET
IMPORTANT
The function to be maximized or minimized is called the
EASY
MHT-CET
IMPORTANT
The position of points O0, 0 and P2, -2 in the region of graph of inequation 2x-3y<5 will be
EASY
MHT-CET
IMPORTANT

Determine the maximum value of z=4x+3y, if the feasible region for an LPP is shown shaded in the figure.

Question Image

MEDIUM
MHT-CET
IMPORTANT
The region represented by the inequation system x, y0, y5, x+y4 is