EASY
MHT-CET
IMPORTANT
Earn 100

Objective function of a linear programming problem is

100% studentsanswered this correctly

Important Questions on Linear Programming Problems

HARD
MHT-CET
IMPORTANT
Maximum value of 12x+3y subject to constraints x0, y0, x+y5 and 3x+y9 is
HARD
MHT-CET
IMPORTANT

Determine the system of linear inequations for which the solution set is the shaded region in the following figure:

Question Image

EASY
MHT-CET
IMPORTANT
For the constraint of a linear optimizing function z=x1+x2, given by x1+x21, 3x1+x23 and x1, x20
MEDIUM
MHT-CET
IMPORTANT
Which of the following is not a vertex of the feasible region bounded by the inequalities 2x+3y6, 5x+3y15 and x, y0.
HARD
MHT-CET
IMPORTANT
For the function z=4x+9y to be maximum under the constraints x+5y200, 2x+3y134, x0, y0 the values of x and y are
HARD
MHT-CET
IMPORTANT
The maximum value of P=6x+8y subject to constraints 2x+y30, x+2y24 and x0, y0 is
HARD
MHT-CET
IMPORTANT
The solution for minimising the function z=x+y under an LPP with constraints x+y1, x+2y10, y4 and x, y0, is
MEDIUM
MHT-CET
IMPORTANT

Find the linear inequations for which the shaded area in the following figure is the solution set:

Question Image