SEE Optional Maths Unit 3: Linear Programming - Notes and Exam Questions

Linear Programming is Unit 3 of Grade 10 Optional Mathematics (CDC textbook, first edition 2083, pages 26-35, sections 3.1 to 3.4); it covers linear inequalities and their graphs, systems of linear inequalities and their feasible regions, and the graphical method of finding the maximum or minimum value of an objective function at the corners of a feasible region, so most of its questions are answered with a graph. In the CDC 2083 model paper the unit carries one 2-mark sub-part; all examples and questions below use original numbers and original figures.

Unit at a glance

ItemDetails
Marks in SEE 2083The CDC specification grid gives marks by content area, not by chapter: Algebra (Units 1 to 6 together) has 17 of the 75 marks. In the CDC 2083 model paper this unit appears once, as sub-part Q4 (c) for 2 marks: the feasible region of two "\( \le \)" inequalities together with \( x \ge 0 \) and \( y \ge 0 \). The model's marking scheme gives 1 mark for drawing the lines correctly and 1 mark for finding and shading the feasible region. This is a count made for this blog from one model paper, not a fixed quota, so the real paper may differ.
SEE 2081 and 2082 (sets A and B)Each of the four papers reviewed had one question from this unit. Three of them (2081 A, 2081 B, 2082 A) asked for the graph of one linear inequality in \( x \) and \( y \) for 2 marks. One (2082 B) asked for the maximum value of an objective function under two constraints and \( x, y \ge 0 \) for 3 marks.
New-pattern items (CDC model)The question is a sub-part of a "within content area" question that it shares with another Algebra unit (in the model, the other sub-parts were on matrices). The graph is drawn by the candidate, so a pencil, a ruler and accurate graph work are needed in the exam.
Frequent in the papers reviewedDrawing a boundary line from two points and shading the correct side (topic 3.2), and showing the common (feasible) region of two or more inequalities (topic 3.3). Finding the maximum or minimum at the corner points came once in the four old papers, and it is a full section of the 2083 textbook (topic 3.4), so it must be prepared as well.
Note on the new patternCDC has issued a new specification grid (dated 2082) and a Grade 10 model paper (2083) to match the new textbook. The new Grade 10 textbook is a first edition dated 2083, so SEE 2083 is expected to be the first SEE based on it; this is an inference from the dates of the textbook and the model paper, not an official notice. At the last check (6 November 2026) no separate NEB notice about the paper format was found. This means only that none was found; the NEB website (neb.gov.np) should be checked for any update before the exam.
Skills to prepare(1) Turning words into an inequality; (2) drawing the graph of one inequality; (3) shading the feasible region of a system and finding its corners; (4) finding the maximum and minimum of \( Z = ax + by \) at the corners; (5) working backwards from a shaded graph to its inequalities, and then finding the maximum or minimum on that region.

3.1 Introduction

(What is linear programming? Define linear programming.)

Linear programming (LP) is a mathematical method of finding the maximum or the minimum value of a linear function of the variables (the objective function) when the variables must satisfy a set of linear inequalities (the constraints).

  1. Only points that satisfy every constraint are allowed; the best of them gives, for example, the greatest profit or the least cost.
  2. The conditions usually describe limited resources, such as money, time, land, labour or material.
  3. In Grade 10 only the graphical method is used (topic 3.4).

(Who developed linear programming? Write a short note on its history.)

  1. The method was first worked out by the Soviet mathematician Leonid Kantorovich in 1939 to plan production with limited resources.
  2. In 1947 the American mathematician George B. Dantzig devised the simplex method for solving such problems, and he is widely remembered as the founder of the whole subject.
  3. Kantorovich later shared the 1975 Nobel Prize in Economics for this kind of work. Some books place the year 1975 beside Dantzig; his simplex method dates from 1947, and 1975 is the year of Kantorovich's Nobel Prize.

(Name the methods of solving a linear programming problem. Which method is used in Grade 10?)

A linear programming problem can be solved by the graphical method or by the simplex method. The simplex method is beyond the Grade 10 course; the textbook uses only the graphical method, in which the conditions are drawn on a graph and the best point is found at a corner of the common region.

3.2 Linear Inequalities

(What is a linear inequality? Give examples in one and two variables.)

A linear inequality is a statement that uses one of the signs \( \lt,\ \gt,\ \le,\ \ge \) and in which each variable appears only to the power 1, with no \( x^2 \), \( y^2 \) or \( xy \) terms. A linear inequality in two variables can be put in one of the forms \( ax + by \lt c,\ ax + by \gt c,\ ax + by \le c \) or \( ax + by \ge c \), where \( a, b, c \) are real constants and \( a \) and \( b \) are not both zero.

  • In two variables: \( 2x + 3y \le 18 \).
  • In one variable: \( x \ge 4 \).

Writing a statement as an inequality

(How is a statement in words written as an inequality? Which signs are used for "at most", "at least", "more than" and "less than"?)

Each phrase of a limit is matched with a sign:

Words in the questionSignExample
at most, not more than, maximum, cannot exceed\( \le \)"at most 45 seats": \( x \le 45 \)
at least, not less than, minimum\( \ge \)"at least 35 marks": \( x \ge 35 \)
more than, exceeds, above\( \gt \)"more than Rs 500": \( x \gt 500 \)
less than, below, fewer than\( \lt \)"fewer than 8 hours": \( x \lt 8 \)

The words "maximum" and "minimum" give a sign only when they state a limit: "a maximum of 45 seats" means \( x \le 45 \), and "a minimum of 35 marks" means \( x \ge 35 \). In "find the maximum profit", the word names the quantity to be made as large as possible (the objective function, topic 3.4); it is not a constraint, and reading it as a sign is an error.

(State the rules for simplifying a linear inequality. What happens to the sign when both sides are multiplied or divided by a negative number?)

  1. The same number may be added to or subtracted from both sides without changing the sign.
  2. Both sides may be multiplied or divided by the same positive number without changing the sign.
  3. If both sides are multiplied or divided by a negative number, the sign reverses. For example, \( -2x \le 6 \) becomes \( x \ge -3 \) after dividing by \( -2 \). Failing to reverse the sign is a common error.

Worked example 1 (statement to inequality)

(Anita has 600 minutes for homework over the weekend. A maths worksheet takes her 40 minutes and a science worksheet takes 20 minutes. She plans \( x \) maths worksheets and \( y \) science worksheets and cannot work for longer than the time she has. Write this as an inequality in its simplest form, together with the conditions that the numbers cannot be negative.)

Solution: The maths worksheets need \( 40x \) minutes and the science worksheets need \( 20y \) minutes. "Cannot work for longer than 600 minutes" means that the total time is at most 600:

\[ 40x + 20y \le 600 \]

Dividing both sides by the positive number 20 (the sign stays the same):

\[ 2x + y \le 30,\qquad x \ge 0,\quad y \ge 0 \]

Here \( x \) and \( y \) count worksheets, so they are also whole numbers.

Boundary line, solution region and test point

(What is a boundary line? What is the solution region (half-plane) of an inequality?)

  1. Boundary line: the straight line obtained by changing the inequality sign to "=". For \( 2x + 3y \le 18 \) it is \( 2x + 3y = 18 \). It divides the plane into two halves.
  2. Solution region (half-plane): the set of all points \( (x, y) \) that make the inequality true. On a graph it is one side of the boundary line, and it is shaded.

(When is the boundary line drawn solid and when is it drawn dotted? Give reason.)

Following the CDC textbook convention, the boundary is drawn as a solid line for \( \le \) or \( \ge \), because points on the line satisfy the inequality and are included. It is drawn as a dotted (broken) line for \( \lt \) or \( \gt \), because points on the line do not satisfy the inequality and are not included.

(What is a test point? Why can a point on the boundary line not be used as a test point?)

A test point is any point that is not on the boundary line, substituted into the inequality to decide which side to shade: if the result is true, its side is shaded; if false, the other side is shaded. The origin \( O(0, 0) \) is the usual choice when the line does not pass through it. A point on the line lies on neither side of it, so substituting it cannot show which side is the solution region. If the line passes through the origin, another point such as \( (1, 0) \) or \( (0, 1) \) is tested (Worked example 3 (b)).

Graph of a linear inequality in one variable

(Show the graphs of inequalities such as \( x \ge 2 \) and \( y \lt 3 \). Which region do \( x \ge 0 \) and \( y \ge 0 \) represent together?)

\( x = 2 \) is a vertical line through \( (2, 0) \), and \( y = 3 \) is a horizontal line through \( (0, 3) \). Hence:

  • \( x \ge 2 \) is the solid line \( x = 2 \) and every point to its right.
  • \( y \lt 3 \) is every point below the dotted line \( y = 3 \).
  • \( x \ge 0 \) is the \( y \)-axis and every point to its right; \( y \ge 0 \) is the \( x \)-axis and every point above it. Together they give the first quadrant, including both axes.
Two graphs side by side on square grids from minus 2 to 5. Left graph, titled x greater than or equal to 2: a solid blue vertical line through x equals 2, with the part to the right of it shaded. Right graph, titled y less than 3: a dotted red horizontal line through y equals 3, with the part below it shaded.

Figure 1: One-variable inequalities. A solid line belongs to the region; a dotted line does not.

Graph of a linear inequality in two variables

(Write the steps to draw the graph of a linear inequality in two variables.)

  1. Boundary line. The inequality sign is replaced with "=". This gives the straight line that splits the plane into two halves.
  2. Two points. Two points on that line are found. The quickest are the intercepts: \( x = 0 \) gives \( y \), and \( y = 0 \) gives \( x \); they are shown in a small table, with the working for both points. Signs need care: in \( 3x - 2y = 6 \), \( x = 0 \) gives \( y = -3 \), not 3. The intercepts do not give two different points if the line passes through the origin (there is no number term, as in \( x - 2y = 0 \)) or is parallel to an axis (as in \( y = 3 \)). Another suitable value is then chosen and the matching point is calculated (Worked example 3 (b)): for \( y = k \), two different values of \( x \) are taken, and for \( x = k \), two different values of \( y \), for example \( (2, 0) \) and \( (2, 3) \) on \( x = 2 \).
  3. Draw. The points are joined with a solid line (\( \le, \ge \)) or a dotted line (\( \lt, \gt \)), and the line is extended across the graph.
  4. Test point. Any point off the line (usually \( O(0, 0) \)) is substituted into the inequality, and the result ("true" or "false") is written in the answer.
  5. Shade. If the result is true, the side containing the test point is shaded. If it is false, the opposite side is shaded.

Recommended graph presentation. The CDC model's scheme gives its marks for correctly drawn lines and the correct region; the points below help the examiner see that both are right. (1) Both axes are drawn with a ruler, \( O \) is marked and the axes are labelled \( x \) and \( y \). (2) An even scale is used and numbers are written on both axes. (3) The equation is written beside each line. (4) Each line is solid or dotted to match its sign. (5) The test-point working is shown next to the graph. (6) The shading is clear; for a system, only the common region is shaded and it is labelled.

Worked example 2 (graph of one inequality)

(Draw the graph of \( 3x + 2y \le 12 \).)

Solution: The boundary line is \( 3x + 2y = 12 \).

\( x \)04
\( y \)60

(Putting \( x = 0 \): \( 2y = 12 \), so \( y = 6 \). Putting \( y = 0 \): \( 3x = 12 \), so \( x = 4 \).) The sign is \( \le \), so \( (0, 6) \) and \( (4, 0) \) are joined with a solid line.

Test point \( O(0, 0) \): \( 3(0) + 2(0) = 0 \), and \( 0 \le 12 \) is true. So the side of the line that contains the origin is shaded (Figure 2). No \( x \ge 0 \) or \( y \ge 0 \) is given here, so the shaded half-plane also covers parts of the other quadrants, and it does not stop at the edge of the graph paper: it continues beyond it.

Graph on a square grid from minus 2 to 8 on both axes. A solid blue line passes through (0, 6) and (4, 0) and is labelled 3x plus 2y equals 12. The side of the line containing the origin is shaded. A note says: test point O(0, 0), 3 times 0 plus 2 times 0 equals 0, which is less than or equal to 12, true, so shade the side with O. The unshaded side is labelled 3x plus 2y greater than 12.

Figure 2: The graph of \( 3x + 2y \le 12 \). The origin satisfies the inequality, so its side is shaded.

Worked example 3 (strict inequality; line through the origin)

(Draw the graphs of (a) \( 2x - y \gt 4 \) and (b) \( x - 2y \ge 0 \).)

Solution:

(a) Boundary line \( 2x - y = 4 \). Putting \( x = 0 \): \( -y = 4 \), so \( y = -4 \). Putting \( y = 0 \): \( 2x = 4 \), so \( x = 2 \). The points are \( (0, -4) \) and \( (2, 0) \). The sign is \( \gt \), so the line is dotted. Test \( O(0, 0) \): \( 2(0) - 0 = 0 \), and \( 0 \gt 4 \) is false. So the side that does not contain the origin is shaded.

(b) Boundary line \( x - 2y = 0 \). Putting \( x = 0 \) gives \( y = 0 \), so the line passes through the origin, and the intercept method gives only one point. Another \( x \) is chosen: if \( x = 4 \), then \( 4 - 2y = 0 \), so \( y = 2 \). The points \( (0, 0) \) and \( (4, 2) \) are joined with a solid line (the sign is \( \ge \)). The origin is on the line, so it cannot be a test point. The point \( (2, 0) \) is used instead: \( 2 - 2(0) = 2 \), and \( 2 \ge 0 \) is true. So the side containing \( (2, 0) \) is shaded.

Two graphs side by side. Left, titled 2x minus y greater than 4: a dotted red line through (0, minus 4) and (2, 0); the side away from the origin, to the lower right, is shaded; a note says O gives 0 greater than 4, false, shade the other side. Right, titled x minus 2y greater than or equal to 0: a solid green line through the origin and (4, 2); a purple test point at (2, 0) lies in the shaded region below the line; a note says (2, 0) gives 2 greater than or equal to 0, true.

Figure 3: (a) a strict inequality with a dotted line, where the origin fails the test; (b) a line through the origin, tested with the point \( (2, 0) \).

(How can the side to be shaded be checked by making \( y \) the subject?)

This cross-check is optional. The inequality is solved for \( y \); a negative multiplier or divisor turns the sign round. Then "\( y \lt \)" or "\( y \le \)" means the region below the line, and "\( y \gt \)" or "\( y \ge \)" means the region above it. In Worked example 3 (a): \( 2x - y \gt 4 \Rightarrow -y \gt 4 - 2x \Rightarrow y \lt 2x - 4 \) (sign reversed after multiplying by \( -1 \)), so the region is below the line, which agrees with the test point. The check needs the \( y \)-term, so it does not work for a vertical line such as \( x = 2 \).

3.3 System of Linear Inequalities

(What is a system of linear inequalities? Define feasible region.)

A system of linear inequalities is a group of two or more linear inequalities, all of which have to hold together for the same \( x \) and \( y \). The feasible region of the system is the overlap of the solution regions of its inequalities; every point in it satisfies every inequality. The textbook also calls it the common solution region.

  1. All the inequalities are drawn on one graph. The correct side of each line is marked with small arrows (as the textbook does), and then only the common part is shaded and labelled; shading every half-plane separately makes the graph hard to read.
  2. A feasible region is always convex: it has no dents, so the straight segment joining any two of its points stays inside it. In the textbook's linear programming example (Section 3.4) it is a convex polygon.
  3. A region that can be enclosed within a circle of finite size is called bounded. The optimisation example of Section 3.4 has a bounded region, but a system can also have an unbounded region, as in the textbook's Section 3.3 example with two slanting lines and no \( x \ge 0 \) or \( y \ge 0 \) (see unbounded feasible region).

(How are the boundary lines of a system with mixed signs drawn? When does a system have no feasible region?)

In a system, each line keeps its own style. A line from \( \lt \) or \( \gt \) is dotted and its points are not in the region; a line from \( \le \) or \( \ge \) is solid, because equality is allowed for that constraint, and its points belong to the feasible region only where they also satisfy every other inequality. If no point satisfies all the inequalities, there is no feasible region and the system has no solution (exam question Q9).

Corner points of a feasible region

(What is a corner point (vertex) of a feasible region? How are the corner points found?)

A corner point (vertex) is a point of the feasible region where two of its boundary lines meet. These lines may be slanting, vertical (\( x = k \)), horizontal (\( y = k \)) or an axis.

  1. An axis counts as a boundary line only when it is an edge of the region, for example when \( x \ge 0 \) or \( y \ge 0 \) is given. Where a line crosses an axis that is not a boundary, there is no corner (in Worked example 5, line \( l \) crosses the \( y \)-axis at \( (0, 4) \), but \( (0, 4) \) is not a corner). Without \( x \ge 0 \) or \( y \ge 0 \), the region can cross the axes (Worked example 5 and exam question Q15).
  2. The meeting point of two lines is found by solving their two equations together (elimination or substitution), not by reading it from the graph by eye; the result is then checked on both lines.
  3. Every candidate corner is checked in all the inequalities. A meeting point or intercept that breaks another inequality is not a corner.
  4. The origin can be a corner only when it satisfies every constraint, and even then it is a corner only if two edges of the region meet there; it is not a corner in every problem (exam question Q20). In exam question Q15 the origin satisfies both inequalities but lies inside the region, so it is not a corner.
  5. A corner with fractions is kept exact, for example \( \left(\frac{3}{2}, \frac{9}{2}\right) \), until the final answer (exam question Q22).

Worked example 4 (feasible region and its corners)

(Show the feasible region of \( x + y \le 7,\ 3x + y \le 15,\ x \ge 0,\ y \ge 0 \) and find its corner points.)

Solution:

Line 1: \( x + y = 7 \)

\( x \)07
\( y \)70

Line 2: \( 3x + y = 15 \). The \( y \)-intercept \( (0, 15) \) is far up the graph, so two other points are chosen; any two points on the line will do: if \( x = 5 \), \( y = 0 \); if \( x = 3 \), \( y = 15 - 9 = 6 \).

\( x \)53
\( y \)06

Both signs are \( \le \), so both lines are solid. Test \( O(0, 0) \): \( 0 \le 7 \) is true and \( 0 \le 15 \) is true, so for both lines the origin side is the correct side. \( x \ge 0,\ y \ge 0 \) restrict the region to the first quadrant.

Corner where the two lines cross: line 1 is subtracted from line 2.

\[ (3x + y) - (x + y) = 15 - 7 \]

\[ 2x = 8 \;\Rightarrow\; x = 4 \]

\[ y = 7 - x = 7 - 4 = 3 \]

So the lines meet at \( (4, 3) \). The feasible region is the quadrilateral \( OABC \) with corners \( O(0, 0),\ A(5, 0),\ B(4, 3),\ C(0, 7) \).

Why \( (7, 0) \) and \( (0, 15) \) are not corners. At \( (7, 0) \): \( 3(7) + 0 = 21 \), and \( 21 \le 15 \) is false. At \( (0, 15) \): \( 0 + 15 = 15 \), and \( 15 \le 7 \) is false. Each of these points breaks the other inequality, so neither is a corner.

Graph on a square grid from minus 1 to 9 on both axes. A solid blue line x plus y equals 7 passes through (0, 7) and (7, 0). A solid red line 3x plus y equals 15 passes through (3, 6) and (5, 0). The shaded feasible region in the first quadrant has corners O(0, 0), A(5, 0), B(4, 3) and C(0, 7). The points (7, 0) and (3, 6) are marked with small crosses because they are only plotting points, not corners.

Figure 4: The feasible region of Worked example 4. Small crosses mark plotting points; they are not corners.

Inequalities from a shaded graph

(How are the inequalities of a given shaded region found from its graph?)

For each boundary line:

  1. Two points on it are read. If it cuts the \( x \)-axis at \( (a, 0) \) and the \( y \)-axis at \( (0, b) \), with \( a \ne 0 \) and \( b \ne 0 \), its equation is the intercept form \[ \frac{x}{a} + \frac{y}{b} = 1. \] If a non-vertical line passes through the origin, its equation is \( y = mx \): one more point \( (p, q) \) on it, with \( p \ne 0 \), is read and \( m = \dfrac{q}{p} \) is used. For example, through \( (4, 1) \): \( m = \dfrac{1}{4} \), so \( y = \dfrac{x}{4} \), that is, \( x - 4y = 0 \). A vertical line through \( (k, 0) \) is \( x = k \) (so the vertical line through the origin is \( x = 0 \), the \( y \)-axis), and a horizontal line through \( (0, k) \) is \( y = k \).
  2. The fractions are cleared to get the form \( px + qy = r \).
  3. A test point clearly inside the shaded region (not on any line) is chosen, and \( px + qy \) is worked out there to decide whether the region has \( \le \) or \( \ge \) (or \( \lt,\ \gt \) for a dotted line).

Worked example 5 (inequalities from a graph)

(In Figure 5, the shaded triangle is bounded by line \( l \), line \( m \) and the \( x \)-axis, and all boundary lines are solid. Find the three inequalities and the top corner R.)

Graph on a square grid with x from minus 3 to 8 and y from minus 1 to 8. A solid green line l passes through (minus 2, 0) and (0, 4). A solid blue line m passes through (7, 0) and (0, 7). The shaded triangle above the x-axis is bounded by line l, line m and the x-axis, with corners (minus 2, 0), (7, 0) and a top corner labelled R. The points (0, 4) and (0, 7) are also marked.

Figure 5: Find the inequalities of the shaded triangle (Worked example 5).

Solution: The test point \( (1, 1) \) is taken; it is clearly inside the triangle.

  • Line \( l \) cuts the axes at \( (-2, 0) \) and \( (0, 4) \): \[ \frac{x}{-2} + \frac{y}{4} = 1 \] Multiplying by 4: \( -2x + y = 4 \), that is, \( 2x - y = -4 \). At \( (1, 1) \): \( 2(1) - 1 = 1 \), and \( 1 \ge -4 \). So the inequality is \( 2x - y \ge -4 \).
  • Line \( m \) cuts the axes at \( (7, 0) \) and \( (0, 7) \): \[ \frac{x}{7} + \frac{y}{7} = 1 \;\Rightarrow\; x + y = 7 \] At \( (1, 1) \): \( 1 + 1 = 2 \), and \( 2 \le 7 \). So the inequality is \( x + y \le 7 \).
  • The region lies on and above the \( x \)-axis: \( y \ge 0 \).

Answer: \( 2x - y \ge -4,\quad x + y \le 7,\quad y \ge 0 \).

Corner R: adding the two equations \( 2x - y = -4 \) and \( x + y = 7 \) gives \( 3x = 3 \), so \( x = 1 \) and \( y = 7 - 1 = 6 \). So R is \( (1, 6) \).

There is no \( x \ge 0 \) here, because part of the region lies to the left of the \( y \)-axis. \( x \ge 0 \) or \( y \ge 0 \) is written only when the graph (or the question) shows it. For the same reason, \( (0, 4) \), where line \( l \) crosses the \( y \)-axis, is only a point on an edge, not a corner.

3.4 Solution of Linear Programming Problems

(Define objective function, constraints and non-negativity constraints.)

  1. Objective function: the linear expression whose largest or smallest value is required, for example a profit \( P = 400x + 300y \) or a cost \( C = 5x + 4y \).
  2. Constraints: the conditions of the problem written as inequalities, such as limits on money, time or material.
  3. Non-negativity constraints: \( x \ge 0 \) and \( y \ge 0 \). They state that quantities such as numbers of items cannot be negative. Together they keep the region in the first quadrant (including the axes).

A linear programming problem therefore has constraints and an objective function \( Z = ax + by \), and the aim is the largest (maximum) or smallest (minimum) value of \( Z \) among all points of the feasible region.

(State the corner-point rule. Where do the maximum and minimum values of an objective function occur?)

Suppose the feasible region is a convex polygon that is bounded (it can be enclosed within a circle of finite size) and includes its edges (every sign is \( \le \) or \( \ge \), as in the textbook's linear programming problems). Then \( Z = ax + by \) has a maximum and a minimum value on the region, and each of them occurs at a corner point. So only the corners need to be tested. If two neighbouring corners give the same maximum (or minimum), every point on the edge joining them gives that value too, and the answer must state this tie (exam question Q18).

(Why does the maximum or minimum value of \( Z = ax + by \) occur at a corner point?)

Consider \( Z = 4x + 3y \) on the region of Worked example 4 (Figure 6). Every line \( 4x + 3y = k \) has the same slope, so these lines are parallel. As \( k \) grows, the line slides away from the origin. The largest \( k \) for which the line still touches the region is reached at the last point it touches. That last contact is a corner (here B) or, if the line is parallel to an edge, the whole edge together with its two end corners (exam question Q18). In the same way, the smallest value is where the line first meets the region, again at a corner (or along an edge).

The feasible region of Worked Example 4 with grey boundary lines and corners O, A, B and C. Two parallel purple dashed lines are drawn: 4x plus 3y equals 12, which cuts through the region, and 4x plus 3y equals 25, which touches the region only at B(4, 3). An arrow labelled Z grows points from the first line towards the second. The corners are labelled O: Z equals 0, A: Z equals 20, B: Z equals 25 (max), C: Z equals 21.

Figure 6: Parallel lines \( 4x + 3y = k \). The last point of the region that a line touches as \( k \) increases is the corner B.

(Write the steps to solve a linear programming problem by the graphical method.)

  1. Every constraint is drawn on the same graph (boundary line, test point, correct side).
  2. The feasible region, the part common to all of them, is shaded.
  3. The coordinates of every corner are found (crossing points are calculated, not read by eye).
  4. A table is made of each corner and the value of \( Z \) there.
  5. The largest value in the table is the maximum and the smallest is the minimum. The answer is written with the point where it occurs and, in a word problem, with units: for example "maximum profit Rs 2800 a day, from 4 chairs and 4 stools", not only "2800".

Worked example 6 (maximum and minimum at the corners)

(Points \( (x, y) \) must satisfy \( x + y \le 7,\ 3x + y \le 15,\ x \ge 0,\ y \ge 0 \). Over all such points, what are the greatest and the least value of \( Z = 4x + 3y \)?)

Solution: The feasible region was drawn in Worked example 4 (Figure 4). Its corners are \( O(0, 0),\ A(5, 0),\ B(4, 3),\ C(0, 7) \).

Corner\( Z = 4x + 3y \)
\( O(0, 0) \)\( 4(0) + 3(0) = 0 \)
\( A(5, 0) \)\( 4(5) + 3(0) = 20 \)
\( B(4, 3) \)\( 4(4) + 3(3) = 16 + 9 = 25 \)
\( C(0, 7) \)\( 4(0) + 3(7) = 21 \)

Maximum \( Z = 25 \) at \( B(4, 3) \). Minimum \( Z = 0 \) at \( O(0, 0) \).

Forming a linear programming problem from a word problem

(How is a word problem written as a linear programming problem?)

  1. The variables are named with their units.
  2. One inequality is written for each limited resource (land, labour, money, time).
  3. \( x \ge 0,\ y \ge 0 \) are added.
  4. The objective function is written.
  5. The problem is solved by the corner-point method and the answer is given in words with units.

When \( x \) and \( y \) count things (worksheets, people, chairs), they must also be whole numbers. In every counting problem in this post the best corner has whole-number coordinates. If a counting problem ever gives a best corner with fractions, more checking is needed (this is beyond the Grade 10 course); the corner is not simply rounded, because rounding can break a constraint.

Worked example 7 (word problem: farm planning)

(A farmer has 10 hectares of land for wheat and maize. Each hectare of wheat needs 4 days of labour and each hectare of maize needs 2 days, and only 32 days of labour are available. The profit is Rs 30,000 per hectare of wheat and Rs 20,000 per hectare of maize. How many hectares of each crop give the greatest profit?)

Solution: Let \( x \) hectares be wheat and \( y \) hectares be maize.

  • Land: \( x + y \le 10 \)
  • Labour: \( 4x + 2y \le 32 \), which simplifies (dividing by 2) to \( 2x + y \le 16 \)
  • Non-negativity: \( x \ge 0,\ y \ge 0 \)
  • Objective: maximise \( P = 30000x + 20000y \) (rupees)

Lines: \( x + y = 10 \) through \( (10, 0) \) and \( (0, 10) \); \( 2x + y = 16 \) through \( (8, 0) \) and \( (0, 16) \). The origin satisfies both, so the region is on the origin side of each line. Crossing point: subtracting, \( (2x + y) - (x + y) = 16 - 10 \), so \( x = 6 \) and \( y = 4 \). Checking the intercepts: \( (10, 0) \) gives \( 2(10) = 20 \gt 16 \), and \( (0, 16) \) gives \( 16 \gt 10 \), so neither is a corner. The corners are \( O(0, 0),\ (8, 0),\ (6, 4),\ (0, 10) \). The graph is part of the answer (Figure 7).

Graph with the x axis labelled x (wheat, ha) and the y axis labelled y (maize, ha), numbered in steps of 2, x from 0 to 12 and y from 0 to 16. A solid blue line x plus y equals 10 (land) passes through (0, 10) and (10, 0). A solid red line 2x plus y equals 16 (labour) passes through (0, 16) and (8, 0). The shaded feasible region has corners O, (8, 0), (6, 4) and (0, 10). Small crosses mark the plotting points (10, 0) and (0, 16), which are not corners.

Figure 7: Feasible region for Worked example 7. Small crosses mark plotting points that are not corners.

Corner\( P = 30000x + 20000y \) (Rs)
\( (0, 0) \)0
\( (8, 0) \)2,40,000
\( (6, 4) \)1,80,000 + 80,000 = 2,60,000
\( (0, 10) \)2,00,000

The greatest profit is Rs 2,60,000, from 6 hectares of wheat and 4 hectares of maize. (All 10 hectares and all 32 labour days are used.)

Unbounded feasible region (optimisation on it goes beyond the textbook examples)

(What is an unbounded feasible region? Does an objective function always have both a maximum and a minimum on it?)

A feasible region that cannot be enclosed within any circle of finite size is called unbounded: it continues without end in some direction. This often happens with \( \ge \) constraints, though not always. (Unbounded refers to size, not to the edges: with \( \le \) or \( \ge \) signs the edges are still included.) On an unbounded region the maximum, the minimum or both may fail to exist, and for some objective functions both still exist; being unbounded does not by itself decide either value, so the answer must state which value exists and why.

Example. Minimise \( C = 5x + 4y \) subject to \( x + y \ge 5,\ x + 3y \ge 9,\ x \ge 0,\ y \ge 0 \). The lines cross where \( (x + 3y) - (x + y) = 9 - 5 \), so \( y = 2,\ x = 3 \). The corners are \( (9, 0),\ (3, 2),\ (0, 5) \), giving \( C = 45,\ 23,\ 20 \). The minimum is \( C = 20 \) at \( (0, 5) \). This is truly the least value: \( C = 5x + 4y = 4(x + y) + x \), and in the region \( x + y \ge 5 \) and \( x \ge 0 \), so \( C \ge 4(5) + 0 = 20 \), while the point \( (0, 5) \) gives exactly 20. A short reason of this kind is always given for an unbounded region, because the corner-point rule above is stated for bounded regions. There is, however, no maximum: for example \( (100, 0) \) is feasible and gives \( C = 500 \), and points further out give even more.

Quick revision

IdeaKey point
Boundary lineThe sign is changed to "=" and two points are plotted (intercepts are quickest, unless the line passes through the origin or is parallel to an axis).
Line styleSolid for \( \le,\ \ge \); dotted for \( \lt,\ \gt \).
Test pointAny point off the line (usually the origin). True: its side is shaded. False: the other side is shaded.
\( x \ge 0,\ y \ge 0 \)First quadrant, including the axes.
Feasible regionThe part common to all the inequalities.
CornersPoints where two boundary lines of the region meet (an axis counts only when it is an edge of the region). Meeting points are calculated by solving the equations, and only points that satisfy every constraint are kept.
Intercept form\( \dfrac{x}{a} + \dfrac{y}{b} = 1 \) for a line through \( (a, 0) \) and \( (0, b) \), with \( a, b \ne 0 \).
Corner-point ruleFor a bounded convex feasible region that includes its edges, the maximum and minimum of \( Z = ax + by \) occur at corners. A tie between two neighbouring corners means the whole edge between them gives that value.
Unbounded regionThe maximum, the minimum or both may be missing; the answer states which value exists and why.
Word problemVariables with units, one inequality per resource, \( x, y \ge 0 \), objective, corners, answer in words.

Exam questions (SEE 2081-2082 papers and CDC 2083 model pattern)

The questions below are original to this blog. Each one is tagged with the exam pattern it practises and a suggested mark split. The splits are a guide for practice only (for Q11 they follow the split in the CDC model's marking scheme), not an official NEB marking scheme. The cognitive levels mentioned (K, U, A, HA) are estimates made for this blog, except the level of the CDC model's own Q4 (c). For a 1-mark question, the option (or the short answer) with a one-line check is sufficient in the exam; the notes in brackets are for learning. Where a topic above already answers a question, the answer is given as a link to that topic.

1-mark questions

Q1. What is linear programming?

Pattern: one-line definition (knowledge level). 1 mark.

Answer: see topic 3.1 Introduction, question "What is linear programming? Define linear programming." For the 1 mark, only the first sentence of that answer (the definition) is written; the numbered points after it are for learning.

Q2. When is the boundary line of a linear inequality drawn as a dotted line?

Pattern: knowledge-level rule of graphing. 1 mark.

Answer: see topic 3.2 Linear Inequalities, question "When is the boundary line drawn solid and when is it drawn dotted? Give reason." In one line: for the strict signs \( \lt \) and \( \gt \).

Q3. What is meant by the feasible region of a system of linear inequalities?

Pattern: one-line definition (knowledge level). 1 mark.

Answer: see topic 3.3 System of Linear Inequalities, question "What is a system of linear inequalities? Define feasible region."

Q4. What is an objective function in a linear programming problem?

Pattern: one-line definition (knowledge level). 1 mark.

Answer: see topic 3.4 Solution of Linear Programming Problems, question "Define objective function, constraints and non-negativity constraints."

Q5. Which point lies in the solution region of \( x + 2y \gt 8 \)? (a) \( (1, 1) \) (b) \( (2, 3) \) (c) \( (4, 4) \) (d) \( (0, 3) \)

Pattern: multiple choice on testing a point, as in textbook Exercise 3 and the Group A style of the new paper (the CDC model's Group A had no item from this unit). 1 mark for the correct option.

Answer: (c) \( (4, 4) \), because \( 4 + 2(4) = 12 \) and \( 12 \gt 8 \). (Point \( (2, 3) \) gives exactly 8, so it lies on the dotted boundary line, not in the region; \( (1, 1) \) gives 3 and \( (0, 3) \) gives 6.)

Q6. A dotted boundary line cuts the \( x \)-axis at \( (4, 0) \) and the \( y \)-axis at \( (0, -2) \), and the side containing the origin is shaded. Which inequality does the graph show? (a) \( x - 2y \le 4 \) (b) \( x - 2y \lt 4 \) (c) \( x - 2y \gt 4 \) (d) \( 2x - y \lt 4 \)

Pattern: reverse identification, from a graph back to the inequality (textbook Exercise 3 style). 1 mark for the correct option.

Answer: (b). The line is \( \dfrac{x}{4} + \dfrac{y}{-2} = 1 \), that is, \( x - 2y = 4 \). It is dotted, so the sign is strict, and the origin gives \( 0 \lt 4 \) (true). (Option (d) is wrong because \( 2x - y = 4 \) cuts the \( x \)-axis at \( (2, 0) \), not \( (4, 0) \).)

Q7. A lift can carry at most 480 kg. Taking each adult as 60 kg and each child as 30 kg, write an inequality in its simplest form for \( x \) adults and \( y \) children in the lift.

Pattern: turning a statement into an inequality (textbook Activity and Exercise 3 style; estimated as a 1-mark knowledge/understanding sub-part). 1 mark.

Answer: \( 60x + 30y \le 480 \); dividing by 30, \( 2x + y \le 16 \) (with \( x \ge 0,\ y \ge 0 \) and \( x, y \) whole numbers).

Q8. The corner points of a feasible region are \( O(0, 0),\ P(6, 0),\ Q(5, 2) \) and \( R(0, 4) \). At which corner does \( Z = x + 3y \) have its maximum value? (a) \( O \) (b) \( P \) (c) \( Q \) (d) \( R \)

Pattern: choose the best corner from a given list, without drawing (textbook Exercise 3, Q1 style). 1 mark for the correct option.

Answer: (d) \( R(0, 4) \). The values of \( Z \) are \( 0 \) at \( O \), \( 6 \) at \( P \), \( 5 + 6 = 11 \) at \( Q \) and \( 0 + 12 = 12 \) at \( R \); 12 is the largest. (The answer is not guessed from the size of the coordinates: \( Q \) has the biggest \( x + y \), but \( R \) gives the most because \( y \) is multiplied by 3.)

Q9. Is there any point \( (x, y) \) that satisfies both \( x + 2y \le 2 \) and \( x + 2y \ge 6 \)? Give a reason.

Pattern: deciding whether a system has a common region (short reasoning). 1 mark for "no" with a correct reason.

Answer: No. At any point, the same number \( x + 2y \) would have to be at most 2 and at least 6 at the same time, which is impossible. (On a graph, the boundary lines \( x + 2y = 2 \) and \( x + 2y = 6 \) are parallel and the two shaded half-planes lie on opposite sides with a gap between them, so there is no feasible region.)

2-mark questions

Q10. Using a ruler on graph paper, shade the part of the plane where \( x + 3y \ge 6 \) is true.

Pattern: graph of one linear inequality in two variables (SEE 2081 A, 2081 B and 2082 A, 2 marks each). Suggested marks: correct solid line through two correct points 1 + correct side shaded after a test 1.

Answer: Boundary line \( x + 3y = 6 \).

\( x \)06
\( y \)20

The sign is \( \ge \), so a solid line is drawn through \( (0, 2) \) and \( (6, 0) \). Test \( O(0, 0) \): \( 0 + 3(0) = 0 \), and \( 0 \ge 6 \) is false. So the side that does not contain the origin (above the line) is shaded, as in Figure 8.

Graph on a grid with x from minus 2 to 8 and y from minus 2 to 5. A solid blue line x plus 3y equals 6 passes through (0, 2) and (6, 0). The region above the line, away from the origin, is shaded and labelled x plus 3y greater than or equal to 6. A note below says O: 0 greater than or equal to 6, false.

Figure 8: Model answer to Q10. The origin fails the test, so the far side is shaded.

Q11. Draw the lines for \( x + y \le 6,\ 4x + y \le 12,\ x \ge 0,\ y \ge 0 \) on one graph and shade the part where all four conditions hold.

Pattern: feasible region of two inequalities with \( x, y \ge 0 \) (CDC 2083 model, Q4 (c), application level). Suggested marks (as in the model's scheme): both lines drawn correctly 1 + correct feasible region shaded 1. No separate mark is given in that scheme for listing the corner points; finding them is still a quick check on the shading.

Answer:

  • \( x + y = 6 \) passes through \( (0, 6) \) and \( (6, 0) \).
  • \( 4x + y = 12 \) passes through \( (3, 0) \) and \( (1, 8) \) (if \( x = 1 \), \( y = 12 - 4 = 8 \)).
  • Both lines are solid. \( O(0, 0) \) gives \( 0 \le 6 \) and \( 0 \le 12 \), both true, so the shading is towards the origin for both, in the first quadrant.
  • Crossing point: \( (4x + y) - (x + y) = 12 - 6 \Rightarrow 3x = 6 \Rightarrow x = 2 \), and \( y = 6 - 2 = 4 \).
  • Check (not needed for the marks): the corners are \( (0, 0),\ (3, 0),\ (2, 4),\ (0, 6) \). (The point \( (6, 0) \) is not a corner, because \( 4(6) = 24 \gt 12 \).)
Graph on a grid with x from minus 1 to 8 and y from minus 1 to 9. A solid blue line x plus y equals 6 passes through (0, 6) and (6, 0). A solid red line 4x plus y equals 12 passes through (1, 8) and (3, 0). The shaded feasible region in the first quadrant has corners (0, 0), (3, 0), (2, 4) and (0, 6). Small crosses mark the plotting points (1, 8) and (6, 0).

Figure 9: Model answer to Q11.

Q12. Write the three inequalities that describe the shaded region in Figure 10 (the boundary lines are solid).

Graph on a grid with x from minus 1 to 7 and y from minus 1 to 4. A solid blue line passes through (0, 2) and (5, 0). The shaded triangle lies in the first quadrant between the line and the two axes.

Figure 10: The region for Q12.

Pattern: reverse identification, from a shaded graph to its inequalities (textbook Example 2 and Exercise 3 style). Suggested marks: equation of the slanting line 1 + all three inequalities with correct signs 1.

Answer: The line cuts the axes at \( (5, 0) \) and \( (0, 2) \):

\[ \frac{x}{5} + \frac{y}{2} = 1 \;\Rightarrow\; 2x + 5y = 10 \quad \text{(multiplying by 10)} \]

Test point \( (1, 1) \), inside the region: \( 2 + 5 = 7 \le 10 \). The two axes form the other two edges of the triangle, so the region also has \( x \ge 0 \) and \( y \ge 0 \). So the inequalities are \( 2x + 5y \le 10,\ x \ge 0,\ y \ge 0 \).

Q13. Bishal drew the graph of \( 3x - 2y \lt 6 \) like this: "The boundary line \( 3x - 2y = 6 \) passes through \( (2, 0) \) and \( (0, 3) \). The sign is \( \lt \), so I drew a solid line. Testing \( O(0, 0) \): \( 0 \lt 6 \) is true, so I shaded the side containing the origin." Find his two mistakes and correct them.

Pattern: spot the fault in a student's work (a new-pattern style used in the CDC model). Suggested marks: each mistake found and corrected 1 + 1.

Answer:

  • Mistake 1: the point \( (0, 3) \) is wrong. Putting \( x = 0 \): \( -2y = 6 \), so \( y = -3 \). The line passes through \( (2, 0) \) and \( (0, -3) \).
  • Mistake 2: for the strict sign \( \lt \) the line must be dotted, not solid, because points on the line do not satisfy \( 3x - 2y \lt 6 \).

His test-point working and his choice of the side containing the origin are correct, but the shaded region becomes correct only after the boundary line is redrawn through \( (2, 0) \) and \( (0, -3) \) as a dotted line; shading the origin side of his wrong line still gives the wrong region.

Q14. Why can the origin not be used as the test point for \( 3x - 4y \le 0 \)? Which side of the line should be shaded? Give a reason.

Pattern: why/how reasoning about the method (U level, estimated). Suggested marks: reason 1 + correct side with a valid test 1.

Answer: The boundary line \( 3x - 4y = 0 \) passes through \( O(0, 0) \), because \( 3(0) - 4(0) = 0 \). A point on the line satisfies the equation, so it cannot show which side is the correct one. A point off the line is used instead, such as \( (0, 1) \): \( 3(0) - 4(1) = -4 \), and \( -4 \le 0 \) is true. So the side that contains \( (0, 1) \) is shaded, which is the side above the solid line through \( (0, 0) \) and \( (4, 3) \).

Q15. On one graph, shade the region where both \( x + y \le 5 \) and \( x - y \le 3 \) hold. (No conditions \( x \ge 0 \) or \( y \ge 0 \) are given.) Write the point where the two boundary lines meet.

Pattern: common region of a system without the conditions \( x \ge 0,\ y \ge 0 \) (textbook Exercise 3, Q3 style). Suggested marks: both lines drawn correctly 1 + correct common region shaded, with the meeting point 1.

Answer:

  • \( x + y = 5 \) passes through \( (0, 5) \) and \( (5, 0) \); \( x - y = 3 \) passes through \( (3, 0) \) and \( (0, -3) \). Both signs are \( \le \), so both lines are solid.
  • Test \( O(0, 0) \): \( 0 + 0 = 0 \le 5 \) is true and \( 0 - 0 = 0 \le 3 \) is true, so for both lines the side containing the origin is shaded.
  • Meeting point: adding the two equations gives \( 2x = 8 \), so \( x = 4 \) and \( y = 5 - 4 = 1 \). The lines meet at \( (4, 1) \).
  • The common region is the wedge with its tip at \( (4, 1) \), opening to the left (Figure 11). It is unbounded and reaches into all four quadrants, so it is not cut off at the axes.
Graph with x from minus 5 to 7 and y from minus 6 to 7. A solid blue line x plus y equals 5 passes through (0, 5) and (5, 0). A solid red line x minus y equals 3 passes through (3, 0) and (0, minus 3). Small crosses mark these plotting points. The lines meet at the point (4, 1), shown as a dot. The shaded common region is the wedge between the two lines to the left of (4, 1); it covers parts of all four quadrants and is labelled: goes on to the left.

Figure 11: Model answer to Q15. Without \( x \ge 0 \) and \( y \ge 0 \), the region does not stop at the axes.

Q16. Draw the graph of each inequality: (a) \( 2x - y \gt 4 \), a strict inequality; (b) \( x - 2y \ge 0 \), whose boundary line passes through the origin. (Each part is a separate 2-mark question.)

Pattern: graph of one linear inequality, as in SEE 2081 A, 2081 B and 2082 A (2 marks each), here varied with a dotted line in (a) and a line through the origin in (b) (textbook Exercise 3, Q2 style). Suggested marks for each part: correct line with the right style 1 + correct side shaded after a valid test 1.

Answer: see topic 3.2 Linear Inequalities, Worked example 3, question "Draw the graphs of (a) \( 2x - y \gt 4 \) and (b) \( x - 2y \ge 0 \)." and Figure 3.

3-mark questions

Q17. What is the greatest value that \( P = 2x + 3y \) can take when \( x + y \le 7,\ x + 2y \le 10,\ x \ge 0 \) and \( y \ge 0 \)?

Pattern: maximise an objective function by the corner-point method (SEE 2082 B, 3 marks; textbook Section 3.4). Suggested marks: feasible region 1 + corners including the crossing point 1 + table of values and conclusion 1.

Answer:

  • \( x + y = 7 \) passes through \( (0, 7) \) and \( (7, 0) \); \( x + 2y = 10 \) passes through \( (0, 5) \) and \( (10, 0) \). Both are solid, and the origin satisfies both, so the shading is towards the origin in the first quadrant (Figure 12).
  • Crossing point: \( (x + 2y) - (x + y) = 10 - 7 \Rightarrow y = 3 \), then \( x = 7 - 3 = 4 \).
  • Corners: \( (0, 0),\ (7, 0),\ (4, 3),\ (0, 5) \). (\( (10, 0) \) fails \( x + y \le 7 \) and \( (0, 7) \) fails \( x + 2y \le 10 \).)
Corner\( P = 2x + 3y \)
\( (0, 0) \)0
\( (7, 0) \)14
\( (4, 3) \)8 + 9 = 17
\( (0, 5) \)15

Maximum \( P = 17 \) at \( (4, 3) \).

Graph on a grid with x from minus 1 to 11 and y from minus 1 to 8. A solid blue line x plus y equals 7 passes through (0, 7) and (7, 0). A solid red line x plus 2y equals 10 passes through (0, 5) and (10, 0). The shaded feasible region has corners (0, 0), (7, 0), (4, 3) and (0, 5). Small crosses mark the plotting points (0, 7) and (10, 0).

Figure 12: Feasible region for Q17.

Q18. The feasible region of \( 3x + 2y \le 15,\ x + 3y \le 12,\ x \ge 0,\ y \ge 0 \) has corners \( O(0, 0),\ (5, 0),\ (3, 3),\ (0, 4) \). Raju says, "\( Z = 3x + 2y \) has its maximum value only at \( (3, 3) \)." (a) Show that \( (3, 3) \) is the corner where the two slanting lines meet. (b) Check Raju's claim and justify your answer.

Pattern: check a claim and justify (the "true or false, with reason" style of the new pattern, estimated as higher ability, HA). Suggested marks: (a) 1 + (b) values of \( Z \) at the corners (or another correct argument) 1 and correct conclusion with reason 1.

Answer:

  • (a) Substituting \( (3, 3) \) into both equations: \( 3(3) + 2(3) = 15 \) and \( 3 + 3(3) = 12 \). Both are true, so \( (3, 3) \) lies on both lines. Two straight lines that are not parallel meet at only one point, so \( (3, 3) \) is their meeting point. (Solving the two equations together also gives \( x = 3,\ y = 3 \).)
  • (b) Values of \( Z = 3x + 2y \): at \( O \), 0; at \( (5, 0) \), 15; at \( (3, 3) \), \( 9 + 6 = 15 \); at \( (0, 4) \), 8. The maximum, 15, occurs at both \( (5, 0) \) and \( (3, 3) \), and so at every point of the edge joining them. Raju is wrong about the word "only". Reason: \( Z = 3x + 2y \) has the same left side as the boundary \( 3x + 2y = 15 \). So the line on which \( Z = 15 \) is this boundary line itself, and it touches the region along a whole edge, not at just one point.

Q19. Find the maximum and minimum values of \( Z = 4x + 3y \) subject to \( x + y \le 7,\ 3x + y \le 15,\ x \ge 0,\ y \ge 0 \).

Pattern: maximum and minimum of an objective function under two constraints and \( x, y \ge 0 \) (SEE 2082 B asked for the maximum only, 3 marks; textbook Section 3.4 asks for both). Suggested marks: feasible region 1 + corners 1 + table and conclusion 1.

Answer: see topic 3.3 System of Linear Inequalities, Worked example 4 (feasible region and corners, Figure 4) and topic 3.4 Solution of Linear Programming Problems, Worked example 6, question "Points \( (x, y) \) must satisfy \( x + y \le 7,\ 3x + y \le 15,\ x \ge 0,\ y \ge 0 \). Over all such points, what are the greatest and the least value of \( Z = 4x + 3y \)?" Maximum \( Z = 25 \) at \( (4, 3) \); minimum \( Z = 0 \) at \( (0, 0) \).

4-mark questions

Q20. Consider \( x + y \ge 3,\ x \le 4,\ y \le 3,\ x \ge 0,\ y \ge 0 \) and \( Z = 2x + 5y \). (a) Draw the feasible region. (b) Write its corner points. (c) Find the greatest and the least value of \( Z \). (d) Mina says, "The minimum is 0, because \( (0, 0) \) is always a corner." Find her mistake.

Pattern: maximum and minimum by the corner-point method (textbook Section 3.4 asks for both), linked with a find-the-mistake sub-part as in the new pattern. Suggested marks: (a) 1 + (b) 1 + (c) 1 + (d) 1.

Answer:

  • (a) \( x + y = 3 \) passes through \( (3, 0) \) and \( (0, 3) \). Testing \( O \): \( 0 \ge 3 \) is false, so the side away from the origin is shaded. \( x = 4 \) is a vertical line (shading to its left) and \( y = 3 \) is a horizontal line (shading below it). With \( x, y \ge 0 \), the feasible region is the quadrilateral in Figure 13. All lines are solid.
  • (b) Corners: \( (3, 0),\ (4, 0),\ (4, 3),\ (0, 3) \).
  • (c) \( Z \) at the corners: \( (3, 0) \): 6; \( (4, 0) \): 8; \( (4, 3) \): \( 8 + 15 = 23 \); \( (0, 3) \): 15. Maximum \( Z = 23 \) at \( (4, 3) \); minimum \( Z = 6 \) at \( (3, 0) \).
  • (d) \( (0, 0) \) is not in the feasible region, because \( 0 + 0 = 0 \) and \( 0 \ge 3 \) is false. The origin is a corner only when it satisfies every constraint. So the minimum is 6, not 0.
Graph on a grid with x from minus 1 to 6 and y from minus 1 to 5. A solid blue line x plus y equals 3 passes through (3, 0) and (0, 3). A solid red vertical line x equals 4 and a solid green horizontal line y equals 3 are drawn. The shaded quadrilateral has corners (3, 0), (4, 0), (4, 3) and (0, 3); the origin is outside it.

Figure 13: Feasible region for Q20. The origin is not in this region.

Q21. A workshop makes chairs and stools. A chair needs 2 hours of carpentry and 1 hour of polishing. A stool needs 1 hour of carpentry and 2 hours of polishing. Each day there are at most 12 hours of carpentry and at most 12 hours of polishing. The profit is Rs 400 on a chair and Rs 300 on a stool. Let \( x \) chairs and \( y \) stools be made in a day. (a) Write the constraints. (b) Draw the feasible region. (c) Write its corner points. (d) Find the number of chairs and stools that gives the maximum profit, and the maximum profit.

Pattern: forming and solving a word problem (higher ability, estimated; the textbook links this method to business and production). Suggested marks: (a) 1 + (b) 1 + (c) 1 + (d) 1.

Answer:

  • (a) Carpentry: \( 2x + y \le 12 \); polishing: \( x + 2y \le 12 \); \( x \ge 0,\ y \ge 0 \) (whole numbers, because they count chairs and stools). Objective: maximise \( P = 400x + 300y \) (rupees).
  • (b) \( 2x + y = 12 \) passes through \( (6, 0) \) and \( (0, 12) \); \( x + 2y = 12 \) passes through \( (12, 0) \) and \( (0, 6) \). The origin satisfies both, so the shading is towards it in the first quadrant (Figure 14).
  • (c) Crossing point: \( (2x + y) - (x + 2y) = 0 \Rightarrow x = y \); then \( 2x + x = 12 \Rightarrow x = 4,\ y = 4 \). Corners: \( (0, 0),\ (6, 0),\ (4, 4),\ (0, 6) \).
  • (d) Profits: \( (0, 0) \): Rs 0; \( (6, 0) \): Rs 2400; \( (4, 4) \): \( 1600 + 1200 = \) Rs 2800; \( (0, 6) \): Rs 1800. The maximum profit is Rs 2800 a day, from 4 chairs and 4 stools. (Check: carpentry \( 2(4) + 4 = 12 \) hours and polishing \( 4 + 2(4) = 12 \) hours, so both limits are met exactly.)
Graph with x axis labelled x (chairs) and y axis labelled y (stools), both from 0 to 12 in steps of 2. A solid blue line 2x plus y equals 12 (carpentry) passes through (0, 12) and (6, 0). A solid red line x plus 2y equals 12 (polishing) passes through (0, 6) and (12, 0). The shaded feasible region has corners (0, 0), (6, 0), (4, 4) and (0, 6). Small crosses mark the plotting points (0, 12) and (12, 0).

Figure 14: Feasible region for the workshop problem (Q21).

Q22. Consider the constraints \( x + y \le 6,\ 2x + y \le 10,\ x + 3y \le 15,\ x \ge 0,\ y \ge 0 \). (a) Draw the feasible region. (b) Find the meeting point of each pair of slanting lines, and say which of these points are corners of the region. (c) What are the greatest and the smallest values that \( Z = 3x + 4y \) takes on the region?

Pattern: three slanting constraints, a corner with fractions, and a meeting point that must be rejected (a harder practice item; the SEE and model questions reviewed used two slanting constraints). Suggested marks: (a) 1 + (b) 2 (meeting points 1, correct choice of corners with reasons 1) + (c) 1.

Answer:

  • (a) \( x + y = 6 \) passes through \( (0, 6) \) and \( (6, 0) \); \( 2x + y = 10 \) through \( (0, 10) \) and \( (5, 0) \); \( x + 3y = 15 \) through \( (0, 5) \) and \( (6, 3) \). All three lines are solid. The origin gives \( 0 \le 6 \), \( 0 \le 10 \) and \( 0 \le 15 \), all true, so the shading is towards the origin for every line, in the first quadrant (Figure 15).
  • (b) \( x + y = 6 \) and \( 2x + y = 10 \): subtracting, \( x = 4 \), so \( y = 2 \). Check in the third constraint: \( 4 + 3(2) = 10 \le 15 \), true. So \( (4, 2) \) is a corner.
  • \( x + y = 6 \) and \( x + 3y = 15 \): subtracting, \( 2y = 9 \), so \( y = \dfrac{9}{2} \) and \( x = 6 - \dfrac{9}{2} = \dfrac{3}{2} \). Check: \( 2\left(\dfrac{3}{2}\right) + \dfrac{9}{2} = \dfrac{15}{2} \le 10 \), true. So \( \left(\dfrac{3}{2}, \dfrac{9}{2}\right) \) is a corner.
  • \( 2x + y = 10 \) and \( x + 3y = 15 \): from the first, \( y = 10 - 2x \); then \( x + 3(10 - 2x) = 15 \Rightarrow 30 - 5x = 15 \Rightarrow x = 3 \), so \( y = 4 \). Check: \( 3 + 4 = 7 \le 6 \) is false. So \( (3, 4) \) lies outside the region and is not a corner.
  • On the axes the corners are \( (5, 0) \) and \( (0, 5) \): the other intercepts break a constraint (\( (6, 0) \) gives \( 2(6) = 12 \gt 10 \); \( (0, 6) \) gives \( 3(6) = 18 \gt 15 \)). Corners: \( O(0, 0),\ (5, 0),\ (4, 2),\ \left(\dfrac{3}{2}, \dfrac{9}{2}\right),\ (0, 5) \).

(c) Values of \( Z \) at the corners:

Corner\( Z = 3x + 4y \)
\( (0, 0) \)0
\( (5, 0) \)15
\( (4, 2) \)12 + 8 = 20
\( \left(\dfrac{3}{2}, \dfrac{9}{2}\right) \)\( \dfrac{9}{2} + 18 = \dfrac{45}{2} = 22.5 \)
\( (0, 5) \)20

Maximum \( Z = \dfrac{45}{2} = 22.5 \) at \( \left(\dfrac{3}{2}, \dfrac{9}{2}\right) \); minimum \( Z = 0 \) at \( (0, 0) \). The fractions are kept exact: a corner guessed from the graph, such as \( (1, 5) \), is not even in the region (\( 1 + 3(5) = 16 \gt 15 \)).

Graph with x from minus 1 to 8 and y from minus 1 to 11. Three solid lines: blue x plus y equals 6, red 2x plus y equals 10 and green x plus 3y equals 15. The shaded feasible region in the first quadrant has corners O, (5, 0), (4, 2), (3/2, 9/2) and (0, 5). The point (3, 4), where the red and green lines meet, is marked with a purple cross and labelled not feasible; it lies outside the shaded region.

Figure 15: Feasible region for Q22. The meeting point \( (3, 4) \) is outside the region, so it is not a corner.

Q23. The shaded region in Figure 16 is bounded by two solid slanting lines and the two axes. (a) Find the equations of the two slanting lines and write the four inequalities of the region. (b) Find the corner where the slanting lines meet. (c) What are the greatest and the smallest values that \( F = 6x + 5y \) takes on the region?

Graph with x from minus 1 to 10 and y from minus 1 to 13. A solid blue line passes through the marked points (4, 0) and (0, 12). A solid red line passes through the marked points (8, 0) and (0, 8). The shaded region in the first quadrant is bounded by the two axes, the blue line from (4, 0) up to the point where the lines cross, and the red line from there to (0, 8). The crossing point is not labelled.

Figure 16: The region for Q23.

Pattern: read the inequalities from a graph, then find the maximum and minimum (textbook Exercise 3, Q6 style). Suggested marks: (a) 2 (equations 1, four inequalities with correct signs 1) + (b) 1 + (c) 1.

Answer:

  • (a) The blue line cuts the axes at \( (4, 0) \) and \( (0, 12) \): \[ \frac{x}{4} + \frac{y}{12} = 1 \;\Rightarrow\; 3x + y = 12 \quad \text{(multiplying by 12)} \] The red line cuts the axes at \( (8, 0) \) and \( (0, 8) \): \[ \frac{x}{8} + \frac{y}{8} = 1 \;\Rightarrow\; x + y = 8 \] Test point \( (1, 1) \), inside the region: \( 3 + 1 = 4 \le 12 \) and \( 1 + 1 = 2 \le 8 \). The axes are the other two edges. So the inequalities are \( 3x + y \le 12,\ x + y \le 8,\ x \ge 0,\ y \ge 0 \).
  • (b) \( (3x + y) - (x + y) = 12 - 8 \Rightarrow 2x = 4 \Rightarrow x = 2 \), and \( y = 8 - 2 = 6 \). The corner is \( (2, 6) \).
  • (c) Corners: \( (0, 0),\ (4, 0),\ (2, 6),\ (0, 8) \). (\( (8, 0) \) and \( (0, 12) \) are not corners: \( 3(8) = 24 \gt 12 \) and \( 12 \gt 8 \).) Values of \( F = 6x + 5y \): 0; 24; \( 12 + 30 = 42 \); 40. Maximum \( F = 42 \) at \( (2, 6) \); minimum \( F = 0 \) at \( (0, 0) \).

Q24. A farmer has 10 hectares of land for wheat and maize. Each hectare of wheat needs 4 days of labour and each hectare of maize needs 2 days, and only 32 days of labour are available. The profit is Rs 30,000 per hectare of wheat and Rs 20,000 per hectare of maize. Form the constraints and the profit function, draw the feasible region and find how many hectares of each crop give the greatest profit.

Pattern: forming and solving a word problem (higher ability, estimated). Suggested marks: constraints and objective 1 + feasible region 1 + corners 1 + table and conclusion with units 1.

Answer: see topic 3.4 Solution of Linear Programming Problems, Worked example 7, question "A farmer has 10 hectares of land for wheat and maize. Each hectare of wheat needs 4 days of labour and each hectare of maize needs 2 days, and only 32 days of labour are available. The profit is Rs 30,000 per hectare of wheat and Rs 20,000 per hectare of maize. How many hectares of each crop give the greatest profit?" and Figure 7. The greatest profit is Rs 2,60,000, from 6 hectares of wheat and 4 hectares of maize.

Next unit: Unit 4 - Quadratic Equation and Graphs: Notes and Exam Questions.

No comments

Powered by Blogger.
HomeAbout UsContact UsPrivacy Policy© 2026 SEE Notes. All rights reserved.