Use app×
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2025 Foundation Course
NEET 2025 Foundation Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
513 views
in Linear Programming by (28.2k points)
closed by

(i) Choose the correct answer from the bracket. If an LPP is consistent, then its feasible region is always

(a) Bounded

(b) Unbounded

(c) Convex region

(d) Concave region

(ii) Maximize Z = 2x + 3y subject to the constraints x + y ≤ 4, x ≥ 0, y ≥ 0.

1 Answer

+1 vote
by (28.9k points)
selected by
 
Best answer

(i) (c) Convex region.

(ii) 

Corner points of the feasible region are as follows

Corner points Z = 2x+3y
O(0,0) 0
A(0,4) 12→ maximum
B(4,0) 8

∴ the maximum value of Z is 12 attained at (0, 4).

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

...