CBSE Class 12 Maths Revision Notes Chapter 12
Class 12 Mathematics Chapter 12 Notes
Chapter 12 Mathematics Class 12 notes are based on the students’ prior knowledge of linear equations and inequalities. Students will have to solve several reallife problems with the help of linear programming. The Chapter is essential, as well as scoring from the point of view of the CBSE board exam. With the help of the Class 12 Mathematics Chapter 12 notes, students can make lastminute preparations and get maximum scores. Extramarks provide detailed information and thorough conceptual clarity of CBSE syllabus along with revision notes to help students study efficiently and excel in academics.
NCERT Class 12 Mathematics Chapter 12 Notes: Key Topics
Some of the topics introduced in Class 12 Mathematics notes Chapter 12 are as follows:
 Definition of LPP
 Method of formulating the LPP using graphical method
 Important mathematical formulas and concepts including Optimal value, Objective function, Constraints, and, Optimization problems.
 Applications of Linear Programming problems
 Theorems of LPP
Introduction:
Linear programming problems (LLP) are one of the essential Classes of optimisation problems. It is a mathematical modelling technique where the linear function is maximised or minimised under various constraints.
In general, an LPP is specified as follows:
Consider:
(i) n variables x1, x2, x3,… ,xn.
(ii) m linear inequalities in these variables.
(iii) Linear objective function.
Find values for that xi’s which satisfy the given constraints and maximise or minimise the objective function.
What is a Linear Programming Problem?
An LPP is based on finding an optimal value of a linear function of several variables with respect to the conditions which the variable satisfies. ‘Linear’ means mathematical relations which are used in problems are linear relations, and ‘Programming’ means a method of determining a plan of action.
Important definitions:
Objective function: The linear function Z = ax + by where, a,b are constants has to be minimised or maximised is termed as the Objective function. The variables x and y are known as the decision variables.
Constraints: The inequalities or equations on the variables of an LPP are called constraints. Conditions x ≥ 0, y ≥ 0 are known as nonnegative constraints.
Optimization problem: It is a problem which needs to maximise or minimise a given linear function with respect to certain constraints determined by the linear inequalities.
Solutions: The values of the decision variables x and y which satisfy the given constraints and restrictions of an LPP, are termed as a solution of the LPP.
Optimal Solutions: A feasible solution that can optimise the objective function is defined as the optimal solution to the linear programming problem.
Feasible region: The point in a region which represents a suitable choice is termed the feasible region. It is a common region which determines the nonnegative constraints. In other words, a solution which satisfies the nonnegativity restrictions of the LPP is the feasible solution. Also, the set of all feasible solutions is termed the feasible region. Every point belonging (within or on the boundary) to this region is known as a feasible solution. The region outside the feasible region is the infeasible region.
Graphical method to solve the linear programming problems:
The problems which involve only two variables can be solved using the graphical method of linear programming problems. It is based on the extreme point theorem.
Corner Point Method:
It comprises of the following steps:
 Find the feasible region of the LPP. Determine its corner points either by inspection method or by solving the two equations intersecting at a point.
 Evaluate objective function at every corner point. Consider M and m to be the largest and smallest values of these points, respectively.
 (i) When the feasible region is bounded, then we say that M and m are maximum and minimum values of the objective function.
(ii) If the feasible region is not bounded, we have
 (a) M is the max value of Z if and only if the open halfplane determined by ax + by > M has no common point with the feasible region. Or else, maximum value M does not exist.
 (b) Similarly, m is the min value of Z if and only if the open halfplane determined by ax + by < m has no common point with the feasible region. Or else, minimum value M does not exist.
The Class 12 Mathematics Chapter 12 notes include several problems for students to practice.
Types of Linear Programming Problems:

Manufacturing problems:
In these types of problems, the number of units of different products is to be determined. These units will be produced and sold by a firm, and every product will require fixed manpower, hours for the machine, labour hours per unit of product, warehouse space, etc., to make maximum profit.
2. Diet problems:
In these types of problems, the number of different kinds of constituents or nutrients is to be determined. This amount will be included in a diet in such a way that the cost of the desired diet is minimised. However, the diet must contain a particular minimum amount of each constituent or nutrient.
3. Transportation problems:
In these types of problems, the transportation schedule is to be determined. This schedule will help to find a way of transporting a product at minimum cost from plants or factories situated at different locations to the various markets.
Theorem 1:
If R is the feasible region or a convex polygon for a linear programming problem and Z = ax + by is the objective function, then when Z has a maximum or minimum value (optimal value), where the decision variables x and y have constraints described by the linear inequalities or equations, the optimal value Z must occur at a corner point or vertex of the feasible region.
Theorem 2:
If R is the feasible region or a convex polygon for a linear programming problem and Z = ax + by is the objective function. Let R is bounded; then, the objective function Z has both a maximum as well as minimum value on R. Each optimal value occurs at the corner point or vertex of R.
Class 12 Mathematics Chapter 12 Notes: Exercise & Solutions
To help students gain indepth knowledge of the Chapter, Extramarks provides wellorganised and detailed Class 12 Mathematics Chapter 12 notes. Solutions to all important questions, exercise problems, solved examples, and some CBSE extra questions are included in the notes. These notes enable quick revision as it provides all important definitions, derivations, formulas, and theorems in one place. With the help of the Class 12 Mathematics Chapter 12 notes, students will learn to practice, interpret and solve complex questions in no time. Students are advised to refer to the stepbystep solutions to understand each and every step of linear programming problems. It boosts confidence and empowers students to pursue their dream careers.
Refer to the links given below to get access to unlimited problems of Chapter 12 Mathematics Class 12 notes:
Students can also access other Extramarks academic notes and reference materials to study in a fun and engaging manner.
NCERT Class 12 Mathematics Chapter 12 notes: Key Features
 Class 12 Mathematics Chapter 12 notes are focused on strengthening the fundamental basic concepts for students to understand the complex concepts well.
 The notes strictly adhere to the latest CBSE Syllabus for 20212022.
 It is prepared by the inhouse team of experts in Mathematics at Extramarks.
 Students can depend on these notes as it includes authentic and apt information.
 It prepares students for board exams as well as other national level competitive examinations such as JEE Mains, etc.
 With the help of Class 12 Mathematics notes Chapter 12, students can practice unlimited questions to reduce the chances of making simple mistakes and boost confidence.
Q.1 A manufacturing company makes two models A and B of a product. Each piece of Model A requires 9 labour hours for fabricating and 1 labour hour for finishing. Each piece of Model B requires 12 labour hours for fabricating and 3 labour hours for finishing. For fabricating and finishing, the maximum labour hours available are 180 and 30 respectively. The company makes a profit of Rs 8000 on each piece of model A and Rs 12000 on each piece of Model B. How many pieces of Model A and Model B should be manufactured per week to realise a maximum profit? What is the maximum profit per week?
Ans
Suppose x is the number of pieces of Model A and y is the number of pieces of Model B. Then
Total profit (in Rs) = 8000x + 12000y
Let Z = 8000x + 12000y
Mathematical model for the given problem is as follows:
Maximise Z = 8000 x + 12000 y (1)
subject to the constraints:
9x + 12y ≤ 180 (Fabricating constraint), i.e., 3x + 4y ≤ 60 (2)
x + 3y ≤ 30 (finishing constraint) (3)
x, y ≥ 0 (4)
The feasible region (shaded) OABC determined by the linear inequalities (2) to (4) is shown below.
Corner Point  Z = 8000x + 12000y 
A(0, 10)  120000 
B(12, 6)  168000 ← Maximum 
C(20, 0)  16000 
The company should produce 12 pieces of Model A and 6 pieces of Model B to realise maximum profit and maximum profit then will be Rs 1,68,000.
Q.2 A company manufactures two types of novelty souvenirs made of plywood. Souvenirs of type A require 5 minutes each for cutting and 10 minutes each for assembling. Souvenirs of type B require 8 minutes each for cutting and 8 minutes each for assembling. There are 3 hours 20 minutes available for cutting and 4 hours for assembling. The profit is Rs 5 each for type A and Rs 6 each for type B souvenirs. Formulate the LPP.
Ans
Resources

Type  Availability  
A  B  
Cutting (minutes)  5  8  200 
Assembling (minutes)  10  8  240 
Profit (Rs)  5  6 
The mathematical formulation of the given problem is
Maximize Z = 5x + 6y
subject to the constraints,
5x + 8y ≤ 200
10x + 8y ≤ 240, i.e., 5x + 4y ≤ 120
Q.3 A cooperative society of farmers has 50 hectare of land to grow two crops X and Y. The profit from crops X and Y per hectare are estimated as Rs 10,500 and Rs 9,000 respectively. To control weeds, a liquid herbicide has to be used for crops X and Y at rates of 20 litres and 10 litres per hectare. Further, no more than 800 litres of herbicide should be used in order to protect fish and wild life using a pond which collects drainage from this land. How much land should be allocated to each crop so as to maximise the total profit of the society?
Ans
Let x hectare of land be allocated to crop X and y hectare to crop Y.
Profit per hectare on crop X = Rs 10500
Profit per hectare on crop Y = Rs 9000
Therefore, total profit = Rs (10500x + 9000y)
The mathematical formulation of the problem is as follows:
Maximise Z = 10500
subject to the constraints:
x + y ≤ 50 (constraint related to land) (1)
20x + 10y ≤ 800 (constraint related to herbicide)
i.e., 2x + y ≤ 80 (2)
x, y ≥ 0 (3)
Graph of the system of inequalities (1) to (3). The feasible region OABC is shown below:
Corner Point  Z = 10500x + 9000y 
A(0, 50)  450000 
B(30, 20)  495000 ← Maximum 
C(40, 0)  420000 
Hence, the society will get the maximum profit of Rs 4,95,000 by allocating 30 hectares for crop X and 20 hectares for crop Y.
Q.4 A retired person has Rs 70,000 to invest and two types of bonds are available in the market for investment. First type of bond yields an annual income of 8% on the amount invested and the second type of bonds yields 10% per annum. As per norms, he has to invest a minimum of Rs 10,000 in the first type and not more than Rs 30,000 in the second type. How should he plan his investment so as to get the maximum return, after one year of investment?
Ans
Let investment in first type of bond = Rs x
And investment in second type of bond = Rs y
Maximum return
(1)
Subject to the constraints
x + y ≤ 70,000 (2)
x ≥ 10,000 (3)
y ≤ 30,000 (4)
y ≥ 0 (5)
Graph the inequalities (2) to (4). The feasible region (shaded) is shown below:
Corner Point  Z = 0.08x + 0.1y 
A(10000, 0)  800 
B(10000, 30000)  3800 
C(40000, 30000)  6200 ← Maximum 
D(70000, 0)  5600 
Thus, the person will get the maximum return if he invests Rs 40,000 in the first type of bond and Rs 30,000 in the second type of bond.
Q.5 There are two factories, located one at place P and the other at place Q. From these locations, a certain commodity is to be delivered to each of the three depots situated at A, B and C. The weekly requirements of the depots are respectively 5, 5 and 4 units of the commodity while the production capacity of the factories at P and Q are respectively 8 and 6 units. The cost of transportation per unit is given below:
From/To  Cost (in Rs)  
A  B  C  
P  160  100  150 
Q  100  120  100 
How many units should be transported from each factory to each depot in order that the transportation cost is minimum. What will be the minimum transportation cost?
Ans
Let x units and y units of the commodity be transported from the factory at P to the depots at A and B respectively. Then (8 – x – y) units will be transported to depot at C.
$\begin{array}{l}\text{Hence, we have}\mathrm{x}\ge 0,\mathrm{y}\ge 0\text{and}8\mathrm{x}\mathrm{y}\ge 0\\ \mathrm{or}\text{\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}}\mathrm{x}\ge 0,\mathrm{y}\ge 0\text{and}\mathrm{x}+\mathrm{y}\le 8\\ \text{Now}(5\mathrm{x}),(5\mathrm{y})\text{and}6(5\mathrm{x}+5\mathrm{y})=\mathrm{x}+\mathrm{y}4\\ \text{units are to be transported from the factory at Q to the depots}\\ \text{at}\mathrm{A},\mathrm{B}\text{and C respectively.}\\ \text{Thus,}5\mathrm{x}\ge 0,\text{\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}5}\mathrm{y}\ge 0,\text{\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}and}\mathrm{x}+\mathrm{y}4\ge 0\\ \text{or\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}}\mathrm{x}\le 5,\text{\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}}\mathrm{y}\le 5,\text{\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}and\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}}\mathrm{x}+\mathrm{y}\ge 4\\ \text{Total transportation cost}\mathrm{Z}\text{is given by}\\ \mathrm{Z}=160\mathrm{x}+100\mathrm{y}+100(5\mathrm{x})+120(5\mathrm{y})+100(\mathrm{x}+\mathrm{y}4)+150(8\mathrm{x}\mathrm{y})\\ \text{\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}}=10(\mathrm{x}\u20137\mathrm{y}+190)\\ \text{Minimise}\mathrm{Z}=10(\mathrm{x}\u20137\mathrm{y}+190)\\ \text{subject to the constraints:}\\ \mathrm{x}\ge 0,\mathrm{y}\ge 0\text{\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}}...\left(1\right)\\ \mathrm{x}+\mathrm{y}\le 8\text{\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}}...\left(2\right)\\ \mathrm{x}\le 5\text{\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}}...\left(3\right)\\ \mathrm{y}\le 5\text{\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}}...\left(4\right)\\ \text{and}\mathrm{x}+\mathrm{y}\ge 4\text{\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}}...\left(5\right)\end{array}$Z=10(x – 7y + 190)  
A(0, 4)  1620 
B(0, 5)  1550 ← Minimum 
C(3, 5)  1580 
D(5, 3)  1740 
E(5, 0)  1950 
F(4, 0)  1940 
Hence, the optimal transportation strategy will be
From/To  Units  
A  B  C  
P  0  5  3 
Q  5  0  1 
Q.6 A catering agency has two kitchens to prepare food at two places A and B. From these places ‘Midday Meal’ is to be supplied to three different schools situated at P, Q, R. The monthly requirements of the schools are respectively 40, 40 and 50 food packets. A packet contains lunch for 1000 students. Preparing capacity of kitchens A and B are 60 and 70 packets per month respectively. The transportation cost per packet from the kitchens to schools is given below:
From/To  Cost (in Rs)  
P  Q  R  
A  5  4  3 
B  4  2  5 
How many packets from each kitchen should be transported to school so that the cost of transportation is minimum? Also find the minimum cost.
Ans
Let x packets and y packets be transported from the kitchen at A to the schools at P and Q respectively. Then (60 – x – y) packets will be transported to school at R.
$\begin{array}{l}\text{Hence, we have}\mathrm{x}\ge 0,\mathrm{y}\ge 0\text{and}60\mathrm{x}\mathrm{y}\ge 0\\ \mathrm{or}\text{\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}}\mathrm{x}\ge 0,\mathrm{y}\ge 0\text{and}\mathrm{x}+\mathrm{y}\le 60\\ \text{Now}(40\mathrm{x}),(40\mathrm{y})\text{and}70(40\mathrm{x}+40\mathrm{y})=\mathrm{x}+\mathrm{y}10\\ \text{units are to be transported from the kitchen at B to the schools}\\ \text{at}{\mathrm{P}}_{\mathrm{t}}\mathrm{Q}\text{and}\mathrm{R}\text{respectively.}\\ \text{Thus,}40\mathrm{x}\ge 0,\text{\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}}40\mathrm{y}\ge 0,\text{\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}and}\mathrm{x}+\mathrm{y}10\ge 0\\ \text{or\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}}\mathrm{x}\le 40,\text{\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}}\mathrm{y}\le 40,\text{\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}and\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}}\mathrm{x}+\mathrm{y}\ge 10\\ \text{Total transportation cost}\mathrm{Z}\text{is given by}\\ \mathrm{Z}=5\mathrm{x}+4\mathrm{y}+4(40\mathrm{x})+2(40\mathrm{y})+5(\mathrm{x}+\mathrm{y}10)+3(60\mathrm{x}\mathrm{y})\\ \text{\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}}=3\mathrm{x}+4\mathrm{y}+370\\ \text{Minimise}\mathrm{Z}=3\mathrm{x}+4\mathrm{y}+370\\ \text{subject to the constraints:}\\ \mathrm{x}\ge 0,\mathrm{y}\ge 0\text{\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}}...\left(1\right)\\ \mathrm{x}+\mathrm{y}\le 60\text{\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}}...\left(2\right)\\ \mathrm{x}\le 40\text{\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}}...\left(3\right)\\ \mathrm{y}\le 40\text{\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}}...\left(4\right)\\ \text{and}\mathrm{x}+\mathrm{y}\ge 10\text{\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}}...\left(5\right)\end{array}$Corner Point  Z = 3x + 4y + 370 
A(0, 10)  410 
B(0, 40)  530 
C(20, 40)  590 
D(40, 20)  570 
E(40, 0)  490 
F(10, 0)  400 ← Minimum 
Hence, the optimal transportation strategy is
From/To  Packets  
P  Q  R  
A  10  0  50 
B  30  40  0 
Q.7 A dietician has to develop a special diet using two foods P and Q. Each packet (containing 30 g) of food P contains 12 units of calcium, 4 units of iron, 6 units of cholesterol and 6 units of vitamin A. Each packet of the same quantity of food Q contains 3 units of calcium, 20 units of iron, 4 units of cholesterol and 3 units of vitamin A. The diet requires at least 240 units of calcium, atleast 460 units of iron and at most 300 units of cholesterol. How many packets of each food should be used to minimise the amount of vitamin A in the diet? What is the minimum amount of vitamin A?
Ans
Let x and y be the number of packets of food P and Q respectively. Mathematical formulation of the given problem is as follows:
Minimise Z = 6x + 3y (vitamin A)
subject to the constraints
12x + 3y ≥ 240 (constraint on calcium), i.e., 4x + y ≥ 80 (1)
4x + 20y ≥ 460 (constraint on iron), i.e., x + 5y ≥ 115 (2)
6x + 4y ≤ 300 (constraint on cholesterol), i.e., 3x + 2y ≤ 150 (3)
x, y ≥ 0 (4)
Graph the inequalities (1) to (4). The feasible region (shaded) determined by the constraints (1) to (4) is shown in the graph below:
The coordinates of the corner points A, B and C are (2, 72), (15, 20) and (40, 15) respectively.
Corner Point  Z = 6x + 3y 
A(2, 72)  228 
B(15, 20)  150 ← Minimum 
C(40, 15)  285 
The amount of vitamin A under the constraints given in the problem will be minimum, if 15 packets of food P and 20 packets of food Q are used in the special diet. The minimum amount of vitamin A will be 150 units.
Q.8 Solve the following linear programing problem graphically:
Maximise Z = 60x + 15y
Subject to constraints
x + y ≤ 50
3x + y ≤ 90
x, y ≥ 0
Ans
(1)
Subject to constraints
x + y ≤ 50 (2)
3x + y ≤ 90 (3)
x, y ≥ 0 (4)
Graph the inequalities (2), (3) and (4). The feasible region (shaded) is shown below:
Corner Point  Z = 60x +15y 
A(0, 50)  750 
B(20, 30)  1650 
C(30, 0)  1800←Maximum 
The maximum value of Z on the feasible region occurs at x = 30 and y = 0.
Q.9 Solve the following linear programing problem graphically:
Maximise Z = 5x + 3y
Subject to constraints
3x + 5y ≤ 15
5x + 2y ≤ 10
x, y ≥ 0
Ans
Maximise Z = 5x + 3y (1)
Subject to constraints
3x + 5y ≤ 15 (2)
5x + 2y ≤ 10 (3)
x, y ≥ 0 (4)
Graph the inequalities (2) to (4). The feasible region OABC is shown below:
Corner Point  Z = 5x + 3y 
A(0, 3)  9 
B (20/19, 45/19) 
$12\frac{7}{9}$
← Maximum 
C(2, 0)  10 
The maximum value of Z on the feasible region occurs at x = 20/19 and y = 45/19.
Q.10 Solve the following linear programing problem graphically:
Minimise Z = 3x + 2y
Subject to constraints
5x + y ≥ 10
x + y ≥ 6
x + 4y ≥ 12
x, y ≥ 0
Ans
x + 4y ≥ 12 (4)
x, y ≥ 0 (5)
Graph the inequalities (2) to (5). The feasible region (shaded) is shown as below:
Corner Point  Z = 3x + 2y 
A(0, 10)  20 
B(1, 5)  13←Minimum 
C(4, 2)  16 
D(12, 0)  36 
Thus, Z is minimum at x = 1 and y = 5.
Q.11 A dietician wishes to mix two types of foods in such a way that vitamin contents of the mixture contain atleast 8 units of vitamin A and 10 units of vitamin C. Food ‘I’ contains 2 units/kg of vitamin A and 1 unit/kg of vitamin C. Food ‘II’ contains 1 unit/kg of vitamin A and 2 units/kg of vitamin C. It costs Rs 50 per kg to purchase Food ‘I’ and Rs 70 per kg to purchase Food ‘II’. Formulate and solve this problem as a linear programming problem to minimise the cost of such a mixture.
Ans
Resources

Food  Diet requirement  
I
(x) 
II
(y) 

Vitamin A (units/kg)  2  1  8 
Vitamin C (units/kg)  1  2  10 
Cost(Rs/kg)  50  70 
Minimise cost: Z = 50x + 70y (1)
Equation of vitamin A
2x + y ≥ 8 (2)
Equation of vitamin C
x + 2y ≥ 10 (3)
x, y ≥ 0 (4)
Graph the inequalities (2) to (4). The feasible region determined by the system is shown below:
Z = 50x + 70y  
A(0, 8)  560 
B(2, 4)  380 ← Minimum 
C(10, 0)  500 
Hence, the optimal mixing strategy for the dietician would be to mix 2 kg of Food ‘I’ and 4 kg of Food ‘II’, and with this strategy, the minimum cost of the mixture will be Rs 380.
Q.12 An aeroplane can carry a maximum of 200 passengers. A profit of Rs 1000 is made on each executive class ticket and a profit of Rs 600 is made on each economy class ticket. The airline reserves at least 20 seats for executive class. However, at least 4 times as many passengers prefer to travel by economy class than by the executive class. Determine how many tickets of each type must be sold in order to maximise the profit for the airline. What is the maximum profit?
Ans
Let x = Number of executive class tickets sold
and y = Number of economy class tickets sold
Maximum profit: Z = 1000x + 600y (1)
20 tickets for executive class are reserved (given)
⇒ x ≥ 20
The number of economy class tickets is at least 4 times of executive class tickets
⇒ y ≥ 4x
Total tickets are 200
⇒ x + y ≤ 200
Points lie on x + y ≤ 200
Corner Points  Z = 100x + 600y 
A(20, 180)  128000 
B(40, 160)  136000 ← Maximum 
C(20, 80)  68000 
Thus, 40 tickets of executive class and 160 tickets of economy class should be sold to maximize the profit and the maximum profit is Rs 1,36,000.
Q.13 If a young man rides his motorcycle at 25 km/hour, he had to spend Rs 2 per km on petrol. If he rides at a faster speed of 40 km/hour, the petrol cost increases at Rs 5 per km. He has Rs 100 to spend on petrol and wishes to find what is the maximum distance he can travel within one hour. Express this as an LPP and solve it graphically. write one important role of wisely used petrol.
Ans
Let the young man ride with the speed 25 km/hr for x hours and with the speed 40 km/hr for y hours respectively.
Money spent at speed 25 km/hr = 50x
And Money spent at speed 40 km/hr = 200y
Maximum distance
Z = 25x + 40y (1)
subject to the constraints
x + y ≤ 1 (2)
50x + 200y ≤ 100 (3)
x , y ≥ 0 (4)
Graph the inequalities (2) to (4). The feasible region (shaded) is shown as below:
Corner Point  Z = 25x + 40y 
A (0, 1/2)  20 
B (2/3, 1/3)  30← Maximum 
C(1, 0)  25 
Thus, the maximum distance he can travel is 30 km.
Saving of petrol plays very important role in our life. By using it wisely we can save misuse of fossil fuel and also help in cleaning our environment from the pollution of produced by burning of petrol.
Q.14 Define optimisation problems.
Ans
Certain type problems that seek to maximise (or minimise) profit (or cost) form a general class of problems called optimisation problems.
Q.15 Define linear constraints.
Ans
A set of linear inequalities is called linear constraints.
Q.16 What do you mean by the word ‘programming’ in ‘linear programming’?
Ans
The term programming refers to the method of determining a particular programme or a plan of action.
Q.17 Define an objective function.
Ans
Linear function Z = ax + by, where a, b are constraints that have to be maximised or minimised, is called a linear objective function.
Q.18 What are decision variables?
Ans
In linear function Z = ax + by, x and y are called decision variables.
Q.19 Define overriding conditions.
Ans
The linear inequalities, equations or restrictions on the variables of a linear programming problem are called constraints.
Q.20 Define feasible region.
Ans
The common region determined by all the constraints including nonnegative constraints x, y ≥ 0, of a linear programming problem is called feasible region.
Q.21 A firm makes items A and B. The total number of items it can make in a day is 24. It takes one hour to make an item of A and only half an hour to make an item of B. The maximum time available per day is 16 hours. The profit on an item of A is Rs. 300 and on one item of B is Rs.160. How many items of each type should be produced to maximise the profit? Solve the problem graphically.
Ans
Let x items of A and y items of B are produced per day.
According to the given condition,
x ≥ 0, y ≥ o, x + y ≤ 24 and x + ½ y ≤ 16 ⇒ 2x + y ≤ 32
Max. profit Z = 300 x + 160 y
Plotting these inequations on the graph, we get
shaded portion as the optimum solution.
Maximum profit can be at the points A(16,0), B(8,16) and C(0,24).
Profit is maximum at point B (8, 16), i.e., x = 8, y = 16.
Hence, 8 items at A and 16 items of B must be produced to get maximum profit.
Q.22 Name three important linear programming problems.
Ans
(i) Diet Problems
(ii) Manufacturing Problems
(iii) Transportation Problems
Q.23 What is infeasible solution to the problem?
Ans
Any point outside the feasible region is called an infeasible solution to the problem.
Q.24 Define feasible solution to the problem.
Ans
Every point of feasible region is called feasible solution to the problem.
Q.25 A manufacturer manufactures two types of steel trunks. He has two machines – A and B. For completing the first type of trunk, it requires 3 hours on machine A and 1 hour on machine B. Machine A can work for 18 hours and B for 8 hours only per day. There is a profit of Rs.30 on the first type of trunk and Rs. 48 on the second type of trunk. How many trunks of each type should be manufactured every day to earn maximum profit? Solve graphically.
Ans
Let the number of A type steel trunk be x per day and number of B type steel trunk be y per day. According to the given conditions, L.P.P. is
x ≥ 0, y ≥ 0 … (1)
3x + 3y ≤ 48 ⇒ x + y ≤ 6 … (ii)
x + 2y ≤ 8 … (iii)
and to maximise Z = 30x + 48y
Plotting these inequations on the graph, we get
We get a shaded portion as the optimum solution. Maximum profit can be at the points A(6, 0), B(4, 2) and C(0, 4).
$\begin{array}{lll}\hline \text{Points}& \text{Z = 30x + 48y}& \text{Value}\\ \text{A(6, 0)}& 180+0& \text{180}\\ \text{B(4, 2)}& \text{120 + 96}& \text{216 [Maximum]}\\ \text{C(0, 4)}& 0+192& 192\\ \hline\end{array}$We notice maximum profit is at B (4, 2), i.e., x = 4, y = 2.
Hence, 4 trunks of type I and 2 trunks of type II must be manufactured each day to get a maximum profit of Rs. 216.
Q.26 A firm deals with two kinds of fruit juices – pineapple and orange juice. These are mixed and two mixtures are sold as soft drinks A and B. One tin of A requires 4 litres of pineapple and 1 litre of orange juice. One tin of B requires 2 litres of pineapple and 3 litres of orange juice. The firm has only 46 litres of pineapple juice and 24 litres of orange juice. Each tin of A and B is sold at a profit of Rs. 4 and Rs. 3 respectively. How many tins of each type should the firm produce to maximise the profit? Solve the problem graphically.
Ans
Let the number of tins of A be x and that of B be y.
According to the given conditions, the L.P.P. is
x ≥ 0, y ≥ 0 … (1)
4x + 2y ≤ 46 ⇒ 2x + y ≤ 23 … (2)
x + 3y ≤ 24 … (3)
and to maximise Z = 4x + 3y.
Plotting the inequations (i), (ii) and (iii) on the graph,
We get the shaded portion as the optimum solution. Possible points for maximum profit are A(23/2,0), B(9,5) and C(0,8)
$\begin{array}{lll}\hline \text{Points}& \mathrm{Z}=4\mathrm{x}+3\mathrm{y}& \text{Value}\\ \text{A}\left(\frac{23}{2},\text{\hspace{0.33em}}0\right)& 46+0& 46\\ \text{B(9, 5)}& 36+15& \text{51 [maximum]}\\ \text{C(0, 8)}& 0+24& 24\\ \hline\end{array}$We notice profit is maximum at B (9,5), i.e., x = 9, y = 5.
Hence, 9 tins of A and 5 tins of B should be produced.
Q.27 Two tailors A and B earn Rs. 15 and Rs. 20 per day respectively. A can stitch 6 shirts and 4 pants per day, while B can stitch 10 shirts and 4 pants per day. How many days shall each work if it is desired to produce at least 60 shirts and 32 pants at a minimum labour cost? Solve the problem graphically.
Ans
Let the tailors A and B work for x and y days respectively. The required L.P.P. is
6x + 10y ≥ 60 or 3x + 5y ≥ 30 … (1)
4x + 4y ≥ 32 or x + y ≥ 8 … (2)
x ≥ 0, y ≥ 0
To minimise Z = 15 x + 20 y
Plotting the inequations (i), (ii) and (iii) on the graph,
Now, drawing the lines 3x + 5y = 30, which is the line AB and of line x + y = 8, which is the line CD.
These lines intersect at E (5, 3).
The shaded unbounded region is the feasible region.
Hence, Z is minimum at E(5, 3), i.e., x = 5, y = 3 and the minimum cost is Rs. 135.
So, tailor A should work for 5 days and tailor B should work for 3 days.
Q.28 A man has Rs. 1,500 for purchase of rice and wheat. A bag of rice and a bag of wheat cost Rs. 180 and Rs. 120 respectively. He has a storage capacity of 10 bags only. He earns a profit of Rs. 11 and Rs. 9 respectively per bag of rice and wheat. Formulate it as a linear programming problem and solve it graphically for maximum profit.
Ans
Let the man purchases x bags of rice and y bags of wheat. So, the objective function is to minimise Z = 11x + 9y
Subject to constraints,
x + y ≤ 10 … (i)
180x + 120y ≤ 1500
i.e., 3x + 2y ≤ 25 … (ii)
x ≥ 0, y ≥ 0 … (iii)
Plotting the inequations (i), (ii) and (iii) on the graph,
The feasible region of L.P.P. is the shaded region.
Maximum profit can be at the points A(25/2,0), P(5,5) and B(0,10).
The value of the objective function at these points is given:
Z is maximum at x = 5 and y = 5.
Hence, for the maximum profit, he will purchase 5 bags of rice and 5 bags of wheat.
Q.29 Solve the following linear programming problem graphically:
Maximise Z = 60x+15y
Subject to constraints
x + y ≤ 50
3x + y ≤ 90
x, y ≥ 0
Ans
We have,
Maximise Z = 60x + 15y
Subject to constraints,
x + y ≤ 50 … (i)
3x + y ≤ 90 … (ii)
x ≥ 0, y ≥ 0 … (iii)
Plotting the inequations (i), (ii) and (iii) on the graph,
From the graph, it is clear that the shaded portion is the optimum solution. Possible points for maximum Z are A(30,0), B(20,30) and C(0,50).
$\begin{array}{lll}\hline \text{Points}& \text{Z = 60x + 15y}& \text{Value}\\ \text{A(30, 0)}& 1800+0& \text{1800 [Maximum]}\\ \text{B(20, 30)}& \text{1200 + 450}& 1650\\ \text{C(0, 50)}& 0+750& 750\\ \hline\end{array}$Hence, Z is maximum at A(30, 0), i.e., x = 30, y = 0.
Q.30 A manufacturer produces two types of steel trunks. He has two machines A and B. The first type of trunk requires 3 hours on machine A and 3 hours on machine B. The second type of trunk requires 3 hours on machine A and 2 hours on machine B. Machines A and B run daily for 18 hours and 15 hours respectively. There is a profit of Rs. 30 on the first type of trunk and Rs. 25 on the second type of trunk. How many trunks of each type should be produced and sold to make a maximum profit?
Ans
Let x trunks of type I and y trunks of type II are produced.
According to the given condition,
Maximise Z = 30x + 25y
3x + 3y ≤ 18
i.e., x + y ≤ 6 … (i)
3x + 2y ≤ 15 … (ii)
x ⇒ 0, y ⇒ 0 … (iii)
Put (0,0) in x + y ≤ 6 ⇒ 0 ≤ 6, true.
So, shaded portion contains (0,0).
Put (0,0) in 3x + 2y ≤ 15 ⇒ 0 ≤ 15, true.
So, shaded portion contains (0,0).
Plotting the inequations (i), (ii) and (iii) on the graph,
Since the shaded portion represents the optimum solution, the possible points for maximum Z are A(5,0), B(3,3) and C(0,6).
$\begin{array}{lll}\hline \text{Point}& \text{Z = 30x + 25y}& \text{Value}\\ \text{A(5, 0)}& 150+0& 150\\ \text{B(3, 3)}& \text{90 + 75}& \text{165 [Maximum]}\\ \text{C(0, 6)}& 0+150& 150\\ \hline\end{array}$We notice profit is maximum at B(3,3), i.e., x = 3, y = 3.
Hence, 3 trunks of each type should be produced to get a maximum profit of Rs. 165.
Q.31 A dealer wishes to purchase a number of fans and sewing machines. He has only Rs. 5,760 to invest and has space for at the most 20 items. A fan and sewing machine cost Rs. 360 and Rs. 240 respectively. He can sell a fan at a profit of Rs. 22 and sewing machine at a profit of Rs. 18. Assuming that he can sell whatever he buys, how should he invest his money in order to maximise his profit? Translate the problem into LPP and solve it graphically.
Ans
Let a man purchases x fans and y sewing machines.
According to given condition, L.P.P. is
To maximise Z= 22x + 18y
Subject to constraints,
x ≥ 0, y ≥ 0 … (i)
x + y ≤ 20 … (ii)
360x + 240y ≤ 5760
i.e., 3x + 2y ≤ 48 …(iii)
Let the equation be x + y = 0.
Some points on graph are:
Let the equation be 3x + 2y = 48
y = ( 48 – 3x)/2
Some points on graph are:
Substituting (0,0) in x + y ≤ 20 and 3x + 2y ≤ 48, we notice both inequations are true.
On plotting the above information on graph,
We notice that the shaded portion represents the optimum solution. Possible points for maximum Z are A (16,0), B(8,12) and C(0,20).
$\begin{array}{lll}\hline \text{Point}& \text{Z = 22x + 18y}& \text{Value}\\ \text{A(16, 0)}& 352+0& 352\\ \text{B(8, 12)}& \text{176 + 216}& \text{392 [Maximum]}\\ \text{C(0, 20)}& 0+360& 360\\ \hline\end{array}$We notice Z is maximum for (8, 12), i.e., x = 8, y = 12.
Hence, man should purchase 8 fans and 12 sewing machines for a maximum profit of Rs. 392.
Q.32 A shopkeeper sells only tables and chairs. He has only Rs. 6,000 to invest and has space for at the most 20 items. A table costs him Rs. 400 and a chair Rs. 250. He can sell the table at a profit of Rs. 25 and the chair for a profit of Rs. 40. Suppose, he can sell whatever he buys. Formulate the problem as LPP and solve it graphically for maximum profit.
Ans
Let the shopkeeper can sell ‘x’ tables and ‘y’ chairs. According to the given condition,
L.P.P. is to maximise Z = 25x + 40y
Subject to constraints,
x ≥ 0,y ≥ 0 … (i)
x + y ≤ 20 … (ii)
400x + 250y ≤ 6000
⇒ 8x + 5y ≤ 120 … (iii)
On plotting the above information on graph,
We notice that the shaded portions represent the optimum solution. Possible points for maximum Z are A(15,0), B(20/3,40/3) and C(0,20).
$\begin{array}{lll}\hline \text{Points}& \text{Z = 25x + 40y}& \text{Value}\\ \text{A(15, 0)}& 375+0& 375\\ \text{B(20/3, 40/3)}& \text{(500/3) + (1600/3)}& \text{700}\\ \text{C(0, 20)}& 0+800& \text{800 [Maximum]}\\ \hline\end{array}$Hence, the shopkeeper must buy only 20 chairs and no tables for a maximum profit of Rs.800.Z is maximum at C (0,20), i.e., x = 0, y = 20.
Q.33 If a young man rides his motorcycle at 25 km/hr, he has to spend Rs. 2 per km on petrol. If he rides at a faster speed of 40 km/hr, the petrol cost increases at Rs. 5 per km. He has Rs. 100 to spend on petrol and wishes to find the maximum distance that he can travel in one hour. Express this as an LPP and solve it graphically.
Ans
Let the young man travels x km at 25 km/hr and y km at 40 km/hr. According to the given conditions, L.P.P. is to maximise Z = x + y,
Subject to constraints,
x ≥ 0,y ≥ 0 … (i)
x/25 + y/40 ≤ 1 … (ii)
2x + 5y ≤ 100 …(iii)
On plotting the above information on graph,
Since the shaded portion is the optimum solution, the possible points for maximum distance are A(25, 0); B( 50/3, 40/3); C(0, 20).
$\begin{array}{lll}\hline \text{Points}& \text{Z = 25x + 40y}& \text{Value}\\ \text{A(25, 0)}& 25+0& 25\\ \text{B(50/3, 40/3)}& \text{(50/3) + (40/3)}& \text{30 [Maximum]}\\ \text{C(0, 20)}& 0+20& 20\\ \hline\end{array}$Distance is maximum at B( 50/3, 40/3), i.e., x = 50/3 and y = 40/3. Hence, the young man rides 50/3 km at 25 km/hr and 40/3 km at 40 km/hr for maximum distance of 30 km.
Q.34 A factory owner purchases two types of machines – A and B for his factory. The requirements and the limitations for the machines are as follows:
$\begin{array}{cccc}\hline \text{Machine}& \begin{array}{l}\text{Area}\\ \text{occupied}\end{array}& \begin{array}{l}\text{Labour}\\ \text{force}\end{array}& \begin{array}{l}\text{Daily output}\\ \text{(in units)}\end{array}\\ \mathrm{A}& 1000\text{\hspace{0.33em}}{\mathrm{m}}^{2}& 12\text{\hspace{0.33em}}\mathrm{men}& 60\\ \mathrm{B}& 1200\text{\hspace{0.33em}}{\mathrm{m}}^{2}& 8\text{\hspace{0.33em}}\mathrm{men}& 40\\ \hline\end{array}$He has maximum area of 9000 m^{2} available, and 72 skilled labourers who can operate both the
machines. How many machines of each type should he buy to maximise the daily output?
Ans
Let number of A type machine = x
and number of B type machine = y
Area required for A type machine = 1000 m^{2}
Area required for A type machine = 1200 m^{2}
Then, L.P.P. of given conditions are
Maximum Z = 60x + 40y
Subject to constraints,
x ≥ 0,y ≥ 0 … (i)
1000 x + 1200 y ≤ 9000
⇒ 5x + 6y ≤ 45 … (ii)
12x+8y ≤ 72
⇒ 3x +2y ≤ 18 … (iii)
Plotting the inequations (i), (ii) and (iii) on the graph,
Since shaded portion is the optimum solution, the possible points for maximum output are A(6, 0), B( 9/4, 45/8) and C(0, 15/2).
$\begin{array}{lll}\hline \text{Points}& \mathrm{Z}=60\mathrm{x}+40\mathrm{y}& \text{Value}\\ \text{A(6, 0)}& 360+0& \text{360 [maximum]}\\ \text{B(9/4, 45/8)}& 135+225& \text{360 [maximum]}\\ \text{C(0, 15/2)}& 0+300& 300\\ \hline\end{array}$Maximum output will be at A( 6, 0) or B(9/4, 45/8). Hence, 6 machines of type A or 9/4 ~ 2 machines of type A and 45/8 ~ 6 machines of type B should be purchased.
Q.35 A mobile company make two models (Beta10 and Beta20) of mobile phones. Each piece of model Beta10 requires 6 hours of assembling and 1 hour of packaging. Each piece of model Beta20 requires 7 hours of assembling and 1.5 hours of packaging. In a week, for assembling and packaging, the maximum working hours available are 150 and 40 respectively. The company makes a profit of ₹5000 on each piece of model Beta10 and ₹4000 on each piece of model beta20. How many pieces of model Beta10 and Beta20 should be manufactured per week to realize a maximum profit? What is the maximum profit per week?
Ans
Corner Point  Z = 5000x + 4000y 
0(0, 0)  0 
$\text{A}\left(0,\text{\hspace{0.33em}}\frac{150}{7}\right)$  Z = 5000(0) + 4000
$\left(\frac{150}{7}\right)$
= ₹ 85714.28 
D (25, 0)  Z = 5000(25) + 5000(o)
= ₹125,000 
FAQs (Frequently Asked Questions)
1. Where can I get Class 12 Chapter 12 Mathematics notes online?
The Class 12 Mathematics Chapter 12 notes are available on the Extramarks website. The solutions to various problems are provided by experts in a detailed manner. The notes are considered one of the best reference materials to depend on. Students can refer to these solutions and get a clear idea about different tips and strategies to answer the problems quickly.
2. What are the best reference books for Class 12 Mathematics?
NCERT books and other reference books are essential for students’ exam preparation. Below are some of the best reference books which students can consider referring to:
 Senior Secondary School Mathematics by RS Agarwal
 Mathematics for Class 12 by RD Sharma
 NCERT Solutions for Mathematics by Arihant
 Xam Idea Mathematics