EASY
VITEEE
IMPORTANT
Earn 100

Objective function of a L.P.P. is

91.67% studentsanswered this correctly

Important Questions on Linear Programming

MEDIUM
VITEEE
IMPORTANT
Comprehensive Guide to VITEEE Mathematics. Other applicable Exams - JEE Main, BITSAT, SRM JEE, MHT-CET, K-CET, EAMCET, AMU & Other State Engg. Entrance Exams>Chapter 19 - Linear Programming>Exercise 1>Q 9

The feasible region for an LPP is shown shaded in the figure. Let, Z=3x-4y be the objective function. Then, minimum of Z occurs at

Question Image

EASY
VITEEE
IMPORTANT
Comprehensive Guide to VITEEE Mathematics. Other applicable Exams - JEE Main, BITSAT, SRM JEE, MHT-CET, K-CET, EAMCET, AMU & Other State Engg. Entrance Exams>Chapter 19 - Linear Programming>Exercise 1>Q 10
Region represented by x≥0, y≥0 is
EASY
VITEEE
IMPORTANT
Comprehensive Guide to VITEEE Mathematics. Other applicable Exams - JEE Main, BITSAT, SRM JEE, MHT-CET, K-CET, EAMCET, AMU & Other State Engg. Entrance Exams>Chapter 19 - Linear Programming>Exercise 1>Q 11
The feasible region for LPP is shown shaded in the figure. Let f=3x-4y be the objective function, then maximum value of f is

Question Image

HARD
VITEEE
IMPORTANT
Comprehensive Guide to VITEEE Mathematics. Other applicable Exams - JEE Main, BITSAT, SRM JEE, MHT-CET, K-CET, EAMCET, AMU & Other State Engg. Entrance Exams>Chapter 19 - Linear Programming>Exercise 1>Q 12
Maximize Z=3x+5y, subject to x+4y≤24, 3x+y≤21, x+y≤9,x≥0,y≥0, is
HARD
VITEEE
IMPORTANT
Comprehensive Guide to VITEEE Mathematics. Other applicable Exams - JEE Main, BITSAT, SRM JEE, MHT-CET, K-CET, EAMCET, AMU & Other State Engg. Entrance Exams>Chapter 19 - Linear Programming>Exercise 1>Q 13
Z=6x+21y, subject to x+2y≥3, x+4y≥4, 3x+y≥3, x≥0, y≥0. The minimum value of Z occurs at
HARD
VITEEE
IMPORTANT
Comprehensive Guide to VITEEE Mathematics. Other applicable Exams - JEE Main, BITSAT, SRM JEE, MHT-CET, K-CET, EAMCET, AMU & Other State Engg. Entrance Exams>Chapter 19 - Linear Programming>Exercise 1>Q 14
Maximize Z=4x+6y, subject to 3x+2y≤12, x+y≥4, x,y≥0, is
MEDIUM
VITEEE
IMPORTANT
Comprehensive Guide to VITEEE Mathematics. Other applicable Exams - JEE Main, BITSAT, SRM JEE, MHT-CET, K-CET, EAMCET, AMU & Other State Engg. Entrance Exams>Chapter 19 - Linear Programming>Exercise 1>Q 15
The number of convex polygon formed bounding the feasible region of the L.P.P. Max. Z=30x+60y subject to the constraints 5x+2y≤10, x+y≤4, x≥0, y≥0 are
MEDIUM
VITEEE
IMPORTANT
Comprehensive Guide to VITEEE Mathematics. Other applicable Exams - JEE Main, BITSAT, SRM JEE, MHT-CET, K-CET, EAMCET, AMU & Other State Engg. Entrance Exams>Chapter 19 - Linear Programming>Exercise 1>Q 16

Corner points of the feasible region for an LPP are 0,2,3,0,6,0,6,8 and  0,5. Let F=4x+6y be the objective function. Then, the minimum value of F occurs at