Q.Minimise Z=13x−15y subject to the constraints: x+y≤7, 2x−3y+6≥0, x≥0, y≥0.
🔒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 …
Concept: Linear Programming Graphical Method – we minimise Z over the feasible region defined by the constraints.
Step 1 – Plot constraints
x+y≤7 is a line through (7,0) and (0,7), shaded below.
2x−3y+6≥0 rearranges to y≤32x+6, a line through (−3,0) and (0,2), shaded below it.
x≥0, y≥0 restrict to the first quadrant.
Step 2 – Find corner points
Intersection of x+y=7 and 2x−3y+6=0: solving gives x=3, y=4.
Other corners: (0,0), (7,0), (0,2).
Check (0,0) satisfies all constraints. …
The minimum value is Z=−30, attained at the corner point (0,2).
Concept. A linear objective over a bounded polygonal feasible region attains its optimum at a vertex, so we list the corner points and evaluate Z at each.
Constraints: x+y≤7,2x−3y+6≥0 (i.e. 2x−3y≥−6),x≥0, y≥0.
Corner points of the feasible region:
- (0,0)
- (7,0) - where x+y=7 meets the x-axis
- (3,4) - where x+y=7 meets 2x−3y=−6
- (0,2) - where 2x−3y=−6 meets the y-axis …
Method: Corner-Point Minimisation with a Negative Coefficient
Use this to minimise a linear objective such as Z=ax−by (one coefficient negative) over a bounded region — the negative sign changes where the optimum lands but not the method.
Steps
Step 1: Plot the constraints and shade the feasible region.
Rewrite each inequality as an equation, draw the lines via intercepts, and use the origin test to keep the correct side. Watch a constraint written as 2x−3y+6≥0: rearrange to 2x−3y≥−6 before testing.
Step 2: Find the corner points, keeping only feasible intersections. …
Common Mistakes
Mistake 1: Sign errors when evaluating Z=13x−15y.
Why it's wrong: the −15y term makes larger y decrease Z; mishandling the sign flips which corner looks smallest. At (0,2), Z=0−30=−30 (the minimum), while (7,0) gives +91. Correct approach: substitute carefully with the negative coefficient and compare signed values.
Mistake 2: Treating (0,7) as a corner. …
- Higher Secondary (+2 Stage) Examination 2025Set ANNUAL5 marksQ.Solve the following linear programming problem graphically: Find the maximum and minimum value of Z, where Z=x+2y, subject to the constraints: x+2y≥100, 2x−y≤0, 2x+y≤200, x≥0, y≥0.
›Reveal solutionSolution
Plot the feasible region from the four constraints, find its corner points, then evaluate Z=x+2y at each corner — the maximum/minimum of a linear objective over a bounded polygon always occurs at a corner.
Constraints: x+2y≥100, 2x−y≤0 (i.e. y≥2x), 2x+y≤200, x≥0, y≥0.
Finding the corner points by intersecting the boundary lines in pairs:
- x=0 with x+2y=100: gives (0,50).
- x+2y=100 with y=2x: substituting, x+4x=100⇒x=20,y=40: gives (20,40).
- y=2x with 2x+y=200: substituting, 2x+2x=200⇒x=50,y=100: gives (50,100).
- 2x+y=200 with x=0: gives (0,200).
(One can check each of these four points satisfies all the constraints simultaneously, and that they are the actual vertices of the bounded feasible region — a quadrilateral.)
Evaluating Z=x+2y at each corner:
Corner Z=x+2y (0,50) 0+100=100 (20,40) 20+80=100 (50,100) 50+200=250 (0,200) 0+400=400 … - Higher Secondary (+2 Stage) Examination 2023Set ANNUAL5 marksQ.A businessman plans to sell two types of special computers: a desktop model and a portable model, whose current prices are Rs 25,000 and Rs 40,000 respectively. He estimates that the total monthly demand for computers will not exceed 250 units. If the profit is Rs 4,500 on each desktop model and Rs 5,000 on each portable model, and he does not want to invest more than Rs 70,00,000 (seventy lakh rupees) in total, determine, by the graphical method, how many units of each type of computer the businessman should stock to obtain the maximum profit. What is the maximum profit?
›Reveal solutionSolution
This is a linear programming problem: set up the demand and investment constraints, plot the feasible region, and evaluate the profit at each corner point — the maximum occurs at (200,50) giving a profit of Rs 11,50,000.
Let x = number of desktop models, y = number of portable models to stock.
Objective (maximize profit): Z=4500x+5000y
Constraints:
- Demand: x+y≤250
- Investment: 25000x+40000y≤70,00,000, which simplifies (dividing by 5000) to 5x+8y≤1400
- Non-negativity: x≥0, y≥0
Corner points of the feasible region:
- (0,0)
- x-intercept of demand line: (250,0) — check investment: 5(250)=1250≤1400 ✓, so this is a genuine corner.
- y-intercept of investment line: 8y=1400⇒y=175, giving (0,175) — check demand: 175≤250 ✓ (this is the binding constraint here, since the demand line would allow y=250 but investment caps it at 175).
- Intersection of x+y=250 and 5x+8y=1400: from the first, x=250−y; substitute: 5(250−y)+8y=1400⇒1250+3y=1400⇒y=50, x=200. Point: (200,50). …
🎓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.