Abhinav K Anudath

XII Science

Linear Programming
Index
● Introduction
● Components of Linear Programming
● Characteristics of Linear Programming
● Questions on Linear Programming
● Linear Programming Real-World Applications
● Importance of Linear Programming
● Bibliography
Introduction

Linear Programming is a modelling technique in which a linear function is

maximised or minimised when subjected to various constraints. It is
considered an important technique that is used to find the optimum
resource utilisation. The term “linear” defines the relationship between
multiple variables and the word “programming” defines the process of
selecting the best solution from various alternatives.
The technique of Linear Programming has been useful for guiding
quantitative decisions in business planning, in industrial engineering and it
has been widely used in the field of economics, telecommunications and
manufacturing fields.
In simple words, linear programming is considered as an optimisation
method which helps find the best optimal solution with a set of
requirements.

Components of Linear Programming

● Decision Variable
● Constraints
● Data
● Objective Functions

Characteristics of Linear Programming

Constraints - The limitations should be expressed in the mathematical form
regarding the resource.
Objective - In a problem, the objective function should be specified in a
quantitative way.
Linearity - The relationship between two or more variables in the function
must be linear.
Decision Variable - The decision variable will decide the output. It gives the
ultimate solution to the problem. For any problem, the first step is to identify
the decision variable.

Questions on Linear Programming

If the problem has two decision variables, a graphical method is the best
method to find the optimal solution. In this method, the set of inequalities
are subjected to constraints. Then the inequalities are plotted in the X and
Y planes. Once all the inequalities are plotted, the intersecting region will
help to decide the feasible region. The feasible region will provide the
optimal solution as well as explain what all values our models take.

Question:
Calculate the maximal and minimal value of z = 5x+3y for the following
constraints

x + 2y ≤ 14
3x – y ≥ 0
x–y≤2
The three inequalities indicate the constraints. The area of the plane that
will be marked is the feasible region
First solve each inequality

x + 2y ≤ 14 ⇒ y ≤ -(1/2)x + 7
3x – y ≥ 0 ⇒ y ≤ 3x
x–y≤2⇒y≥x–2
The graph for the above equations:
Now pair the lines to find the corner
points
 ● y = -(½) x + 7
y = 3x
We get corner points as (2, 6)

● y = -1/2 x + 7
y=x–2
We get corner points as (6, 4)

● y = 3x
y=x–2
We get corner points as (-1, -3)

For linear systems, the maximum and minimum values of the

optimisation equation lie on the corners of the feasibility region.
Therefore, to find the optimum solution, we need to plug these three
points in z = 3x + 4y
(2, 6) : z = 5(2) + 3(6) = 10 + 18 = 28

(6, 4) : z = 5(6) + 3(4) = 30 + 12 = 42

(-1, -3) : z = 5(-1) + 3(-3) = -5 -9 = -14
The maximum of z = 42 lies at (6, 4)
The minimum of z = -14 lies at (-1, -3)
Linear Programming Real-World Applications
A real world example would be considering the limitations of labours and
materials and finding the best production levels for maximum profit. It is a
part of a vital area of mathematics and is called optimisation techniques.
Common applications of Linear Programming are :

● Engineering - It solves design and manufacturing problems as it is

helpful for doing shape optimisation
● Efficient Manufacturing - Companies use linear expressions to
maximise profits.
● Energy Industry - It provides methods to optimise the electric power
system.
● Transportation Optimisation - For cost and time efficiency.

Importance of Linear Programming

Linear Programming is broadly applied in the field of optimisation for many
reasons. Many functional problems in operation analysis can be
represented as linear programming. Some special problems of linear
programming such as network flow queries and multi-commodity flow
queries are deemed to have produced much research on functional
algorithms for their solution. Linear Programming techniques improve the
quality of decisions. The decision-making approach of the user becomes
more objective and less subjective. Linear Programming also helps in
re-evaluation of a basic plan for changing conditions. If conditions change
when the plan is partly carried out, they can be determined so as to adjust
the remainder of the plan for best results.
Question

A manufacturer produces nuts and bolts. It takes 1 hour of work on

machine A and 3 hours of work on machine B to produce packets of nuts. It
takes 3 hours on machine A and 1 hour on machine B for a packet of bolts.
The manufacturer earns a profit of ₹17.50 per packet of nuts and ₹7 per
packet of bolts. How many packets of each should be produced each day
so as to maximise the profit, if the manufacturer operates his machines at
most 12 hours a day?

Let
x be machine A
y be machine B

x + 3y <= 12
3x + y <= 12

∴ z = 17.50x + 7y

x + 3y = 12
3x + y = 12

Point OABC
O (0, 0) = 17.50 x 0 + 7x0 =0
A (4, 0) = 17.50 x 4 + 7x0 = ₹70
B (3, 3) = 17.50 x 3 + 7x3 = ₹73.5
C (0, 4) = 17.50 x 0 + 7x4 = ₹24

∴ Maximum profit = ₹73.50

Bibliography

www.britannica.com

www.analyticsvidhya.com

www.purplemath.com

www.byjus.com