Published by:
CGP EDU Academic Team
Published on: August 12, 2026
Maximize 
, subject to 
, 
.
A
59 at 
B
42 at 
C
49 at 
D
57.2 at 
Text Solution
Verified by ExpertsThe correct answer is:
A
: We have, maximize 
Subject to 
Let 
Solving 
and 
, we get 
Shaded portion 
is the feasible region, where 
.
Now maximize 
at 
at 
at 
at 
Thus, 
is maximized at 
and its maximum
value is 59 .
──────────────────────────────────────────────────────────────────────────────────────────
Prepare Smarter with CGP Edu
Get practice questions, solutions, and test series in one place.
Write a Review
Share your experience with this question and solution.
Commentary
Send your comment, doubt, correction, or feedback to admin.
Similar Questions
Explore conceptually related problems
In solving the LPP : "minimize subject to constraints , " redundant constraints are
The shaded part of given figure indicates the feasible region
then the constraints are
The objective function , subject to has maximum value of the feasible region.
The objective function , subject to has minimum value at the point
The objective function of LPP defined over the convex set attains its optimum value at
The maximum value of subject to and is