Mathematics · Textbook solutions
Linear Programming
Every solved example, exercise, and miscellaneous question, in the order the textbook teaches them. Plus every board question asked from this chapter. · 15 questions
12.2.2 Graphical Method of Solving Linear Programming Problems
15 q
Solved Examples
Worked · 5
- 12.1 Eg.1Solve the following linear programming problem graphically: Maximise subject to the constraints: ,
- 12.1 Eg.2Solve the following linear programming problem graphically: Minimise subject to the constraints: ,
- 12.1 Eg.3Solve the following problem graphically: Minimise and Maximise subject to the constraints: ,
- 12.1 Eg.4Determine graphically the minimum value of the objective function subject to the constraints: ,
- 12.1 Eg.5Minimise subject to the constraints: ,
Exercise 12.1
Practice · 10
- Ex 12.1 Q1Solve the following Linear Programming Problem graphically: Maximise subject to the constraints : , , .
- Ex 12.1 Q2Solve the following Linear Programming Problem graphically: Minimise subject to , , , .
- Ex 12.1 Q3Solve the following Linear Programming Problem graphically: Maximise subject to , , , .
- Ex 12.1 Q4Solve the following Linear Programming Problem graphically: Minimise such that , , .
- Ex 12.1 Q5Solve the following Linear Programming Problem graphically: Maximise subject to , , .
- Ex 12.1 Q6Solve the following Linear Programming Problem graphically: Minimise subject to , , . Show that the minimum of occurs at more than two points.
- Ex 12.1 Q7Solve the following Linear Programming Problem graphically: Minimise and Maximise subject to , , , .
- Ex 12.1 Q8Solve the following Linear Programming Problem graphically: Minimise and Maximise subject to , , ; .
- Ex 12.1 Q9Solve the following Linear Programming Problem graphically: Maximise , subject to the constraints: , , , .
- Ex 12.1 Q10Solve the following Linear Programming Problem graphically: Maximise , subject to , , .
What the board has asked from this chapter
Questions per paper · 21 papers · 2023 to 2026
Bars average the full papers of each year. 31 further questions come from set variants and are listed below.
2023: 2.6 questions per paper. 2024: 2.6 questions per paper. 2025: 2.8 questions per paper. 2026: 2.6 questions per paper
2026
19 q
- 14The region represented by the system of inequations , , is :
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 15In the graph, the feasible region representing the Linear Programming Problem for maximising objective function , is shaded. If all points on segment AB give max (Z), then which of the following is true ?
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 15The corner points of the feasible region determined by the system of linear constraints are (0, 0), (0, 40), (20, 40) (60, 20) and (60, 0). If the objective function of an LPP is , then the maximum value is :
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 16In a linear programming problem, the linear function which has to be maximized or minimized is called
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 17The feasible region of a linear programming problem with objective function is shown below : The maximum value of Z – minimum value of Z is
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 17For the feasible region shown below, the non-trivial constraints of the linear programming problem are
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 18The degree of an objective function of a linear programming problem is
Tap an option to check your answer.
Graphical Solution and the Feasible Region - Questions number 19 and 20 are Assertion and Reason based questions. Two statements are given, one labelled Assertion (A) and the other labelled Reason (R). Select the correct answer from the codes (A), (B), (C) and (D) as given below.20Assertion (A) : Consider a Linear Programming Problem with minimise subject to constraints , , which gives minimum Z at infinitely many points. The corner points of feasible region are (0, 3) and (6, 0). Reason (R) : If two corner points produce the same minimum value of the objective function, then every point on the line segment joining the points will give the same minimum value.
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 28Solve the following linear programming problem graphically : Maximize Subject to constraintsGraphical Solution and the Feasible Region
- 29Solve the following Linear Programming Problem graphically : Minimize subject toGraphical Solution and the Feasible Region
- 29Solve the following Linear Programming Problem graphically : Maximize subject to constraintsGraphical Solution and the Feasible Region
- 29Solve the following Linear Programming Problem graphically : Maximize subject to constraints .Graphical Solution and the Feasible Region
- 29Solve the following Linear Programming Problem graphically : Maximise subject to the constraintsGraphical Solution and the Feasible Region
- 30Solve the following linear programming problem graphically : Maximize Subject to constraintsGraphical Solution and the Feasible Region
- 30Solve the following linear programming problem graphically : Minimize Subject to constraints , , ,Graphical Solution and the Feasible Region
- 31Solve the following linear programming problem graphically : Maximize Subject to constraints ,Graphical Solution and the Feasible Region
- 33Solve the following Linear Programming Problem graphically : Maximise subject to the constraintsGraphical Solution and the Feasible Region
- 34Solve the following Linear Programming Problem graphically : Maximize subject to the constraintsGraphical Solution and the Feasible Region
- 35Solve the following Linear Programming Problem graphically : Maximise subject to the constraintsGraphical Solution and the Feasible Region
2025
25 q
- 14For a Linear Programming Problem (LPP), the given objective function is . The feasible region PQRS determined by the set of constraints is shown as a shaded region in the graph. (Note : The figure is not to scale) , , , Which of the following statements is correct ?
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 14The corner points of the feasible region in graphical representation of a L.P.P. are (2, 72), (15, 20) and (40, 15). If be the objective function, then
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 15In a Linear Programming Problem (LPP), the objective function is to be maximised under the following constraints : , , Study the graph and select the correct option. (Note : The figure is not to scale) The solution of the given LPP :
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 16For a Linear Programming Problem (LPP), the given objective function is subject to constraints : The correct feasible region is :
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 16If the feasible region of a linear programming problem with objective function , is bounded, then which of the following is correct ?
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 16A factory produces two products X and Y. The profit earned by selling X and Y is represented by the objective function , where and y are the number of units of X and Y respectively sold. Which of the following statement is correct ?
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 18The corner points of the feasible region of a Linear Programming Problem are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). If Z = ax + by; (a, b > 0) be the objective function, and maximum value of Z is obtained at (0, 2) and (3, 0), then the relation between a and b is :
Tap an option to check your answer.
Graphical Solution and the Feasible Region - Questions number 19 and 20 are Assertion and Reason based questions. Two statements are given, one labelled Assertion (A) and the other labelled Reason (R). Select the correct answer from the codes (A), (B), (C) and (D) as given below.19Assertion (A) : The shaded portion of the graph represents the feasible region for the given Linear Programming Problem (LPP). Min subject to constraints , , has a minimum value at . Reason (R) : The region representing does not have any point common with the feasible region.
Tap an option to check your answer.
Graphical Solution and the Feasible Region - ASSERTION – REASON BASED QUESTIONS Direction : Question number 19 and 20 are Assertion (A) and Reason (R) based questions. Two statements are given, one labelled Assertion (A) and other labelled Reason (R). Select the correct answer from the options (A), (B), (C) and (D) as given below :20Assertion (A) : Every point of the feasible region of a Linear Programming Problem is an optimal solution. Reason (R) : The optimal solution for a Linear Programming Problem exists only at one or more corner point(s) of the feasible region.
Tap an option to check your answer.
Graphical Solution and the Feasible Region - Questions number 19 and 20 are Assertion and Reason based questions. Two statements are given, one labelled Assertion (A) and the other labelled Reason (R). Select the correct answer from the codes (A), (B), (C) and (D) as given below.20Assertion (A) : In a Linear Programming Problem, if the feasible region is empty, then the Linear Programming Problem has no solution. Reason (R) : A feasible region is defined as the region that satisfies all the constraints.
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 24In a Linear Programming Program (LPP) for objective function subject to constraints shade the feasible region and mark the corner points in a neatly drawn graph.Graphical Solution and the Feasible Region
- 24In a Linear Programming Problem, the objective function needs to be maximised under constraints , , . Express the LPP on the graph and shade the feasible region and mark the corner points.Graphical Solution and the Feasible Region
- 24For a Linear Programming Problem, find min (where Z is the objective function) for the feasible region shaded in the given figure. (Note : The figure is not to scale)Graphical Solution and the Feasible Region
- 26Solve the following linear programming problem graphically : Maximize Subject to the constraints : ,Graphical Solution and the Feasible Region
- 27Solve the following linear programming problem graphically : Maximise Subject to the constraints : ,Graphical Solution and the Feasible Region
- 27Solve the following linear programming problem graphically : Maximise Subject to the constraints :Graphical Solution and the Feasible Region
- 28Solve the following linear programming problem graphically : Minimise subject to the constraints :Graphical Solution and the Feasible Region
- 28The feasible region along with corner points for a linear programming problem are shown in the graph. Write all the constraints for the given linear programing problem.Graphical Solution and the Feasible Region
- 28Solve the following linear programming problem graphically : Minimise subject to the constraints :Graphical Solution and the Feasible Region
- 29In the Linear Programming Problem (LPP), find the point/points giving maximum value for subject to constraintsGraphical Solution and the Feasible Region
- 29Consider the Linear Programming Problem, where the objective function needs to be minimized subject to constraints . Draw a neat graph of the feasible region and find the minimum value of Z.Graphical Solution and the Feasible Region
- 30In the Linear Programming Problem for objective function subject to constraints find the minimum value of Z.Graphical Solution and the Feasible Region
- 31For the given graph of a Linear Programming Problem, write all the constraints satisfying the given feasible region.Graphical Solution and the Feasible Region
- 31Solve the following Linear Programming Problem using graphical method : Maximise subject to the constraintsGraphical Solution and the Feasible Region
- 31Solve the following Linear Programming Problem graphically : Minimise subject to the constraintsGraphical Solution and the Feasible Region
2024
21 q
- 10A linear programming problem deals with the optimization of a/an :
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 10The common region determined by all the constraints of a linear programming problem is called :
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 10The restrictions imposed on decision variables involved in an objective function of a linear programming problem are called :
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 16The maximum value of for a L.P.P. whose feasible region is given below is :
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 17The number of corner points of the feasible region determined by constraints , , is :
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 17Of the following, which group of constraints represents the feasible region given below ?
Tap an option to check your answer.
Graphical Solution and the Feasible Region - Questions No. 19 & 20, are Assertion (A) and Reason (R) based questions carrying 1 mark each. Two statements are given, one labelled Assertion (A) and the other labelled Reason (R). Select the correct answer from the codes (A), (B), (C) and (D) as given below :20Assertion (A) : The corner points of the bounded feasible region of a L.P.P. are shown below. The maximum value of occurs at infinite points. Reason (R) : The optimal solution of a LPP having bounded feasible region must occur at corner points.
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 26Solve the following linear programming problem graphically : Minimise subject to the constraintsGraphical Solution and the Feasible Region
- 26Solve the following linear programming problem graphically : Maximize subject to constraints .Graphical Solution and the Feasible Region
- 28Solve the following linear programming problem graphically : Minimize , subject to the constraints .Graphical Solution and the Feasible Region
- 28Solve the following linear programming problem graphically : Maximise subject to the constraintsGraphical Solution and the Feasible Region
- 30The corner points of the feasible region determined by the system of linear constraints are as shown in the following figure : (i) If be the objective function, then find the maximum value of Z. (ii) If where p, q > 0 be the objective function. Find the condition on p and q so that maximum value of Z occurs at B(4, 10) and C(6, 8).Graphical Solution and the Feasible Region
- 30Solve the following L.P.P. graphically : Maximise subject to the constraints :Graphical Solution and the Feasible Region
- 30Solve the following linear programming problem graphically : Maximise subject to the constraints :Graphical Solution and the Feasible Region
- 30Solve the following linear programming problem graphically : Maximise , subject to constraintsGraphical Solution and the Feasible Region
- 30Solve the following linear programming problem graphically : Maximise , subject to the constraints .Graphical Solution and the Feasible Region
- 35Solve the following Linear Programming problem graphically : Maximise Subject to .Graphical Solution and the Feasible Region
- 35Solve the following L.P.P. graphically : Minimise Subject to constraints ; ;Graphical Solution and the Feasible Region
- 35Solve the following L.P.P. graphically : Maximise Subject toGraphical Solution and the Feasible Region
- The month of September is celebrated as the Rashtriya Poshan Maah across the country. Following a healthy and well-balanced diet is crucial in order to supply the body with the proper nutrients it needs. A balanced diet also keeps us mentally fit and promotes improved level of energy. A dietician wishes to minimize the cost of a diet involving two types of foods, food X (x kg) and food Y (y kg) which are available at the rate of ₹ 16/kg and ₹ 20/kg respectively. The feasible region satisfying the constraints is shown in Figure-2. On the basis of the above information, answer the following questions :37 (i)Identify and write all the constraints which determine the given feasible region in Figure-2.Graphical Solution and the Feasible Region
- The month of September is celebrated as the Rashtriya Poshan Maah across the country. Following a healthy and well-balanced diet is crucial in order to supply the body with the proper nutrients it needs. A balanced diet also keeps us mentally fit and promotes improved level of energy. A dietician wishes to minimize the cost of a diet involving two types of foods, food X (x kg) and food Y (y kg) which are available at the rate of ₹ 16/kg and ₹ 20/kg respectively. The feasible region satisfying the constraints is shown in Figure-2. On the basis of the above information, answer the following questions :37 (ii)If the objective is to minimize cost , find the values of x and y at which cost is minimum. Also, find minimum cost assuming that minimum cost is possible for the given unbounded region.Graphical Solution and the Feasible Region
2023
22 q
- 15The solution set of the inequation is :
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 16Which of the following points satisfies both the inequations and ?
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 17The objective function of an LPP has maximum value 42 at (4, 6) and minimum value 19 at (3, 2). Which of the following is true ?
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 17The number of feasible solutions of the linear programming problem given as Maximize z = 15x + 30y subject to constraints : , , , is
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 17The corner points of the feasible region in the graphical representation of a linear programming problem are (2, 72), (15, 20) and (40, 15). If z = 18x + 9y be the objective function, then :
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 18The number of corner points of the feasible region determined by the constraints , , , is :
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 18The feasible region of a linear programming problem is shown in the figure below : Which of the following are the possible constraints ?
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 18The corner points of the feasible region of a linear programming problem are (0, 4), (8, 0) and . If is the objective function, then (maximum value of Z minimum value of Z) is equal to
Tap an option to check your answer.
Graphical Solution and the Feasible Region - 26Solve the following Linear Programming problem graphically : Maximize : subject to constraints : , , , .Graphical Solution and the Feasible Region
- 27Solve the following linear programming problem graphically : Maximize P = 100x + 5y subject to the constraints , , , .Graphical Solution and the Feasible Region
- 28Solve the following linear programming problem graphically : Maximise subject to the constraints , , .Graphical Solution and the Feasible Region
- 28Solve the following linear programming problem graphically : Maximize z = 3x + 9y subject to the constraints , , , , .Graphical Solution and the Feasible Region
- 29Solve graphically the following linear programming problem : Maximise z = 6x + 3y, subject to the constraints , , , .Graphical Solution and the Feasible Region
- 29Solve the following linear programming problem graphically : Maximize : subject to constraints : , , , , .Graphical Solution and the Feasible Region
- 30Solve the following linear programming problem graphically : Maximize z = 600x + 400y subject to the constraints : , , ,Graphical Solution and the Feasible Region
- 30Determine graphically the minimum value of the following objective function : z = 500x + 400y subject to constraints , , , .Graphical Solution and the Feasible Region
- 30Solve the following linear programming problem graphically : Minimise : subject to the constraints , , .Graphical Solution and the Feasible Region
- 31Solve the following linear programming problem graphically : Minimize z = x + 2y subject to the constraints , , , .Graphical Solution and the Feasible Region
- 31Solve the following linear programming problem graphically : Minimize : subject to constraints : , , , ,Graphical Solution and the Feasible Region
- 31Solve the following linear programming problem graphically : Maximise subject to the constraints , , , .Graphical Solution and the Feasible Region
- 32Solve the following Linear Programming Problem graphically : Minimise : subject to constraints :Graphical Solution and the Feasible Region
- 34Solve the following Linear Programming Problem graphically : Maximize : subject to : , ,Graphical Solution and the Feasible Region
The 10 board questions to practise first
The questions the board asked again come first, most asked first. Each one says how often and when.
Question 1
Asked 3 times: 2023, 2024*, 2026 (* = numbers or wording changed that year)
33Solve the following Linear Programming Problem graphically : Maximise subject to the constraintsQuestion 2
Asked 3 times: 2023*, 2025*, 2026 (* = numbers or wording changed that year)
29Solve the following Linear Programming Problem graphically : Maximise subject to the constraintsQuestion 3
Asked 3 times: 2023*, 2024*, 2025 (* = numbers or wording changed that year)
29In the Linear Programming Problem (LPP), find the point/points giving maximum value for subject to constraintsQuestion 4
Asked 2 times: 2023, 2026
Two statements are given, one labelled Assertion (A) and the other labelled Reason (R). Select the correct answer from the options given below.20Assertion (A) : Consider a Linear Programming Problem with minimise subject to constraints , , which gives minimum Z at infinitely many points. The corner points of feasible region are (0, 3) and (6, 0). Reason (R) : If two corner points produce the same minimum value of the objective function, then every point on the line segment joining the points will give the same minimum value.Tap an option to check your answer.
Question 5
Asked 2 times: 2023, 2025
14The corner points of the feasible region in graphical representation of a L.P.P. are (2, 72), (15, 20) and (40, 15). If be the objective function, thenTap an option to check your answer.
Question 6
Asked 2 times: 2023*, 2024 (* = numbers or wording changed that year)
35Solve the following L.P.P. graphically : Minimise Subject to constraints ; ;Question 7
This type asked 4 times: 2023, 2024, 2025, 2026. This one: 2026
35Solve the following Linear Programming Problem graphically : Maximise subject to the constraintsQuestion 8
This type asked 4 times: 2023, 2024, 2025, 2026. This one: 2026
29Solve the following Linear Programming Problem graphically : Minimize subject toQuestion 9
This type asked 4 times: 2023, 2024, 2025, 2026. This one: 2026
17For the feasible region shown below, the non-trivial constraints of the linear programming problem areTap an option to check your answer.
Question 10
This type asked 4 times: 2023, 2024, 2025, 2026. This one: 2026
17The feasible region of a linear programming problem with objective function is shown below : The maximum value of Z – minimum value of Z isTap an option to check your answer.