Consider a L.P.P, Maximize subject to constraints , , , . Then which of the following are true?
(A) The feasible region of L.P.P is bounded region
(B) The corner points of the feasible region are (0, 0), (2, 2), (0, 1)
(C) Maximum value of Z is 9
(D) Point (1, 3) lies in the feasible region
Choose the correct answer from the options given below:
Consider a L.P.P, Maximize subject to constraints , , , . Then which of the following are true?
(A) The feasible region of L.P.P is bounded region
(B) The corner points of the feasible region are (0, 0), (2, 2), (0, 1)
(C) Maximum value of Z is 9
(D) Point (1, 3) lies in the feasible region
Choose the correct answer from the options given below:
Solution
The objective function is Maximize with constraints:
(means )
To find corner points, convert inequalities to equations:
- (i.e., )
- (y-axis)
- (x-axis)
Origin: where x-axis meets y-axis
Line meets y-axis ():
Point:
Check constraint :
is false
This point is NOT in the feasible region.
Line meets x-axis ():
Point: is valid.
Lines and intersect:
Therefore
Point: is valid.
The actual corner points are , , .
Statement (A): The feasible region is bounded
The feasible region is enclosed by the constraint lines and doesn't extend to infinity.
Statement (A) is TRUE.
Statement (B): Corner points are , ,
Check : fails the constraint
fails as shown above
Statement (B) is FALSE.
Statement (C): Maximum value of Z is 9
Calculate at each corner point:
Maximum
Statement (C) is TRUE.
Statement (D): Point lies in the feasible region
Check constraints:
is false
Statement (D) is FALSE.
Only statements (A) and (C) are true.
Related questions:
2025: 13 May Shift 2
2025: 26 May Shift 2
2025: 2 June Shift 1
2025: 19 May Shift 1