OPTIMAL STRATEGIES Including

FOR ACHIEVING A Daily Practice Paper

PERFECT SCORE OF NCERT Solutions
100/100 IN YOUR Line by Line Questions
EXAMS Previous year Question Papers
Chapter Wise Mind Maps
Commence your study session equipped
with our meticulously crafted chapter-wise
and topic-wise notes, designed to optimize
your exam performance, exclusively AS PER LATEST CBSE
provided by Artham Resources.
CURRICULLUM 2024-25

WWW.EDUCATORSRESOURCE.IN
Page 1
Class 12th Mathematics

12 LINEAR PROGRAMMING
INDEX

Chapter 12: Linear Programming

Concepts Covered:
1. Optimisation problems
2. Linear programming problems
➢ Corner point method
3. Mathematical formulation of LPP
➢ Objective function
➢ Constraints
➢ Optimisation problems
➢ Decision variables
4. Graphical method of solving linear programming problems
5. Different types of linear programming problems
➢ Manufacturing problems
➢ Diet problems
➢ Transportation problems
6. Mind Map
➢ (Colourful & Interactive/ Complete All Concept Covered)
Practice Questions (All Topics Available)
Page 1
Class 12th Mathematics

12 LINEAR PROGRAMMING
OPTIMISATION PROBLEMS

OPTIMISATION PROBLEMS
The constraint may be determined in the form of an equation. So, optimization is determining the
best possible solution to a given problem within these specified constraints from the set of all other
alternate solutions. You’ll be looking for either the highest value or the lowest value for a function.
The constraint will be represented in the form of an equation.

No matter the solution, the constraint needs to be satisfied. One of the quantities will be constant
throughout the problem. You need to determine the quantity that needs to be optimize. Once that
is done, you can move on with the further calculations.

If x and y are the number of bats and balls a shopkeeper purchases, then x ≥ 0 and y ≥ 0. And if they
have a storage capacity of 50 units in total, then.

x + y ≤ 50

Now, if the cost of a bat and a ball is 350 and 50 respectively and the total money the shopkeeper
can invest is 5000, then

350x + 50y ≤ 5000

7x + y ≤ 100

When the shopkeeper sells a bat and a ball, the profit earned on each is π50 and π15, respectively.

Z = 50x + 15y

So, the problem comes down to

Maximize Z = 50x + 15y

with respect to the constraints

Page 2
Class 12th Mathematics

12 LINEAR PROGRAMMING
OPTIMISATION PROBLEMS

x≥0

y≥0

x + y ≤ 50

7x + y ≤ 100

Use Mathematical Optimization

Optimization is the process of coming to the best solution in a given situation. This enables us to
understand all the factors affecting the solution, which leads to a better decision-making strategy.
Mathematical Optimization is beneficial as it can help maximize profit, limit resources, minimize cost,
increase efficiency, and help to understand the changes in the output for varied input.

The three main components of mathematical optimization are Decision Variables, Objective
Function, and Constraints.

Decision Variables

A decision variable is a physical quantity represented by a mathematical symbol. The decision

variables, as it suggests, can vary and are chosen by the decision-maker. An example of a decision
variable is the number of units to be produced by a company.

Objective Function

A mathematical function is that which consists of decision

variables and is a numerical representation of the solution. The
objective function can represent profit, or the cost based on the products
included.

Constraints

Constraints are the limitations on the value that decision variables can have. An
example of a constraint is the number of hours a machine can work each day.

Mathematical Optimization in Day-to-Day Life

Mathematical Optimization is used by businesses to increase production and to

increase their profit margins. Some places where mathematical optimization is applied are:

• It is used by GPS systems and by shipping companies to deliver packages.

• It is also used by businesses to improve various functions, like manufacturing rates, supply
chain, transportation, logistics, and inventory control.
• It is applied in the fields of medicine, finance, artificial intelligence, physics, economics,
operations research, etc.
Page 1
Class 12th Mathematics

12 LINEAR PROGRAMMING
LINEAR PROGRAMMING PROBLEMS

LINEAR PROGRAMMING PROBLEMS

A Linear Programming Problem (or LPP) is the problem that’s concerned with achieving the most
effective optimal (maximum or minimum) value of a linear function with several variables (called
objective function). LLP has some conditions like the variables are non-negative and satisfy a
collection of linear inequalities (also referred to as linear constraints). These variables are sometimes
called decision variables and are non-negative. Linear Programming Problems mostly include
manufacturing problems, diet problems and transportation problems.

The graph of any linear equation has two variables. To verify the equation, we need to plot
coordinate points. Besides, in linear programming, we have two or more simultaneous linear
equations, and then we need to find the range of the solutions from the given conditions.

For Example: The problem is to maximize the profit function z = 40x + 15y with respect to the
constraints

x + 2y less than or equal to 100

x + 2y less than or equal to 70

x greater than or equal to 0, y

Solution Step-1: We can find that the above equation has x greater than or equal to 0, and y greater
than or equal to 0. Hence, we need to focus only on the first quadrant.

Solution Step-2: First, we will try to plot the equation x + 2y = 100 from the given coordinate points
(0, 50) and (100, 0). Then, let's plot the equation x + y = 70 using the coordinate point (70, 0) and (0,
70).
Page 2
Class 12th Mathematics

12 LINEAR PROGRAMMING
LINEAR PROGRAMMING PROBLEMS

Point Z = 2x + 5y
1 (0,0) 0
2 (0, 8) 40
3 (6, 5) 37
4 (9, 0) 18

Linear Programming Graph 1

Plotting the two equations produced the above-mentioned graph.

Now, we need to identify the feasible region of the graph, which is nothing, but the common region
determined through all the given constraints. So, the feasible region is shown in the below graph.

Linear Programming Graph 2

X + 3y = 6

5x + 2y = 10

X = 6 – 3y

5(6 – 3y) + 2y = 10

30 – 15y + 2y = 10

-13y = -20

Y= 1.54

X = 6 - 3 (1.54)
Page 3
Class 12th Mathematics

12 LINEAR PROGRAMMING
LINEAR PROGRAMMING PROBLEMS

X = 1.38

So, every point within the feasible region will satisfy all the given conditions of the linear
programming. On the other hand, any point outside the given feasible region is an infeasible solution
and will not satisfy all the conditions.

In addition, we know that the coordinates x and y will satisfy the given conditions of the problem.
So, the graphical solutions can be used to optimize the solution of the given problem. Here, the
optimal solution is nothing but the maximum and minimum value of the objective function. Further,
we can find that there are more infinite points. So, there is a challenge in resolving the solutions to
the given function z = 40x + 15y?

So, to find out the exact solution, we will follow the below given mathematical problem.

Theorem 1

Consider “R” to be the feasible region of a linear programming problem. Then, let
z = Ax + B be the objective function of the given problem. So, the optimal
value of Z will appear at the corner point (vertex) of the feasible region.
Hence, the optimal value (maxima or minima) Z exists along the x and y variables
which are described by the linear inequalities.

Theorem 2

Consider “R” to be the feasible region of a linear programming problem. Then, z =

Ax + By is an objective function. So, if “R” is bounded, then the Z has both minimum
and maximum value over R, and each of these occur at vertex points (corner).

Similarly, if the “R” is unbounded. Then, the maximum and minimum value of Z
won’t exist at R. In some special cases, if it exists then it will appear at the corner (vertex) points of
the R region.

So, from the above given linear programming problem, we have the following corner points (0, 0),
(70, 0), (40, 30), and (0, 50).

Then, substituting the above coordinate point in the equation of objective function z = 40x + 15y, we
get

For (0, 0) we get Z = 0

For (70, 0), we get Z = 2800

For (40, 30), we get Z = 2050

For (0, 50), we get Z = 750

Page 4
Class 12th Mathematics

12 LINEAR PROGRAMMING
LINEAR PROGRAMMING PROBLEMS

Henceforth, the maximum value of Z appears at (70, 0) and the minimum value appears at (0, 0).

This is the required solution of the linear programming problem.

Corner Point Method

The corner point method tells that, if a maximum or minimum value is there, then it’ll come at a
corner point of the feasible region.

Steps to Apply Corner Point Method

To apply the corner point method the below-mentioned steps must be applied:

Step 1: Find the feasible region of the linear programming problem and find its corner points by
solving the formed two equations of the lines intersecting at that point.

Step 2: Determine the objective function z = ax + by at each point. Let M and m to denote the largest
and the smallest values of those points.

Step 3: If the feasible region is bounded, then M and m are the maximum and minimum values of
the objective function at corner points.

Step 4: If two corner points of the feasible region are of the identical type, i.e., both produce the
identical maximum or minimum value, then any point which is on the line segment joining these two
points is also an optimal solution of the identical type.
Page 1
Class 12th Mathematics

12 LINEAR PROGRAMMING
MATHEMATICAL FORMULATION OF LPP

MATHEMATICAL FORMULATION OF LPP

Formulation of an LPP refers to translating the real-world problem into the form of mathematical
equations which could be solved. It usually requires a thorough understanding of the problem.

Formulation of Linear Programming problem

• Identify the ‘n’ number of decision variables which govern the behaviour of the objective
function (which needs to be optimized).
• Identify the set of constraints on the decision variables and express them in the form of linear
equations/ inequations. This will set up our region in the n-dimensional space within which
the objective function needs to be optimized. Don’t forget to impose the condition of non-
negativity on the decision variables i.e., all of them must be positive since the problem might
represent a physical scenario, and such variables can’t be negative.
• Express the objective function in the form of a linear equation in the decision variables.
• Optimize the objective function either graphically or mathematically.

Objective Function
The objective function is needed to solve the optimization problems. A linear
representation of the form Z = ax + by, where a, b are constraints, and x, y are
variables, which have to be maximized or minimized is called an objective
function. The variables x and y are called the decision variables. An
objective function is governed by a few constraints, some of which are x
> 0, y > 0.
Page 2
Class 12th Mathematics

12 LINEAR PROGRAMMING
MATHEMATICAL FORMULATION OF LPP

Objective Function: Z = ax + by

Objective function of a linear programming problem is needed to find the optimal solution: maximize
the profit, minimize the cost, or to minimize the use of resources, right deployment of resources.
Objective function in LPP has wide application in representing problems of commerce, industry, and
applied sciences.

Constraints
The linear inequalities or equations or restrictions on the variables of LPP (linear programming
problem) are called constraints. The conditions x ≥ 0, y ≥ 0 are called non-
negative restrictions.

As an example, the number of boys is represented as x, and the number

of girls is represented as y, and the constraint exists that the number of
children who can be accommodated in the bus is less than 60. This
constraint can be expressed as an inequality x + y < 60.

Optimisation problems
A problem which seeks to maximize or minimize a linear function (say of two variables x and y)
subject to certain constraints as determined by a set of linear inequalities is called an optimization
problem. Linear programming problems are special types of optimization problems.

Decision Variables
The resources to be utilized, the time to be allocated, or the people to be deployed can all be the
decision variables for an objective function. The objection function z = ax + by has the variables x,
and y as the decision variables.
Page 1
Class 12th Mathematics

12 LINEAR PROGRAMMING
GRAPHICAL METHOD OF SOLVING LINEAR PROGRAMMING PROBLEMS

GRAPHICAL METHOD OF SOLVING LINEAR PROGRAMMING PROBLEMS

The two-variable linear programming is optimized using the graphical technique. If the problem
contains two decision variables, the best way for finding the optimum solution is to use a graphical
method. The set of inequalities is subjected to constraints in this manner.

The inequalities are then plotted on an XY plane. Once all of the inequalities have been shown on
the XY graph, the intersecting region will assist in determining the feasible region. The feasible area
will not only give the best solution, but it will also explain what values our model can take.

Formulate the Linear programming problem

To begin, we must first identify the decision variables and determine the objective function to be
maximized or reduced, which we must then describe as a linear function of decision variables. Then,
in terms of the decision variables, identify the set of constraint conditions and describe them as
linear inequalities or equations.

Construct a graph and plot the constraint lines

The graph must have 'n' dimensions, with 'n' being the number of
decision variables. This should give you a sense of how complicated this
phase will get as the number of decision variables increases.

Determine the valid side of each constraint line

This is used to identify the available space's domain. A basic way is to insert the
origin (0,0) coordinates into the problem and see if the objective function has a
physical solution or not. If yes, the valid side of the constraint lines is the one on
which the origin is located. Otherwise, it's on the other side.

Identify the feasible solution region

On the graph, the feasible solution region is the one that is satisfied by all of the constraints. It might
also be considered as the intersection of each constraint line's valid regions. A suitable solution for
our objective function might be found at any point in this area.

Plot the objective function on the graph

Because we're working with linear equations, it'll obviously be a straight line. To avoid confusion, it
must be drawn differently from the constraint lines. Choose the constant value in the objective
function's equation at random to make it easily identifiable.

Find the optimum point

Page 2
Class 12th Mathematics

12 LINEAR PROGRAMMING
GRAPHICAL METHOD OF SOLVING LINEAR PROGRAMMING PROBLEMS

An optimal point is always found at one of the feasible region corners. Make sure this ruler is oriented
correctly in space. We simply need to know the direction of the objective function in a straight line.
Begin sliding the graph towards the origin, starting from the far corner.

Find the point of contact of the ruler with the feasible region that is closest to the origin if the
purpose is to minimize the objective function. This is the optimal function minimization point.

Find the point of contact of the ruler with the feasible region that is the farthest from the origin if
the purpose is to maximize the objective function. This is the most efficient way to maximize the
function.

Calculate the coordinates of the optimum point.

You'll need to find the coordinates of the optimum point once you've found it. Drawing two
perpendicular lines from the point onto the coordinate axes and noting down the coordinates is a
simple way to achieve this. To determine the optimized objective function, just plug the values of
these parameters into the objective function's equation.
Page 1
Class 12th Mathematics

12 LINEAR PROGRAMMING
DIFFERENT TYPES OF LINEAR PROGRAMMING PROBLEMS

DIFFERENT TYPES OF LINEAR PROGRAMMING PROBLEMS

The different types of linear programming problems are:

• Manufacturing problems
• Diet Problems
• Transportation Problems

Manufacturing Problems
These problems involve optimizing the production rate or the net profits of the manufactured
products, which could be a function of the available workspace, the number of labourers, machine
hours, packaging material used, raw materials required, the market value of the product etc. These
find application in the industrial sectors and hence the prediction of a company’s possible capital
increase over the years.

• Constraints – Variables like the workhours, the cost of the packaging material used etc.
• Objective function – The production rate

Example: A company makes two products (X and Y) using two machines (A and B). Each unit of X that
is produced requires 50 minutes processing time on machine A and 30 minutes processing time on
machine B. Each unit of Y that is produced requires 24 minutes processing time on
machine A and 33 minutes processing time on machine B.

At the start of the current week, there are 30 units of X and 90 units of Y in stock.
Available processing time on machine ‘A’ is forecast to be 40 hours and
on machine ‘B’ is forecast to be 35 hours.

The forecast of demand for X in the current week is 75 units and for Y is 95 units.
Company policy is to maximize the combined sum of the units of X and the units of
Y in stock at the end of the week.

• Formulate the problem of deciding how much of each product to make in the
current week as a linear program.
• Solve this linear program graphically.

Clearly, this product involves optimizing the production rate, subject to the given
constraints on the production of the two products (A and B) due to a constraint on the machine
hours. Such problems are very typical in manufacturing sectors.
Page 2
Class 12th Mathematics

12 LINEAR PROGRAMMING
DIFFERENT TYPES OF LINEAR PROGRAMMING PROBLEMS

Diet Problems
As the name suggests in itself, such problems involve optimizing the intake of certain types of foods
rich in certain nutrients that could help one follow a particular diet plan. More precisely, the goal of
a diet problem is to select a set of foods that will satisfy a set of a daily nutritional requirement at a
minimum cost.

• Constraints – The specified nutritional requirements, that could be a specific calorie intake or
the amount of sugar or cholesterol in the diet.
• Objective function – The cost of the food intake.

Example: A kitchen manager at Nullify Hospital has to decide the food mix for the patients. Dietary
instructions are that each patient must get at least:

• One gram of protein

• One gram of fat
• Three gms. of carbohydrates

Additional guidelines mention that the carbohydrate content of any

patient by any chance, shouldn’t exceed six grams. The availability of
protein, fat, and carbohydrates in gms per kg of chicken, rice, and bread; along
with the market costs of each of these food items is as given below:

Protein Fat Carbohydrates Price/kg (Rs.)

Chicken 10 2 1 30
Rice 2 1 15 5
Bread 2 0 10 4

Formulate a suitable diet mix by minimizing the cost, subject to the given constraints, assuming 100
patients on that day.

Transportation Problems
These problems are related to the study of the efficient transportation routes i.e., how efficiently the
product from different sources of production is transported to the
different markets, such as the total transportation cost is minimum.
Analysis of such problems is very crucial for big companies with several
production plants and a widespread area to cater to.

• Constraints – The specific supply and demand patterns.

• Objective function – The transportation cost
Page 3
Class 12th Mathematics

12 LINEAR PROGRAMMING
DIFFERENT TYPES OF LINEAR PROGRAMMING PROBLEMS

Example: A firm has 3 factories – Alpha, Tango, and Kingston. There are four major warehouses
situated at locations PTR, CNB, DLS, and MMB. The average daily production of the product at Alpha,
Tango, Kingston is 30, 40 and 50 units respectively. The average daily requirement of this product at
PTR, CNB, DLS, and MMB is 35, 30, 32, 25 units respectively.

The transportation cost (in Rs.) per unit of product from each factory to each warehouse is given
below:

Factory↓ / PTR CNB DLS MMB Supply (units)

Warehouses →
Alpha 6 10 8 5 30
Tango 10 7 8 9 40
Kingston 5 5 8 12 50
Demand (units) 35 30 32 25

Following the data from this table, calculate the total transportation costs of the products, subject
to the constraints due to limited production and limited requirements. The goal here is to minimize
the total transportation costs.
 Linear Programming

DPP-01

[Topic: Manufacturing LPP (Maximization of Profit)]

I. Multiple Choice Questions (MCQs)

1. For an L.P.P. the objective function is 𝑍 = 4𝑥 + 3𝑦, and the feasible region determined by a set
of constraints (linear inequations) is shown in the graph.
Which one of the following statements is true?

(a) Maximum value of Z is at R.

(b) Maximum value of 𝑍 is at 𝑄.
(c) Value of 𝑍 at 𝑅 is less than the value at 𝑃.
(d) Value of 𝑍 at 𝑄 is less than the value at 𝑅.
2. A factory owner wants to purchase two types of machines A and B for his factory. The machine
A requires an area of 1000 m2 and 12 skilled men for running it and its daily output is 50 units,
whereas the machine 𝐵 requires 1200 m2 area and 8 skilled men, and its daily output is 40 units.
If an area of 7600 m2 and 72 skilled men be available to operate the machines, how many
machines of each type should be bought to maximise the daily output?
(a) 𝑍max = 310 at (4,8)
(b) 𝑍max = 320 at (4,3)
(c) Zmax = 280 at (4,6)
(d) 𝑍max = 300 at (4,5)
3. Minimum and maximum value of 𝑍 = 3𝑥 + 9𝑦 subject to the constraints: 𝑥 + 3𝑦 ≤ 60; 𝑥 + 𝑦 ≥
10; 𝑥 ≤ 𝑦; 𝑥 ≥ 0, 𝑦 ≥ 0 are given by
(a) 𝑍min = 60 at (5,5) and 𝑍max = 180 at (15,15) and (0,20)
(b) 𝑍min = 50 at (5,4) and 𝑍max = 170 at (15,10) and (0,20)
 (c) 𝑍min = 45 at (5,6) and 𝑍max = 175 at (15,15) and (5,12)
(d) None of these
4. A cooperative society of farmers has 50 hectares of land to grow two crops X and Y. The profits
from crops X and 𝑌 per hectare are estimated as ₹10,500 and ₹9,000 respectively. To control
weeds, a liquid herbicide has to be used for crops X and Y at the rates of 20 litres and 10 litres per
hectare. Further not more than 800 litres of herbicide should be used in order to protect fish and
wildlife using a pond which collects drainage from the land. How much land should be allocated
to each crop so as to maximise the total profit of the society?
(a) Zmax = ₹4,95,000 at (30,20)
(b) 𝑍max = ₹4,70,000 at (30,10)
(c) Zmax = ₹4,60,000 at (30,15)
(d) Zmax = ₹4,90,000 at (40,20)
5. A manufacturing company makes two models 𝐴 and 𝐵 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 labours hour for fabricating and 3 labour hour for finishing. For fabricating and
finishing the maximum labour hours available are 180 and 30 respectively. The company makes
a profit of ₹8000 on each piece of model A and ₹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?
(a) Zmax = ₹1,55,000 at (12,8)(𝑏)Zmax = ₹1,60,000 at (14,5)
(c) Zmax = ₹1,65,000 at (12,5)(𝑑)Zmax = ₹1,68,000 at (12,6)
6. One kind of cake requires 200 g of flour and 25 g of fat and another kind of cake require 100 g
of flour and 50 g of fat. The maximum number of cakes which can be made from 5 kg of flour
and 1 kg of fat assuming that there is no shortage of the other ingredients used in making the
cakes is given by
(a) 𝑍max = 21 at (18,5)
(b) Zmax = 25 at (20,12)
(c) 𝑍max = 30 at (20,10)
(d) Zmax = 40 at (20,5)
7. A factory makes tennis rackets and cricket bats. A tennis racket takes 1.5 hours of machine time
and 3 hours of craftsman's time in its making while a cricket bat takes 3 hours machine time and
1 hour of craftsman's time. In a day the factory has the availability of not more than 42 hours of
machine time and 24 hour of craftsman's time. What number of cricket bats and tennis rackets be
made if the factory work at full capacity?
(a) Zmax = 18 at (4,8)
(b) 𝑍max = 17 at (14,12)
(c) 𝑍max = 16 at (4,12)
(d) 𝑍max = 20 at (4,11)
8. A manufacturer produces nuts and bolts. It takes 1 hour of work on machine A and 3 hours on
machine B to produce a package of nuts. It takes 3 hours on machine 𝐴 and 1 hour on machine B
to produce a package of bolts. He earns a profit of ₹17.50 per package on nuts and ₹7.00 per
package on bolts. How many packages of each should be produced each day so as to maximise
his profit, if he operates his machines for at the most 12 hours a day?
(a) Zmax = ₹78 at (3,5)
(b) Zmax = ₹73.50 at (3,3)
 (c) 𝑍max = ₹70 at (3,4)
(d) Zmax = ₹75 at (4,3)
9. A factory manufactures two types of screws A and B. Each type of screw requires the use of two
machines an automatic and a hand operated. It takes 4 minutes on the automatic and 6 minutes
on hand operated machines to manufacture a package of screw A, while it takes 6 minutes on
automatic and 3 minutes on hand operated machine to manufacture a package of screw B. Each
machine is available for atmost 4 hours, on any day. The manufacturer can sell a package of
screws A at a profit of ₹7 and screw B at a profit of ₹ 10. Assuming that he can sell all the
screws he manufactures in a day, how many packages of each type of screws should be produced
in order to maximise his profit?
(a) Zmax = ₹390 at (28,25)
(b) 𝑍max = ₹380 at (25,20)
(c) 𝑍max = ₹400 at (30,15)
(d) Zmax = ₹410 at (30,20)
10. A cottage industry manufactures pedestal lamps and wooden shades. Each requiring the use of a
grinding/ cutting machine and a sprayer. It takes 2 hours on grinding/ cutting machine and 3
hours on the sprayer to manufacture a pedestal lamp. It takes 1 hour on the grinding/cutting
machine and 2 hours on the sprayer to manufacture a shade. On any day the sprayer is available
for at the most 20 hours and the grinding, cutting machine for at the most 12 hours. The profit
from the sale of a lamp in ₹ 5 and that from a shade is ₹3. Assuming that the manufacturer can
sell all the lamps and shades that he produces, how should he schedule his daily production in
order to maximise his profit?
(a) 𝑍max = ₹26 at (5,2)
(b) Zmax = ₹30 at (4,6)
(c) 𝑍max = ₹32 at (4,4)
(d) 𝑍max = ₹28 at (4,5)

II. Long Answer Type Questions

1. A company manufacture two types of novelty Souvenirs made of plywood. Souvenirs of type A
requires 5 minutes each for cutting and 10 minutes each for assembling. Souvenirs of type B
requires 8 minutes 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 ₹ 5 each for type A and ₹ 6 each
for type B souvenirs. How many souvenirs of each type should the company manufacture in
order to maximise his profit?

2. A merchant plans to sell two types of personal computers a desktop model and a portable model
that will cost ₹25,000 and ₹40,000 respectively. He estimates that the total monthly demand of
computers will not exceeds 250 units. Determine the number of units of each type of computers,
which the merchant should stock to get maximum profit if he does not want to invest more than ₹
70 lakhs and if his profit on the desktop model is ₹ 4,500 and on portable model ₹ 5000.
3. A manufacturer has three machines I, II and III installed in his factory. Machine I and II are
capable of being operated for atmost 12 hours whereas machine III must be operated for atleast 5
hours a day she produces only two items M and N each requiring the use of three machines. The
 number of hours required for producing I unit of each M and N on the three machines are given
in the following table:

Items Number of hours required on machines

I II III

M(𝑥) 1 2 1

N(𝑦) 2 1 1.25

She makes a profit of ₹ 600 and ₹ 400 on items. M and N respectively. How many of each item
should she produce so as to maximise her profit, assuming that she can sell all the items that she
produced? What will be the maximum profit?

4. A manufacturer makes two types of toys A and B. Three machines are needed for this purpose
and the time (in minutes) required for each toy on the machines is given below:

Each machine is available for a maximum of 6 hours per day. If the profit on each toy of type A
is ₹7.50, and that on each toy of type B ₹ 5 show that 15 toys of type A and 30 toys of type B
should be manufactured in a day to get maximum profit.

5. An aeroplane can carry a maximum of 200 passengers. A profit of ₹ 1,000 is made on each
executive class ticket and a profit of ₹600 is made on each economy class ticket. The airline
reserves atleast 20 seats for executive class. However, atleast 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 of the airline. What is the maximum profit?

6. A dealer wishes to purchase a number of fans and sewing machines. He has only ₹ 57,600 to
invest and has space for atmost 20 items. A fan costs him ₹ 3,600 and a sewing machine ₹ 2,400.
Profit on selling a fan and a sewing machine are ₹220 and ₹180 respectively. Assuming that he
can sell all the items that he can buy, how should he invest his money in order to maximise his
profit? Formulate this problem mathematically and solve it graphically.
7. Anil wants to invest atmost ₹12,000 in bonds A and B. According to the rules, he has to invest
atleast ₹ 2000 in bond 𝐴 and atleast ₹4000 in bond B. If the rate of interest in bond A is 8% per
annum and on bond B is 10% per annum now how should Anil invest his money for maximum
interest? Solve the problem graphically.
8. A man has ₹1,500 for purchase rice and wheat. A bag of rice and a bag of wheat cost ₹180 and
₹120 respectively. He has a storage capacity of 10 bags only. He earns a profit of ₹ 11 and ₹ 9
respectively per bag of rice and wheat. Formulate it as an LPP and solve it graphically.
9. Solve the following linear programming problem graphically:
Maximise: 𝑍 = 8𝑥 + 7𝑦; subject to the constraints:
3𝑥 + 𝑦 ≤ 66, 𝑥 + 𝑦 ≤ 45, 𝑥 ≤ 20, 𝑦 ≤ 40, 𝑥 ≥ 0, 𝑦 ≥ 0

10. A manufacturer makes two products, A and B. Product A sells at ₹200 per unit and take 30
minutes to make and product 𝐵 sells at ₹300 per unit and takes 1 hour to make. There is
permanent order of 14 units of product 𝐴 and 16 units of product B. A working week consists of
40 hours of production and the weekly turnover must not be less than ₹ 10,000. If the profit on
each of the product 𝐴 is ₹ 20 and on product 𝐵 ₹ 30, how much of each product should be
produced so that the profit is maximum? Also find the maximum profit and solve the problem
graphically.
11. If a young man rides his motorcycle at 25 km/ hour he had to spend ₹2 per km on petrol. If he
rides at a faster speed of 40 km/ hour the petrol cost increases at ₹ 5/km. He has ₹100 to spend
on petrol and wishes to find what is the maximum distance he can travel within one hour.
Express it as LPP and solve it graphically.
12. A small firm manufactures gold rings and chains. The total number of rings and chains
manufactured per day is atmost 24. It takes 1 hour to make a ring and 30 minutes to make a
chain. The maximum number of hours available per day is 16. If the profit on a ring is ₹300 and
that on a chain is ₹ 190, find the number of rings and chains that should be manufactured per
day, so as to earn maximum profit. Make it an LPP and solve it graphically.
13. A library has to accommodate two different types of books on a shelf. The books are 6 cm and
1
4 cm thick and weight 1 kg and 1 kg each respectively. The shelf is 96 cm long and at a time
2
can support a weight of 21 kg. How should the shelf be filled with the books of two types in
order to include the greatest number of books? Make it an LPP and solve it graphically.
14. A decorative item dealer deals in two items A and B. He has ₹ 15000 to invest and a space to
store at the most 80 pieces. Item A costs him ₹300 and item B cost him ₹150. He can sell item
A and B at respective profits of ₹50 and ₹ 28. Assuming that he can sell all he buys, formulate
the LPP in order to maximise his profit and solve it graphically.
15. Find graphically the maximum value of 𝑍 = 2𝑥 + 3𝑦 subject to the constraints: 3𝑥 + 𝑦 = 6; 𝑥 +
2𝑦 = 4 and 𝑥 ≥ 0, 𝑦 ≥ 0.
16. A manufacturer produces two products A and B. Both products are processed on two different
machines. The available capacity of first machine is 12 hours and that of second machine is 9
hours per day. Each unit of the product A requires 3 hours on both machines and each unit of
product 𝐵 requires 2 hours on first machine and 1 hour on second machine. Each unit of product
 A is sold at ₹7 profit and that of 𝐵 at a profit of ₹4. Find the production level per day for
maximum profit graphically.
17. Solve the following L.P.P. graphically:
Maximise 𝑍 = 4𝑥 + 𝑦.
Subject to the following constraints 𝑥 + 𝑦 ≤ 50, 3𝑥 + 𝑦 ≤ 90, 𝑥 ≥ 10, 𝑥, 𝑦 ≥ 0.
18. Solve the following L.P.P. graphically.
Maximise 𝑍 = 20𝑥 + 10𝑦.
Subject to the following constraints 𝑥 + 2𝑦 ≤ 28, 3𝑥 + 𝑦 ≤ 24, 𝑥 ≥ 2, 𝑥, 𝑦 ≥ 0.
19. Maximise 𝑍 = 𝑥 + 2𝑦 subject to the constraints 𝑥 + 2𝑦 ≥ 100,2𝑥 − 𝑦 ≤ 0,2𝑥 + 𝑦 ≤
200, 𝑥, 𝑦 ≥ 0. Solve the above L.P.P. graphically.
20. Solve the following linear programming problem graphically: Maximise 𝑍 = 34𝑥 + 45𝑦, 𝑥 +
𝑦 ≤ 300, 2𝑥 + 3𝑦 ≤ 70, 𝑥 ≥ 0, 𝑦 ≥ 0.
 Linear Programming

DPP-

[Topic: Minimisation of Objective Function and Diet Problems]

I. Multiple Choice Questions (MCQs)

1. Minimum value of 𝑍 = 𝑥 − 5𝑦 + 20 subject to the constraints: 𝑥 − 𝑦 ≥ 0, −𝑥 + 2𝑦 ≥ 2, 𝑥 ≥

3, 𝑦 ≤ 4 is given by
(a) 𝑍min = 2 at (4,6)
(b) Zmin = 4 at (4,4)
(c) Zmin = 3 at (4,3)
(d) Zmin = 6 at (4,5)

2. Minimum value of 𝑍 = 𝑥 − 7𝑦 + 190 subject to the constraints: 𝑥 + 𝑦 ≤ 8, 𝑥 + 𝑦 ≥ 4, 𝑥 ≤

5, 𝑦 ≤ 5, 𝑥 ≥ 0, 𝑦 ≥ 0 equals.
(a) Zmin = 155 at (0,5)
(b) Zmin = 150 at (2,5)
(c) Zmin = 160 at (2,3)
(d) Zmin = 170 at (3,5)
 Linear Programming

DPP

[Topic: Transportation Problems]

Long Answer Type Questions

1. Two godowns 𝐴 and 𝐵 have a grain capacity of 100 quintals and 50 quintals respectively. They
supply to 3 ration shops D, E and F whose requirements are 60,50 and 40 quintals respectively.
The cost of transportation per quintal from the godowns to the shops are given in the following
table:

How should the supplies be transported in order that the transportation cost is minimum? What is
the minimum cost?

2. An oil company has two depots A and B with capacities of 7,000 L and 4,000 L respectively.
The company is to supply oil to three petrol pumps D, E and F whose requirements are 4,500 L,
3,000 L and 3,500 L respectively. The distances (in km ) between the depots and the petrol
pumps is given in the following table:

Assuming that the transportation cost of 10 litre of oil is ₹1 per km, how should the delivery be
scheduled in order that the transportation cost is minimum?
 PYQs

1. BASIC CONCEPTS OF LINEAR PROGRAMMING

Objective Qs (1 mark)
1. The corner points of the bounded feasible region determined by a system of linear constraints are
(0,3), (1,1) and (3,0). Let 𝑍 = 𝑥 + 𝑦, where , > 0. The condition on and so that the
minimum of 𝑍 occurs at (3,0) and (1,1) is:
(a) = 2
(b) =
2
(c) = 3
(d) =
[CBSE SQP 2023]

2. The feasible region corresponding to the linear constraints of a Linear Programming Problem is
given below.

Which of the following is not a constraint to the given Linear Programming Problem?
(a) 𝑥 + 𝑦 ≥ 2
(b) 𝑥 + 2𝑦 ≤ 10
(c) 𝑥 − 𝑦 ≥ 1
(d) 𝑥 − 𝑦 ≤ 1

[CBSE SQP 2023]

3. The 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?
(a) = 9, 𝑏 = 1
(b) = 5, 𝑏 = 2
(c) = 3, 𝑏 = 5
(d) = 5, 𝑏 = 3
[CBSE 2023]

4. The corner points of the feasible region of a linear programming problem are (0,4),
 2
(8,0) and , . If 𝑍 = 30𝑥 + 24𝑦 is the objective function, then (maximum value of 𝑍 -
minimum value of 𝑍 ) is equal to:
(a) 40
(b) 96
(c) 120
(d) 136

[CBSE 2023]

5. The corner points of the shaded unbounded feasible region of an LPP are (0,4), (0.6,1.6) and
(3,0) as shown in the figure. The minimum value of the objective function 𝑍 = 4𝑥 + 6𝑦 occurs
at:

(a) (0.6,1.6) only

(b) (3,0) only

(c) (0.6,1.6) and (3,0) only

(d) every point of the line-segment joining the points (0.6,1.6) and (3,0)

[CBSE SQP 2022]

6. The solution set of the inequality 3𝑥 + 5𝑦 < 4 is:

(a) an open half-plane not containing the origin.

(b) an open half-plane containing the origin.

(c) the whole 𝑌-plane not containing the line 3𝑥 + 5𝑦 = 4

(d) a closed half plane containing the origin.

[CBSE SQP 2022]

7. In the given graph, the feasible region for a LPP is shaded.

 The objective function 𝑍 = 2𝑥 − 3𝑦 will be minimum at:
(a) (4,10)
(b) (6,8)
(c) (0,8)
(d) (6,5)

[CBSE Term-1 SQP 2021]

8. Based on the given shaded region as the feasible region in the graph, at which point(s) is the
objective function Z = 3𝑥 + 9𝑦 maximum?

(a) Point B

(b) Point

(c) Point D

(d) Every point on the line segment

[CBSE Term-1 SQP 2021]

9. In a linear programming problem, the constraints on the decision variables 𝑥 and 𝑦 are 𝑥 − 3𝑦 ≥
0, 𝑦 ≥ 0,0 ≤ 𝑥 ≤ 3. The feasible region:
(a) is not in the first quadrant.

(b) is bounded in the first quadrant.

(c) is unbounded in the first quadrant.

(d) does not exist.

[CBSE Term-1 SQP 2021]

10. For an objective function 𝑍 = 𝑥 + 𝑏𝑦, where , 𝑏 > 0; the corner points of the feasible region
determined by a set of constraints (linear inequalities) are (0,20), (10,10), (30,30) and (0,40).
The condition on and 𝑏 such that the maximum 𝑍 occurs at both the points (30,30) and (0,40)
is:
(a) 𝑏 − 3 = 0
(b) = 3𝑏
(c) + 2𝑏 = 0
(d) 2 − 𝑏 = 0
[CBSE Term-1 SQP 2021]

11. The corner points of feasible region for a linear programming problem are P(0,5), 𝑄(1,5), 𝑅(4,2)
and (12,0). The minimum value of the objective function 𝑍 = 2𝑥 + 5𝑦 is at the point:
(a) P
(b) Q
(c) R
(d)
[CBSE Term-1 SQP 2021]

12. A linear programming problem is as follows: Minimise 𝑍 = 30𝑥 + 50𝑦

subject to the constraints,

3𝑥 + 5𝑦 ≥ 15
2𝑥 + 3𝑦 ≤ 18
𝑥 ≥ 0, 𝑦 ≥ 0

In the feasible region, the minimum value of 𝑍 occurs at:

(a) a unique point

(b) no point

(c) infinitely many poins

(d) two points only

[CBSE Term-1 SQP 2021]

 Very Short & Short Qs (1-3 marks)
13. Solve the following Linear Programming Problem graphically:
Maximise: 𝑍 = −𝑥 + 2𝑦,

subject to the constraints: 𝑥 ≥ 3, 𝑥 + 𝑦 ≥ 5, 𝑥 + 2𝑦 ≥ 6, 𝑦 ≥ 0.

[CBSE SQP 2023]

14. Solve the following Linear Programming Problem graphically:

Minimise: 𝑍 = 𝑥 + 2𝑦,

subject to the constraints: 𝑥 + 2𝑦 ≥ 100, 2𝑥 − 𝑦 ≤ 0,2𝑥 + 𝑦 ≤ 200, 𝑥, 𝑦 ≥ 0.

[CBSE SQP 2023]

15. Solve the following linear programming problem graphically:

Maximise: Z = x + 2y

Subject to constraints: 𝑥 + 2𝑦 ≥ 100,

2𝑥 − 𝑦 ≤ 0
2𝑥 + 𝑦 ≤ 200
𝑥 ≥ 0, 𝑦 ≥ 0

[CBSE 2023]

16. Solve the following Linear Programming Problem graphically:

Maximise 𝑍 = 400𝑥 + 300𝑦

Subject to 𝑥 + 𝑦 ≤ 200, 𝑥 ≤ 40, 𝑥 ≥ 20, 𝑦 ≥ 0

[CBSE SQP 2022]

17. The corner points of the feasible region determined by the system of linear constraints are as
shown below:
 (A) Let 𝑍 = 3𝑥 − 4𝑦 be the objective function. Find the maximum and minimum value of Z and
also the corresponding point at which the maximum and minimum value occurs.

(B) Let X = x + 𝑦, where , > 0 be the objective function. Find the condition on and so
that the maximum value of 𝑍 occurs at 𝐵(4,10) and (6,8). Also mention the number of optimal
solutions in this case.

[CBSE SQP 2020]

18. Solve the following LPP graphically:

Minimise, 𝑍 = 5𝑥 + 7𝑦

Subject to the constraints

2𝑥 + 𝑦 ≥ 8
𝑥 + 2𝑦 ≥ 10
𝑥, 𝑦 ≥ 0

[CBSE 2020]

19. A firm has to transport at least 1200 packages daily using large vans which carry 200 packages
each and small vans which can take 80 packages each. The cost of engaging each large van is ₹
400 and each small van is ₹ 200. Not more than ₹ 3000 is to be spent daily on the job and the
number of large vans cannot exceed the number of small vans. Formulate this problem as a LPP
given that the objective is to minimise cost.
[CBSE 2017]

20. Two tailors, A and B, earn ₹ 300 and ₹ 400 per day, respectively. A can stitch 6 shirts and 4 pairs
of trousers while 𝐵 can stitch 10 shirts and 4 pairs of trousers per day. To find how many days
should each of them work and if it is desired to produce at least 60 shirts and 32 pairs of trousers
at a minimum labour cost, formulate this as an LPP.
[CBSE 2017]
21. A small firm manufactures necklace and bracelets. The total number of necklace and bracelet that
it can handle per day is at most 24. It takes 1 hour to make a bracelet and half an hour to make a
necklace. The maximum number of hours available per day is 16. If the profit on a necklace is ₹
100 and that on a bracelet is ₹ 300, how many of each should be produced daily to maximise the
profit? It is being given that at least one of each must be produced.
[CBSE 2017]

22. Solve the following linear programming problem (LPP) graphically:

Maximise and Minimise 𝑍 = 5𝑥 + 10𝑦

subject to the constraints

𝑥 + 2𝑦 ≤ 120, 𝑥 + 𝑦 ≥ 60, 𝑥 − 2𝑦 ≥ 0, 𝑥 ≥ 0, 𝑦 ≥ 0

[CBSE 2017]

23. If a 20 year old girl drives her car at 25 km/h, she has to spend ₹4/km on petrol. If she drives her
car at 40 km/h, the petrol cost increases to ₹ 5/km. She has ₹ 200 to spend on petrol and wishes
to find the maximum distance she can travel within one hour. Express the above problem as
Linear Programming Problem. Write any one value reflected in the problem. [CBSE SQP 2016]

Long Qs (4 - 5 marks)
24. A manufacturer has three machine I, II, and III installed in his factory. Machines I and II are
capable of being operated for at most 12 hours whereas machine III must be operated for atleast 5
hours a day. She produces only two items M and N each requiring the use of all the three
machines.
The number of hours required for producing 1 unit each of M and N on the three machines are
given in the following table:

Number of hours required on

Items
machines

I II III

M 1 2 1

N 2 1 1.25

She makes a profit of ₹ 600 and ₹ 400 on items and respectively. How many of each item
should she produce so as to maximise her profit assuming that she can sell all the items that she
produce? What will be the maximum profit? [CBSE 2020]

25. A small manufacturer has employed 5 skilled men and 10 semi-skilled men and makes an article
in two qualities deluxe model and an ordinary model. The making of a deluxe model requires
2hrs. worked by a skilled man and 2 hrs. worked by a semiskilled man. The ordinary model
 requires 1hr by a skilled man and 3hrs. by a semi-skilled man. By union rules no man may work
more than 8hrs. per day. The manufacturers clear profit on deluxe model is ₹ 15 and on an
ordinary model is ₹ 10. How many of each type should be made in order to maximise his total
daily profit.
[CBSE 2019]

26. Find graphically, the maximum value of = 2𝑥 + 5𝑦, subject to constraints given below:
2𝑥 + 4𝑦 ≤ 8,3𝑥 + 𝑦 ≤ 6, 𝑥 + 𝑦 ≤ 4; 𝑥 ≥ 0, 𝑦 ≥ 0

[CBSE 2015]

27. Maximise 𝑍 = 8𝑥 + 9𝑦 subject to the constraints given below:

2𝑥 + 3𝑦 ≤ 6,3𝑥 − 2𝑦 ≤ 6, 𝑦 ≤ 1; 𝑥, 𝑦 ≥ 0

[CBSE 2015]
Page 1
Class 12th Mathematics

12 LINEAR PROGRAMMING
OPTIMISATION PROBLEMS

(Practice Sheet)
1 What is the primary goal of optimization?
A. Minimize constraints B. Maximize decision variables
C. Minimize the objective function D. Maximize constraints
2 In mathematical optimization, what are decision variables?
B. Constants that represent physical
A. Fixed values that cannot be changed
quantities
C. Variables chosen by the decision-maker D. The constraints in the problem
3 What does the objective function in optimization represent?
A. Constraints on decision variables B. The highest possible profit
C. The lowest possible cost D. A numerical representation of the solution
4 If x and y represent the number of bats and balls a shopkeeper purchases, which
constraint ensures the storage capacity is not exceeded?
A. x ≥ 0 B. y ≥ 0
C. x + y ≤ 50 D. 7x + y ≤ 100
5 In the given problem, what is the objective function Z?
A. Z = 350x + 50y B. Z = 50x + 15y
C. Z = 7x + y D. Z = 5000
6 Find the maximum value of Z = 4x + 3y, if the corner points of the feasible region
determined by the linear constraints are (0, 0), (0, 40), (20, 40), (60, 20) and (60, 0).
7 Find the maximum value of the objective function if Z = 4x + 3y for the feasible solution
represented by the below graph.

8 Find the minimum value for Z = 6x + 4y for the feasible solution shown in the below graph.
Page 2
Class 12th Mathematics

12 LINEAR PROGRAMMING
OPTIMISATION PROBLEMS

9 A rectangular field is to be fenced on three sides so as to have the largest field possible. If the
wire available for fencing is 400 m, then find the area covered by the field.
10 The sum of two numbers is 50. What are the two numbers if their product is maximum?
Page 1
Class 12th Mathematics

12 LINEAR PROGRAMMING
LINEAR PROGRAMMING PROBLEMS

(Practice Sheet)
1 What is the primary objective of a Linear Programming Problem (LPP)?
A. Maximize or minimize a linear function B. Maximize the number of variables
C. Minimize the number of constraints D. Maximize the number of inequalities
2 In linear programming, the variables are typically required to be:
A. Negative B. Real numbers
C. Integers D. Non-negative
3 The feasible region in linear programming is defined by:
A. The objective function B. The maximum value
C. The common area satisfying linear D. The optimal solution
constraints
4 What does the Corner Point Method in linear programming suggest?
A. To find the intersection point of two B. To focus on the unbounded region of the
linear equations feasible space
C. The maximum or minimum value occurs D. To ignore corner points in optimization
at a corner point problems
5 The optimal value of the objective function in a linear programming problem is typically
found at:
A. The midpoint of the feasible region B. Any point in the feasible region
C. A corner point of the feasible region D. The boundary of the feasible region
6 Solve the following LPP graphically:
Maximise Z = 2x + 3y, subject to x + y ≤ 4, x ≥ 0, y ≥ 0
7 Solve the following linear programming problem graphically:
Minimise Z = 200 x + 500 y subject to the constraints:
x + 2y ≥ 10
3x + 4y ≤ 24
x ≥ 0, y ≥ 0
8 (Diet problem): A dietician wishes to mix two types of foods in such a way that vitamin
contents of the mixture contain at least 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 get Food ‘I’ and Rs 70 per kg to
get Food ‘II’. Formulate this problem as a linear programming problem to minimise the cost
of such a mixture.
9 (Allocation problem) A cooperative society of farmers has 50 hectares of land to grow two
crops X and Y. The take advantage of crops X and Y per hectare are estimated as Rs 10,500
and Rs 9,000 respectively. to regulate weeds, a liquid herbicide has got to be used for crops
Page 2
Class 12th Mathematics

12 LINEAR PROGRAMMING
LINEAR PROGRAMMING PROBLEMS

X and Y at rates of 20 litres and 10 litres per hectare. Further, not quite 800 litres of herbicide
should be utilized in order to guard fish and wildlife employing a pond which collects drainage
from this land. what proportion land should be allocated to every crop so as to maximise the
entire profit of the society?
10 There are two types of fertilisers ‘A’ and ‘B’. ‘A’ consists of 12% nitrogen and 5% phosphoric
acid whereas ‘B’ consists of 4% nitrogen and 5% phosphoric acid. After testing the soil
conditions, the farmer finds that he needs at least 12 kg of nitrogen and 12 kg of phosphoric
acid for his crops. If ‘A’ costs Rs 10 per kg and ‘B’ costs Rs 8 per kg, then graphically determine
how much of each type of fertiliser should be used so that the nutrient requirements are met
at a minimum cost.
Page 1
Class 12th Mathematics

12 LINEAR PROGRAMMING
MATHEMATICAL FORMULATION OF LPP

(Practice Sheet)
1 What does the formulation of Linear Programming Problem (LPP) involve?
B. Translating the real-world problem into
A. Solving mathematical equations
mathematical equations
C. Implementing computer algorithms D. Conducting experiments
2 How should decision variables be treated in LPP formulation?
A. Decision variables must always be
B. Decision variables must be ignored in LPP.
negative.
C. Decision variables must be expressed as
D. Decision variables must be non-negative.
linear equations.
3 What is the purpose of the objective function in LPP?
A. To make the problem more complex B. To simplify the constraints
C. To express the problem in a non-linear D. To optimize and set a goal for the problem
form
4 Which of the following is an example of an objective function in LPP?
A. Z = ax + by B. Z = ax × by
ax
C. Z = ax2 + by D. Z =
by
5 What are constraints in LPP?
A. Factors that make the problem more B. Non-linear equations
complicated
C. Linear inequalities or equations that D. Decision variables
restrict the variables
6 A calculator company produces a handheld calculator and a scientific calculator. Long-term
projections indicate an expected demand of at least 150 scientific and 100 handheld
calculators each day. Because of limitations on production capacity, no more than 250
scientific and 200 handheld calculators can be made daily.
To satisfy a shipping contract, a minimum of 250 calculators must be shipped each day. If
each scientific calculator sold, results in a 20 rupees loss, but each handheld calculator
produces a 50 rupees profit; then how many of each type should be manufactured daily to
maximize the net profit?
7 A person wants to decide the constituents of a diet which will fulfil his daily requirements of
proteins, carbohydrates at the minimum cost. The choice is to be made from four different
types of foods. The yield per unit of these foods are given in the following table:

Yield Per Unit

Page 2
Class 12th Mathematics

12 LINEAR PROGRAMMING
MATHEMATICAL FORMULATION OF LPP

Cost per unit

Food type Protein Fats Carbohydrates
(Rs)
1 3 2 6 45
2 4 2 4 40
3 8 7 7 85
4 6 5 4 65
Minimum
800 200 700
Requirement

Formulate a linear programming model for the problem.

8 You have Rs.10,000 to invest, and three different funds to choose from. The government bond
fund has a 5% return, the local bank's FDs have a 7% return, and a high-risk account has an
expected 10% return. To minimize risk, you decide not to invest any more than Rs.1,000 in
the high-risk account. For tax reasons, you need to invest at least three times as much in the
government bonds as in the bank FDs. What’s the best way to distribute your money given
these constraints? Formulate this problem as Linear Programming Problem (LPP) and solve it
graphically.
9 Two products ‘A’ and ‘B’ are to be manufactured. Single unit of ‘A’ requires 2.4 minutes of
punch press time and 5 minutes of assembly time, while single unit of ‘B’ requires 3 minutes
of punch press time and 2.5 minutes of welding time. The capacity of punch press
department, assembly department and welding department are 1200 min/week, 800
min/week and 600 min/week respectively. The profit from ‘A’ is ₹60 and from ‘B’ is ₹70 per
unit. Formulate LPP such that, profit is maximized.
10 A firm produces three products. These products are processed on three different machines.
The time required to manufacture one unit of each of the three products and the daily
capacity of the three machines are given in the table below:
Time per unit (Minutes) Machine Capacity
Machine
Product 1 Product 2 Product 3 (Minutes per Day)
M1 2 3 2 440
M2 4 - 3 470
M3 2 5 - 430
Page 1
Class 12th Mathematics

12 LINEAR PROGRAMMING
GRAPHICAL METHOD OF SOLVING LINEAR PROGRAMMING PROBLEMS

(Practice Sheet)
1 What is the primary purpose of using the graphical method in linear programming?
A. To solve complex equations B. To identify the feasible region
C. To maximize or minimize objective
D. To plot random points on a graph
functions
2 In two-variable linear programming, the number of dimensions in the graphical method's
graph is equal to:
A. 1 B. 2
C. 3 D. n(number of decision variables)
3 How is the valid side of a constraint line determined in graphical linear programming?
A. By flipping a coin B. By inserting the origin (0,0) coordinates
and checking for a physical solution
C. By connecting the line to the origin D. By finding the midpoint of the line
4 The feasible solution region is defined as:
A. The area inside the constraint lines B. The area outside the constraint lines
C. The intersection of the valid regions of D. The area between the x and y-axes
each constraint line
5 The optimal point in linear programming is always found at:
A. The center of the feasible region B. A random point within the feasible region
C. One of the corners of the feasible region D. The midpoint of the constraint lines
6 Solve the given linear programming problems graphically:
Maximize: Z = 8x + y
Constraints are,
• x + y ≤ 40
• 2x + y ≤ 60
• x ≥ 0, y ≥ 0
7 One kind of cake requires 200 g of flour and 25g of fat, and another kind of cake requires 100
g of flour and 50 g of fat Find the maximum number of cakes that can be made from 5 kg of
flour and 1 kg of fat assuming that there is no shortage of the other ingredients, used in
making the cakes.
8 Solve the given linear programming problems graphically:
Maximize: Z = 50x + 15y
Constraints are,
• 5x + y ≤ 100
• x + y ≤ 50
• x ≥ 0, y ≥ 0
Page 2
Class 12th Mathematics

12 LINEAR PROGRAMMING
GRAPHICAL METHOD OF SOLVING LINEAR PROGRAMMING PROBLEMS

9 Solve the given linear programming problems graphically:

Minimize: Z = 20x + 10y
Constraints are,
• x + 2y ≤ 40
• 3x + y ≥ 30
• 4x + 3y ≥ 60
• x ≥ 0, y ≥ 0
10 Calculate the maximal and minimal value of z = 5x + 3y for the following constraints.
x + 2y ≤ 14
3x – y ≥ 0
x–y≤2
Page 1
Class 12th Mathematics

12 LINEAR PROGRAMMING
DIFFERENT TYPES OF LINEAR PROGRAMMING PROBLEMS

(Practice Sheet)
1 What type of linear programming problem involves optimizing the production rate or net
profits of manufactured products in the industrial sector?
A. Diet Problems B. Transportation Problems
C. Manufacturing Problems D. Resource Allocation Problems
2 In a manufacturing problem, what is the objective function typically related to?
A. Daily calorie intake B. The cost of food intake
C. The transportation cost D. The production rate
3 In a diet problem, what is the primary objective function?
A. Maximizing nutritional requirements B. Maximizing calorie intake
C. Minimizing food cost D. Minimizing the number of food items
4 In a diet problem, what constraints are considered when optimizing the food intake?
A. Production constraints B. Nutritional requirements
C. Transportation costs D. Market demand
5 What is the main objective of transportation problems in linear programming?
A. Maximizing production B. Minimizing food cost
C. Minimizing transportation cost D. Maximizing calorie intake
6 You need to buy some filing cabinets. You know that Cabinet X costs $10 per unit, requires
six square feet of floor space, and holds eight cubic feet of files. Cabinet Y costs $20 per unit,
requires eight square feet of floor space, and holds twelve cubic feet of files. You have been
given $140 for this purchase, though you don’t have to spend that much. The office has room
for no more than 72 square feet of cabinets. How many of which model should you buy, in
order to maximise storage volume? Write the maximum storage volume in the provided box.
7 An IT company that wants to outfit your office with some new cabinets. Cabinet X costs Rs.10
per unit, takes up 6 square feet of floor space, and holds eight cubic feet of files, according
to a furniture business. Cabinet Y costs Rs.20 per unit, takes up eight square feet of floor
space, and has a capacity of twelve cubic feet of files. The company only have 72 square feet
of cabinet space and Rs.140 to spend on this transaction. How many of each type should you
purchase to maximise the storage capacity?
8 Find the maximum and minimum values of the function f (x, y) = 4x + 5y for the constraints x
≥ 0, y ≥ 0, x + y ≤ 6.
9 During the festival season, the XYZ company mixes two variables A and B to create a gift pack
that must weigh 5kg. A minimum of 2kg of A and a maximum of 4kg of B should be used. A
contributes Rs.5 per kg to the company’s net profit, while B contributes Rs.6 per kg. Create
an LPP Model to identify the optimal factor mix.
Page 2
Class 12th Mathematics

12 LINEAR PROGRAMMING
DIFFERENT TYPES OF LINEAR PROGRAMMING PROBLEMS

10 Calculate the maximum and minimum value of the function z = 5x + 4y for the following
constraints x + 2y ≤ 14, 3x – y ≥ 0, x – y ≤ 2
 P

Chapter 12:
Exercise 12.3 Linear Programming
Short Answer (S.A.)
1. Determine the maximum value of Z = 11x + 7y subject to the constraints: 2x + y  6, x  2, x  0,
y  0.
Solution:

Given: Z = 11x + 7y and the constraints 2x + y  6, x  2, x  0, y  0

Let 2x + y = 6
x 0 3
y 6 0
Now, plotting all the constrain equations we see that
the shaded area OABC is the feasible region
determined by the constraints.
The feasible region is bounded. So, the maximum
value will occur at a corner point of the feasible
region.
Corner points are (0, 0), (2, 0), (2, 2) and (0, 6).
On evaluating the value of Z, we get
Corner points Value of Z
O(0, 0) 11(0) + 7(0) = 0
A(2, 0) 11(2) + 7(0) = 22
B(2, 2) 11(2) + 7(2) = 36
C(0, 6) 11(0) + 7(6) = 42
From the above table it’s seen that the maximum value of Z is 42.
Therefore, the maximum value of Z is 42 at (0, 6).

2. Maximize Z = 3x + 4y, subject to the constraints: x + y  1, x  0, y  0.

Solution:

Given: Z = 3x + 4y and the constraints x + y  1, x  0,

y0
Taking x + y = 1, we have
x 1 0
y 0 1
Now, plotting all the constrain equations we see that the
shaded area OAB is the feasible region determined by
the constraints.
The area is feasible. So, maximum value will occur at
the corner points O(0, 0), A(1, 0), B(0, 1).
On evaluating the value of Z, we get
Corner points Value of Z
O(0, 0) 3(0) + 4(0) = 0
A(1, 0) 3(1) + 4(0) = 3
 B(0, 1) 3(0) + 4(1) = 4
From the above table it’s seen that the maximum value of Z is 4.
Therefore, the maximum value of Z is 4 at (0, 1).

3. Maximize the function Z = 11x + 7y, subject to the constraints: x  3, y  2, x  0, y  0.

Solution:

Given: Z = Z = 11x + 7y and the constraints x

 3, y  2, x  0, y  0.
Plotting all the constrain equations we see that
the shaded area OABC is the feasible region
determined by the constraints.
The feasible region is bounded with four corner
points O(0, 0), A(3, 0), B(3, 2) and C(0, 2).
So, the maximum value can occur at any corner.
On evaluating the value of Z, we get
Corner points Value of Z
O(0, 0) 11(0) + 7(0) = 0
A(3, 0) 11(3) + 7(0) = 33
B(3, 2) 11(3) + 7(2) = 47
C(0, 2) 11(0) + 7(2) = 14
From the above table it’s seen that the maximum value of Z is 47.
Therefore, the maximum value of the function Z is 47 at (3, 2).

4. Minimize Z = 13x – 15y subject to the constraints: x + y  7, 2x – 3y + 6  0, x  0, y  0.

Solution:

Given: Z = 13x – 15y and the constraints x + y  7,

2x – 3y + 6  0, x  0, y  0.
Taking x + y = 7, we have
x 4 3
y 3 4
And, taking 2x – 3y + 6 = 0 we have
x 1 -3
y 2 0
Now, plotting all the constrain equations we see that
the shaded area OABC is the feasible region
determined by the constraints.
The feasible region is bounded with four corners
O(0, 0), A(7, 0), B(3, 4) and C(0, 2).
So, the maximum value can occur at any corner.
On evaluating the value of Z, we get
Corner points Value of Z
O(0, 0) 13(0) – 15(0) = 0
A(7, 0) 13(7) – 15(0) = 91
 B(3, 4) 13(3) – 15(4) = -21
C(0, 2) 13(0) – 15(2) = -30
From the above table it’s seen that the minimum value of Z is -30.
Therefore, the minimum value of the function Z is -30 at (0, 2).

5. Determine the maximum value of Z = 3x + 4y if the feasible region (shaded) for a LPP is shown
in Fig. 12.7.

Solution:

As shown in the figure, OAED is the feasible region.

At A, y = 0 in equation 2x + y = 104 we get,
x = 52
This is a corner point A = (52, 0)
At D, x = 0 in equation x + 2y = 76 we get,
y = 38
This is another corner point D = (0, 38)
Now, solving the given equations x + 2y = 76 and 2x + y = 104 we have
2x + 4y = 152
2x + y = 104
(-)___(-)____(-)____
3y = 48 ⇒ y = 16
Using the value of y in the equation, we get
x + 2(16) = 76 ⇒ x = 76 – 32 = 44
So, the corner point E = (44, 16)
On evaluating the maximum value of Z, we get
Corner points Z = 3x + 4y
O(0, 0) Z = 3(0) + 4(0) = 0
A(52, 0) Z = 3(52) + 4(0) = 156
B(44, 16) Z = 3(44) + 4(16) = 196
D(0, 38) Z = 3(0) + 4(38) = 152
From the above table it’s seen that the maximum value of Z is 196.
Therefore, the maximum value of the function Z is 196 at (44, 16).
6. Feasible region (shaded) for a LPP is shown in Fig. 12.8. Maximize Z = 5x + 7y.

Solution:

Given: Z = 5x + 7y and feasible region OABC.

The corner points of the feasible region are O(0, 0), A(7, 0), B(3, 4) and C(0, 2).
On evaluating the value of Z, we get
Corner points Value of Z
O(0, 0) Z = 5(0) + 7(0) = 0
A(7, 0) Z = 5(7) + 7(0) = 35
B(3, 4) Z = 5(3) + 7(4) = 43
C(0, 2) Z = 5(0) + 7(2) = 14
From the above table it’s seen that the maximum value of Z is 43.
Therefore, the maximum value of the function Z is 43 at (3, 4).

7. The feasible region for a LPP is shown in Fig. 12.9. Find the minimum value of Z = 11x + 7y.

Solution:

In the given figure, it’s seen that the feasible region is ABCA. The corner points are C(0, 3), B(0, 5) and
for A, we have to solve equations
x + 3y = 9 and
x+y=5
(-)_(-)_(-)
2y = 4 ⇒ y = 2
And, putting value of y in the equation we get x = 3
So, the corner point is A(3, 2).

Now, evaluating the value of Z we get

Corner points Value of Z
A(3, 2) Z = 11(3) + 7(2)= 47
B(0, 5) Z = 11(0) + 7(5)= 35
C(0, 3) Z = 11(0) + 7(3)= 21
From the above table it’s seen that the minimum value
of Z is 21.

Therefore, the minimum value of the function Z is 21

at (0, 3).

8. Refer to Exercise 7 above. Find the maximum value of Z.

Solution:

In the evaluating table for the value of Z, it’s clearly seen that the maximum value of Z is 47 at (3, 2)

9. The feasible region for a LPP is shown in Fig. 12.10. Evaluate Z = 4x + y at each of the corner
points of this region. Find the minimum value of Z, if it exists.

Solution:

Given: Z = 4x + y
In the given figure, ABC is the feasible region which is open unbounded.
Here, we have
x+y=3 … (i)
and x + 2y = 4 …. (ii)
On solving equations (i) and (ii), we get
x = 2 and y = 1
So, the corner points are A(4, 0), B(2, 1) and C(0, 3)
Now on evaluating the value of Z, we have
Corner points Z = 4x + y
A(4, 0) Z = 4(4) + (0) = 16
 B(2, 1) Z = 4(2) + (1) = 9
C(0, 3) Z = 4(4) + (3) = 3

Now, the minimum value of Z is 3 at (0, 3) but

as, the feasible region is open bounded so it
may or may not be the minimum value of Z.
Hence, in order to face such a situation, we
usually draw a graph of 4x + y < 3 and check
whether the resulting open half plane has no
point in common with feasible region.
Otherwise Z will have no minimum value. So,
from the graph, we can conclude that there is no
common point with the feasible region.

Therefore, the function Z has the minimum

value at (0, 3).

10. In Fig. 12.11, the feasible region (shaded) for a LPP is shown. Determine the maximum and
minimum value of Z = x + 2y

Solution:

From the given figure, it’s seen that the corner points are as follows:
R(7/2, 3/4), Q(3/2, 15/4), P(3/13, 24/13) and S(18/7, 2/7).
Now, on evaluating the value of Z for the feasible region RQPS.
Corner points Value of Z = x + 2y
R(7/2, 3/4) Z = 7/2 +2(3/4) = 5
Q(3/2, 15/4) Z = 3/2 + 2(15/4) = 9
P(3/13, 24/13) Z = 3/13 + 2(24/13) = 51/13
S(18/7, 2/7) Z = 18/7 + 2(2/7) = 22/7
From the above table it’s seen that the minimum value of Z is 22/7 and maximum value of Z is 9.
Therefore, the maximum value of Z is 9 at (3/2, 15/4) and the minimum value of Z is 22/7 at (18/7, 2/7).

11. A manufacturer of electronic circuits has a stock of 200 resistors, 120 transistors and 150
capacitors and is required to produce two types of circuits A and B. Type A requires 20 resistors,
10 transistors and 10 capacitors. Type B requires 10 resistors, 20 transistors and 30 capacitors. If
the profit on type A circuit is Rs 50 and that on type B circuit is Rs 60, formulate this problem as a
LPP so that the manufacturer can maximize his profit.
Solution:

Let x units of type A and y units of type B electric circuits be produced by the manufacturer.
From the given information the below table is constructed:
Items Type A (x) Type B (y) Maximum stock
Resistors 20 10 200
Transistors 10 20 120
Capacitors 10 30 150
Profit Rs 50 Rs 60 Z = 50x + 60y
Now, the total profit function in rupees Z = 50x + 60y is to be maximized with subject to the constraints
20x + 10y ≤ 200 … (i); 10x + 20y ≤ 120 … (ii)
10x + 30y ≤ 150 … (iii); x ≥ 0, y ≥ 0 … (iv)
Therefore, the required LPP is
Maximize Z = 50x + 60y subject to the constraints
20x + 10y ≤ 200 2x + y ≤ 20;
10x + 20y ≤ 120 x + 2y ≤ 12 and
10x + 30y ≤ 150 x + 3y ≤ 15, x ≥ 0, y ≥ 0.

12. A firm has to transport 1200 packages using large vans which can carry 200 packages each
and small vans which can take 80 packages each. The cost for engaging each large van is Rs 400
and each small van is Rs 200. Not more than Rs 3000 is to be spent on the job and the number of
large vans cannot exceed the number of small vans. Formulate this problem as a LPP given that
the objective is to minimize cost.
Solution:

Let’s consider x and y to be the number of large and small vans respectively.
From the given information the below constrains table is constructed:
Items Large vans (x) Small vans (y) Maximum/Minimum
Packages 200 80 1200
Cost 400 200 3000
Now, the objective function for minimum cost is
Z = 400x + 200y
Subject to the constrains;
200x + 80y ≥ 1200 ⇒ 5x + 2y ≥ 30 ….. (i)
400x + 200y ≤ 3000 ⇒ 2x + y ≤ 15 ….. (ii)
x ≤ y …. (iii)
and x ≥ 0, y ≥ 0 (non-negative constraints)
Therefore, the required LPP is to minimize Z = 400x + 200y
Subject to the constraints 5x + 2y ≥ 30, 2x + y ≤ 15, x ≤ y and x ≥ 0, y ≥ 0.

13. A company manufactures two types of screws A and B. All the screws have to pass through a
threading machine and a slotting machine. A box of Type A screws requires 2 minutes on the
threading machine and 3 minutes on the slotting machine. A box of type B screws requires 8
minutes of threading on the threading machine and 2 minutes on the slotting machine. In a week,
each machine is available for 60 hours.
On selling these screws, the company gets a profit of Rs 100 per box on type A screws and Rs 170
per box on type B screws.
Formulate this problem as a LPP given that the objective is to maximize profit.
Solution:
Let’s consider that the company manufactures x boxes of type A screws and y boxes of type B screws.
From the given information the below table is constructed:
Items Type A (x) Type B (y) Minimum time
available on each
machine in a week
Time required on 2 8 60 x 60 = 3600 minutes
threading machine
Time required on 3 2 60 x 60 = 3600 minutes
slotting machine
Profit Rs 100 Rs 170
From the data in the above table, the objective function for maximum profit Z = 100x + 170y
Subject to the constraints
2x + 8y ≤ 3600 ⇒ x + 4y ≤ 1800 … (i)
3x + 2y ≤ 3600 … (ii)
x ≥ 0, y ≥ 0 (non-negative constraints)
Therefore, the required LPP is
Maximize: Z = 100x + 170y
Subject to constraints,
x + 4y ≤ 1800, 3x + 2y ≤ 3600, x ≥ 0, y ≥ 0.

14. A company manufactures two types of sweaters: type A and type B. It costs Rs 360 to make a
type A sweater and Rs 120 to make a type B sweater. The company can make at most 300 sweaters
and spend at most Rs 72000 a day. The number of sweaters of type B cannot exceed the number of
sweaters of type A by more than 100. The company makes a profit of Rs 200 for each sweater of
type A and Rs 120 for every sweater of type B.
Formulate this problem as a LPP to maximize the profit to the company.
Solution:

Let’s assume x and y to be the number of sweaters of type A and type B respectively.
From the question, the following constraints are:
360x + 120y ≤ 72000 ⇒ 3x + y ≤ 600 … (i)
x + y ≤ 300 … (ii)
x + 100 ≥ y ⇒ y ≤ x + 100 … (iii)
Profit: Z = 200x + 120y
Therefore, the required LPP to maximize the profit is
Maximize Z = 200x + 120y subject to constrains
3x + y ≤ 600, x + y ≤ 300, y ≤ x + 100, x ≥ 0, y ≥ 0.

15. A man rides his motorcycle at the speed of 50 km/hour. He has to spend Rs 2 per km on petrol.
If he rides it at a faster speed of 80 km/hour, the petrol cost increases to Rs 3 per km. He has at
most Rs 120 to spend on petrol and one hour’s time. He wishes to find the maximum distance that
he can travel.
Express this problem as a linear programming problem.
Solution:

Let’s assume the man covers x km on his motorcycle at the speed of 50km/hr and covers y km at the
speed of 50 km/hr and covers y km at the speed of 80 km/hr.
So, cost of petrol = 2x + 3y
The man has to spend Rs 120 atmost on petrol
⇒ 2x + 3y ≤ 120 …. (i)
Now, the man has only 1 hr time
So, x/50 + y/80 ≤ 1 ⇒ 8x + 5y ≤ 400 … (ii)
And, x ≥ 0, y ≥ 0
To have maximum distance Z = x + y.
Therefore, the required LPP to travel maximum distance is maximize Z = x + y, subject to the
constraints
2x + 3y ≤ 120, 8x + 5y ≤ 400, x ≥ 0, y ≥ 0.

Long Answer (L.A.)

16. Refer to Exercise 11. How many of circuits of Type A and of Type B, should be produced by
the manufacturer so as to maximize his profit? Determine the maximum profit.
Solution:

As per the solution of exercise 11, we have

Maximize Z = 50x + 60y subject to the
constraints
20x + 10y ≤ 200 2x + y ≤ 20 … (i)
10x + 20y ≤ 120 x + 2y ≤ 12 … (ii)
10x + 30y ≤ 150 x + 3y ≤ 15 … (iv)
x ≥ 0, y ≥ 0 … (iv)
Now, let’s construct a constrain table for
the above
Table for (i)
x 10 0
y 0 20
Table for (ii)
x 12 0
y 0 6
Table for (iii)
x 15 0
y 0 5
Next, solving equations (i) and (ii) we get,
x = 28/3, y = 4/3
So, the corner point is B(28/3, 4/3).
Solving equations (ii) and (iii) we get,
x = 6, y = 3 and the corner point is C(6, 3)
Lastly, solving equations (i) and (iii) we get,
x = 9, y = 2 (not included in the feasible region)
Here, OABCD is the feasible region.
Hence, the corner points are O(0, 0), A(10, 0), B(28/3, 4/3), C(6, 3) and D(0, 5).
Let us evaluate the value of Z
Corner points Corresponding value of Z = 50x + 60y
O(0, 0) Z = 50(0) + 60(0) = 0
A(10, 0) Z = 50(10) + 60(0) = 500
B(28/3, 4/3) Z = 50(28/3) + 60(4/3) = 1400/3 + 240/3
= 1640/3 = 546.6
C(6, 3) Z = 50(6) + 60(3) = 480
D(0, 5) Z = 50(0) + 60(5) = 300
So here, the maximum profit is Rs 546.6 which is not possible for number of items in fraction.
Therefore, the maximum profit for the manufacture is Rs 480 at (6, 3) i.e. Type A = 6 and Type B = 3.

17. Refer to Exercise 12. What will be the minimum cost?

Solution:

As per the solution of exercise 12, we have

The objective function for minimum cost is Z = 400x + 200y
Subject to the constrains;
5x + 2y ≥ 30 ….. (i)
2x + y ≤ 15 ….. (ii)
x ≤ y …. (iii)
and x ≥ 0, y ≥ 0 (non-negative
constraints)
Now, let’s construct a constrain
table for the above
Table for (i)
x 0 6
y 15 0
Table for (ii)
x 0 7.5
y 15 0
Table for (iii)
x 1 0
y 1 0
Next, solving equations (i) and (iii), we get
x = 30/7 and y = 30/7, so the corner point is A(30/7, 30/7)
On solving equations (ii) and (iii), we get
x = 5 and y = 5, so the corner point is B(5, 5)
Here, ABC is the shaded feasible region whose corner points are A(30/7, 30/7), B(5, 5) and C(0, 15)
On evaluating the value of Z, we have
Corner point Value of Z = 400x + 200y
A(30/7, 30/7) Z = 400(30/7) + 200(30/7) = 18000/7 = 2571.4
B(5, 5) Z = 400(5) + 200(5) = 3000
C(0, 15) Z = 400(0) + 200(15) = 3000
From the table it’s seen that the minimum value is 2571.4
Therefore, the required minimum cost is Rs 2571.4 at (30/7, 30/7)

18. Refer to Exercise 13. Solve the linear programming problem and determine the maximum
profit to the manufacturer.
Solution:

As per the solution of exercise 13, we have

The objective function for maximum profit
Z = 100x + 170y
Subject to constraints,
x + 4y ≤ 1800 …. (i)
3x + 2y ≤ 3600 … (ii)
x ≥ 0, y ≥ 0
Now, let’s construct a constrain table for
the above
Table for (i)
x 0 1800
y 450 0
Table for (ii)
x 0 1200
y 1800 0
Next, solving equations (i) and (ii), we get
x = 1080 and y = 180
It’s seen that OABC is the feasible region
whose corner points are O(0, 0), A(1200, 0), B(1080, 180) and C(0, 450).
On evaluating the value of Z, we have
Corner points Value of Z = 100x + 170y
O(0, 0) Z = 100(0) + 170(0) = 0
A(1200, 0) Z = 100(1200) + 170(0) = 120000
B(1080, 180) Z = 100(1080) + 170(180) = 138600
C(0, 450) Z = 100(0) + 170(450) = 76500
Form the table it’s seen that the maximum value of Z is 138600.
Therefore, the maximum profit of the function Z is 138600 at (1080, 180).

19. Refer to Exercise 14. How many sweaters of each type should the company make in a day to
get a maximum profit? What is the maximum profit?
Solution:
As per the solution of exercise 14, we have
Maximize Z = 200x + 120y subject to
constrains
3x + y ≤ 600 …. (i)
x + y ≤ 300 …. (ii)
x – y ≤ -100 …. (iii)
x ≥ 0, y ≥ 0
Now, let’s construct a constrain table
for the above
Table for (i)
x 0 200
y 600 0
Table for (ii)
x 0 300
y 300 0
Table for (iii)
x -100 0
y 0 100
Next, solving equation (i) and (iii) we
get
x = 100 and y = 200
On solving equation (i) and (ii), we get
x = 150 and y = 150
It’s seen that the shaded region is the feasible region whose corner points are O(0, 0), A(200, 0), B(150,
150), D(0, 100).
Evaluating the value of Z, we have
Corner points Value of Z = 2000x + 120y
O(0, 0) Z = 200(0) + 120(0) = 0
A(200, 0) Z = 200(200) + 120(0) = 40000
B(150, 150) Z = 200(150) + 120(150) = 48000
C(100, 200) Z = 200(100) + 120(200) = 44000
D(0, 100) Z = 200(0) + 120(100) = 12000
From the above table it’s seen that the maximum value is 48000.
Therefore, the maximum value of Z is 48000 at (150, 150) which means 150 sweaters of each type.

20. Refer to Exercise 15. Determine the maximum distance that the man can travel.
Solution:

As per the solution of exercise 15, we have

Maximize Z = x + y, subject to the constraints
2x + 3y ≤ 120 … (i)
8x + 5y ≤ 400 … (ii)
x ≥ 0, y ≥ 0
Now, let’s construct a constrain table for the above
Table for (i)
x 0 60
y 40 0
Table for (ii)
x 0 50
y 80 0
Next, solving equation (i) and (iii) we get
x = 300/7 and y = 80/7
It’s seen that the feasible region whose corner points
are O(0, 0), A(50, 0), B(300/7, 80/7) and C(0, 40).
Let’s evaluate the value of Z
Corner points Value of Z = x + y
O(0, 0) Z=0+0=0
A(50, 0) Z = 50 + 0 = 50
B(300/7, 80/7) Z = 300/7 + 80/7 = 380/7 = 54.3
C(0, 40) Z = 0 - 40 = 40
From above table the maximum value of Z is 54.3
Therefore, the maximum distance that the man can travel is 54.3 km at (300/7, 80/7).

21. Maximize Z = x + y subject to x + 4y  8, 2x + 3y  12, 3x + y  9, x  0, y  0.

Solution:

Given: Z = x + y subject to constraints, x + 4y  8,

2x + 3y  12, 3x + y  9, x  0, y  0
Constructing a constrain table for the above, we
have
Table for x + 4y = 8
x 0 8
y 2 0
Table for 2x + 3y = 12
x 0 6
y 4 0
Table for 3x + y = 9
x 3 0
y 0 9
On solving equations x + 4y  8 and 3x + y  9,
we get
x = 28/11 and y = 15/11
Here, it’s seen that OABC is the feasible region
whose corner points are O(0, 0), A(3, 0), B(28/11, 15/11) and C(0, 2).
Now, let’s evaluate the value of Z

Corner points Value of Z = x + y

O(0, 0) Z=0+0=0
A(3, 0) Z=3+0=3
B(28/11, 15/11) Z = 28/11 + 15/11 = 43/11 = 3.9
 C(0, 2) Z=0+2=2

From the above table it’s noticed that the maximum value of Z is 3.9
Therefore, the maximum value of Z is 3.9 at (28/11, 15/11).

22. A manufacturer produces two Models of bikes - Model X and Model Y. Model X takes 6 man-hours to
make per unit, while Model Y takes 10 man-hours per unit. There is a total of 450 man-hour available per
week. Handling and Marketing costs are Rs 2000 and Rs 1000 per unit for Models X and Y respectively.
The total funds available for these purposes are Rs 80,000 per week. Profits per unit for Models X and Y
are Rs 1000 and Rs 500, respectively. How many bikes of each model should the manufacturer produce so
as to yield a maximum profit? Find the maximum profit.
Solution:

Let’s take x an y to be the number of models of bike produced by the manufacturer.

From the question we have,
Model x takes 6 man-hours to make per unit
Model y takes 10 man-hours to make per unit
Total man-hours available = 450
So, 6x + 10y ≤ 450 ⇒ 3x + 5y ≤ 225 ….. (i)
The handling and marketing cost of model x and y
are Rs 2000 and Rs 1000 respectively.
And, the total funds available is Rs 80,000 per week
So, 2000x + 1000y ≤ 80000 ⇒ 2x + y ≤ 80 … (ii)
And, x ≥ 0, y ≥ 0
Now, the total profit (Z) per unit of models x and y
are Rs 1000 and Rs 500 repectively
⇒ Z = 1000x + 500y
Hence, the required LPP is
Maximize Z = 1000x + 500y subject to the
constraints
3x + 5y ≤ 225, 2x + y ≤ 80 and x ≥ 0, y ≥ 0
Now, let’s construct a constrain table for the above:
Table for (i)
x 75 0
y 0 45
Table for (ii)
x 0 40
y 80 0
Next, on solving equation (i) and (ii) we get
x = 25 and y = 30
After plotting all the constraint equations, we observe that the feasible region is OABC, whose corner
points are O(0, 0), A(40, 0), B(25, 30) and C(0, 45).
On evaluating the value of Z, we get
Corner points Value of Z = 1000x + 500y
O(0, 0) Z = 1000(0) + 500(0) = 0
A(40, 0) Z = 1000(40) + 500(0) = 40,000
 B(25, 30) Z = 1000(25) + 500(30) = 40,000
C(0, 45) Z = 1000(0) + 500(45) = 22,500

Therefore, from the above table it’s seen that the maximum profit is Rs 40,000.
The maximum profit can be achieved by producing 25 bikes of model x and 30 bikes of model Y or by
producing 40 bikes of model x.
 Chapter 12 Linear Programming
EXERCISE 12.1

Question 1:

Maximise Z = 3x + 4y

Subject to the constraints:

Answer:

The feasible region determined by the constraints, x + y ≤ 4, x ≥ 0, y ≥ 0, is as follows.

The corner points of the feasible region are O (0, 0), A (4, 0), and B (0, 4). The values of Z at
these points are as follows.

Corner point Z = 3x + 4y
O(0, 0) 0
A(4, 0) 12
B(0, 4) 16 → Maximum

Therefore, the maximum value of Z is 16 at the point B (0, 4).

Question 2:

Minimise Z = −3x + 4y

subject to .

Answer:
The feasible region determined by the system of constraints, x ≥ 0,
and y ≥ 0, is as follows.

The corner points of the feasible region are O (0, 0), A (4, 0), B (2, 3), and C (0, 4).

The values of Z at these corner points are as follows.

Corner point Z = −3x + 4y

0(0, 0) 0
A(4, 0) −12 → Minimum
B(2, 3) 6
C(0, 4) 16

Therefore, the minimum value of Z is −12 at the point (4, 0).

Question 3:

Maximise Z = 5x + 3y

subject to .

Answer:

The feasible region determined by the system of constraints, 3x + 5y ≤ 15,

5x + 2y ≤ 10, x ≥ 0, and y ≥ 0, are as follows.

The corner points of the feasible region are O (0, 0), A (2, 0), B (0, 3), and .

The values of Z at these corner points are as follows.

Corner point Z = 5x + 3y
0(0, 0) 0
A(2, 0) 10
B(0, 3) 9
→ Maximum

Therefore, the maximum value of Z is

Question 4:

Minimise Z = 3x + 5y

such that .

Answer:

The feasible region determined by the system of constraints, , and x, y ≥

0, is as follows.
It can be seen that the feasible region is unbounded.

The corner points of the feasible region are A (3, 0), , and C (0, 2).

The values of Z at these corner points are as follows.

Corner point Z = 3x + 5y
A(3, 0) 9
7 → Smallest

C(0, 2) 10

As the feasible region is unbounded, therefore, 7 may or may not be the minimum value of
Z.

For this, we draw the graph of the inequality, 3x + 5y < 7, and check whether the resulting
half plane has points in common with the feasible region or not.

It can be seen that the feasible region has no common point with 3x + 5y < 7 Therefore, the

minimum value of Z is 7 at .

Question 5:

Maximise Z = 3x + 2y

subject to .
Answer:

The feasible region determined by the constraints, x + 2y ≤ 10, 3x + y ≤ 15, x ≥ 0, and y ≥ 0,

is as follows.

The corner points of the feasible region are A (5, 0), B (4, 3), and C (0, 5).

The values of Z at these corner points are as follows.

Corner point Z = 3x + 2y
A(5, 0) 15
B(4, 3) 18 → Maximum
C(0, 5) 10

Therefore, the maximum value of Z is 18 at the point (4, 3).

Question 6:

Minimise Z = x + 2y

subject to .

Answer:
The feasible region determined by the constraints, 2x + y ≥ 3, x + 2y ≥ 6, x ≥ 0, and y ≥ 0, is
as follows.

The corner points of the feasible region are A (6, 0) and B (0, 3).

The values of Z at these corner points are as follows.

Corner point Z = x + 2y
A(6, 0) 6
B(0, 3) 6

It can be seen that the value of Z at points A and B is same. If we take any other point such
as (2, 2) on line x + 2y = 6, then Z = 6

Thus, the minimum value of Z occurs for more than 2 points.

Therefore, the value of Z is minimum at every point on the line, x + 2y = 6

Question 7:

Minimise and Maximise Z = 5x + 10y

subject to .
Answer:

The feasible region determined by the constraints, x + 2y ≤ 120, x + y ≥ 60, x − 2y ≥ 0, x ≥ 0,

and y ≥ 0, is as follows.

The corner points of the feasible region are A (60, 0), B (120, 0), C (60, 30), and D (40, 20).

The values of Z at these corner points are as follows.

Corner point Z = 5x + 10y

A(60, 0) 300 → Minimum
B(120, 0) 600 → Maximum
C(60, 30) 600 → Maximum
D(40, 20) 400

The minimum value of Z is 300 at (60, 0) and the maximum value of Z is 600 at all the
points on the line segment joining (120, 0) and (60, 30).

Question 8:

Minimise and Maximise Z = x + 2y

subject to .

Answer:

The feasible region determined by the constraints, x + 2y ≥ 100, 2x − y ≤ 0, 2x + y ≤ 200, x ≥

0, and y ≥ 0, is as follows.
The corner points of the feasible region are A(0, 50), B(20, 40), C(50, 100), and D(0, 200).

The values of Z at these corner points are as follows.

Corner point Z = x + 2y
A(0, 50) 100 → Minimum
B(20, 40) 100 → Minimum
C(50, 100) 250
D(0, 200) 400 → Maximum

The maximum value of Z is 400 at (0, 200) and the minimum value of Z is 100 at all the
points on the line segment joining the points (0, 50) and (20, 40).

Question 9:

Maximise Z = − x + 2y, subject to the constraints:

Answer:

The feasible region determined by the constraints, is

as follows.
It can be seen that the feasible region is unbounded.

The values of Z at corner points A (6, 0), B (4, 1), and C (3, 2) are as follows.

Corner point Z = −x + 2y
A(6, 0) Z=−6
B(4, 1) Z=−2
C(3, 2) Z=1

As the feasible region is unbounded, therefore, Z = 1 may or may not be the maximum
value.

For this, we graph the inequality, −x + 2y > 1, and check whether the resulting half plane
has points in common with the feasible region or not.

The resulting feasible region has points in common with the feasible region.

Therefore, Z = 1 is not the maximum value. Z has no maximum value.

Question 10:

Maximise Z = x + y, subject to .

Answer:

The region determined by the constraints, is as follows.

There is no feasible region and thus, Z has no maximum value.
Page 1
Class 12th mathematics

12 LINEAR PROGRAMMING
MIND MAP
CLICK TO DOWNLOAD MORE CHAPTERS
WWW.EDUCATORSRESOURCE.IN