Q.Refer to Exercise 27. (Maximum value of Z + Minimum value of Z) is equal to
(A) 13
(B) 1
(C) −13
(D) −17
🔒You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
🔒 Start your 14-day free trial to unlock the full solution →Concept understanding — Linear Programming Graphical Method
The Graphical Method for Linear Programming
When a linear programming problem has just two decision variables, x and y, you can solve it by drawing a picture. This is the graphical method, and it is the technique the CBSE Class-12 course expects you to use.
The idea
Each constraint is a linear inequality such as 2x+3y≤100. On the xy-plane its boundary is a straight line, and the inequality picks one side of that line (a half-plane). The points that satisfy all the constraints at once form a single region — the feasible region. Your job is to find the point inside this region that makes the objective function Z=ax+by largest or smallest.
The step-by-step procedure
- Draw each constraint line. Replace every inequality by an equation and plot the line, usually by finding where it meets the axes.
- Shade the correct side. Test a simple point (often the origin (0,0)) in the inequality. If it holds, the origin's side is the wanted half-plane; if not, take the other side. Always include the non-negativity conditions x≥0, y≥0, which keep you in the first quadrant.
- Identify the feasible region. It is the overlap of all the shaded half-planes — the region satisfying every constraint together.
- Find the corner (vertex) points. These are the points where the boundary lines cross. Read them off the graph or solve the two relevant lines simultaneously.
- Evaluate Z at every corner and pick the largest value (for a maximum) or the smallest (for a minimum).
The whole method rests on the Corner-Point Theorem: if an optimum exists, it occurs at a vertex of the feasible region. So you never test interior points — only the corners.
Bounded vs unbounded …
Same Exercise-27 region — corners (0,0),(5,0),(6,5),(6,8),(4,10),(0,8) with Z=3x−4y.
Z(0,0)=0, Z(5,0)=15, Z(6,5)=−2, Z(6,8)=−14, Z(4,10)=−28, Z(0,8)=−32. …
Over the Exercise-27 region, Z=3x−4y has maximum 15 and minimum −32, so their sum is −17 — option (D).
The region and objective
Exercise 27 gives Z=3x−4y on the bounded region with corner points
(0,0), (5,0), (6,5), (6,8), (4,10), (0,8).
Because the region is bounded, both the maximum and the minimum exist and occur at vertices.
Evaluate Z=3x−4y at every corner
| Point | Z |
|---|---|
| (0,0) | 0 |
| (5,0) | 15 |
| (6,5) | −2 |
| (6,8) | −14 |
Method: Getting both the maximum and the minimum from corner points
When a question needs a combination such as (max + min) or (max − min), the efficient route is one clean pass over all vertices, extracting both extremes at once.
Steps
Step 1: Evaluate Z at every corner, once.
Z=ax+by
Build the full list of vertex values — for a bounded region both extremes are guaranteed to be in it (Corner Point Theorem).
Step 2: Pull out the largest and the smallest. …
Common Mistakes
Mistake 1: Computing only one extreme.
Why it's wrong: the question needs both Zmax and Zmin; stopping at the maximum loses the sum. Correct approach: make one pass over all corners and record both the largest and smallest values.
Mistake 2: Mishandling the sign when adding a negative minimum. …
- KEAM 2025Set eng-2025-04274 marksMCQQ.Consider the linear programming problem. Minimize z=x+y Subject to the constraint 2x+3y≥6, x≥0, y≥0. Then the solution of L.P.P. is (A) 0 (B) 2 (C) 3 (D) 5 (E) 6
›Reveal solutionSolution
Evaluating z=x+y at the corner points (3,0) and (0,2) of the feasible region gives the minimum value 2.
The constraints are 2x+3y≥6, x≥0, y≥0. The boundary line 2x+3y=6 meets the axes at (3,0) and (0,2); the feasible region is the unbounded region above this line in the first quadrant. …
- KEAM 2026Set eng-2026-04204 marksMCQQ.Consider the Linear Programming Problem (LPP): Maximize z=20x+40y subject to the constraints 3x+y≤14; x+3y≤10; x≥0; y≥0. The number of corner points of the feasible region is (A) 5 (B) 4 (C) 3 (D) 2 (E) 6
›Reveal solutionSolution
Find the vertices of the region bounded by the two lines and the axes.
Constraints: 3x+y≤14, x+3y≤10, x,y≥0.
- Origin: (0,0).
- x-axis intercept of 3x+y=14: (14/3,0).
- y-axis intercept of x+3y=10: (0,10/3). …
- KEAM 2026Set eng-2026-04194 marksMCQQ.Consider the Linear Programming Problem (LPP): Maximize z=30x+60y subject to the constraints x+2y≤12;2x+y≤12;4x+5y≥20;x≥0;y≥0. Then the number of corner points of the feasible region is (A) 8 (B) 6 (C) 3 (D) 4 (E) 5
›Reveal solutionSolution
Bounding the region by x+2y≤12, 2x+y≤12, 4x+5y≥20, x,y≥0 gives a pentagon with 5 corner points.
The constraint lines are L1:x+2y=12, L2:2x+y=12, L3:4x+5y=20, plus the axes.
Find the vertices of the feasible region (satisfying all constraints):
- L3∩x-axis: (5,0) — check: 5≤12, 10≤12 ✓
- L2∩x-axis: (6,0) — check: 24≥20, 6≤12 ✓
- L1∩L2: solving gives (4,4) — check: 36≥20 ✓
- L1∩y-axis: (0,6) — check: 6≤12, 30≥20 ✓ …
- KEAM 2022Set eng-2022-P2-B14 marksMCQQ.Consider the linear programming problem: Maximize z=10x+5y subject to the constraints 2x+3y≤120, 2x+y≤60, x,y≥0. Then the coordinates of the corner points of the feasible region are (A) (0,0),(30,0),(0,40) and (15,30) (B) (0,0),(60,0),(0,40) and (15,30) (C) (0,0),(30,0),(0,60) and (15,30) (D) (0,0),(30,0),(0,40) and (30,40) (E) (0,0),(60,0),(0,40) and (30,40)
›Reveal solutionSolution
The corner points are (0,0),(30,0),(0,40),(15,30).
Concept and Intuition
The feasible region is a polygon bounded by the constraint lines and axes; its vertices are the corner points.
Step-by-Step Solution
- Origin (0,0) is a corner.
- On y=0: 2x≤60 (binding) and 2x≤120, so x=30⇒(30,0).
- On x=0: 3y≤120 (binding) and y≤60, so y=40⇒(0,40).
- Intersect 2x+3y=120 and 2x+y=60: subtract to get 2y=60⇒y=30, then 2x=30⇒x=15, giving (15,30). …
- KEAM 2026Set eng-2026-04214 marksMCQQ.Which one of the following point is not in a feasible region bounded by the inequalities x≤4, y≤6, x+y≤6, x≥0, y≥0 (A) (0,0) (B) (4,0) (C) (4,2) (D) (0,6) (E) (6,0)
›Reveal solutionSolution
(6,0) violates x≤4, so it is the point not in the feasible region.
Constraints: x≤4, y≤6, x+y≤6, x≥0, y≥0.
- (0,0): all satisfied.
- (4,0): x=4≤4, x+y=4≤6 — OK.
- (4,2): x=4, y=2, x+y=6≤6 — OK. …
🎓Unlock everything free for 14 days
- ✓Full step-by-step solutions
- ✓Concept-first explanations
- ✓Methods, shortcuts & mistakes
- ✓PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.