Title of the Project

To find the minimum

cost by applying the
concept of
transportation in LLP
(Linear Programming
Problems)

16
 INDEX
SL No. Topic Page No.
1. Title of the Project 1
2. Aims and Observation 2
3. Previous Knowledge 3
4. Contents (Project 1)
 Functions
 Types of Functions
 Define One To One Function
 One to One Graph –
Horizontal Line Test
 One to One Function Inverse
 Properties on One To One
Function
 Examples
 Conclusion
 Acknowledgment
 Bibliography
5. Contents (Project 2) 4-15
 Linear Programming
 What is Linear Programming
 Components of Linear
Programming
 Linear Programming
Examples
 Types of Linear Programming
Problems
 Linear Programming Methods
 Simplex Method
 Graphical Method
 Numericals
6. Conclusion 16
7. Acknowledgment and Bibliography
same as project 1

16
 Aims and Observation

In Mathematics, linear programming is a method of optimising operations with some

constraints. The main objective of linear programming is to maximize or minimize the
numerical value. It consists of linear functions which are subjected to the constraints in the
form of linear equations or in the form of inequalities. Linear programming is considered an
important technique that is used to find the optimum resource utilisation. The term “linear
programming” consists of two words as linear and programming. The word “linear” defines
the relationship between multiple variables with degree one. The word “programming”
defines the process of selecting the best solution from various alternatives.

Linear Programming is widely used in Mathematics and some other fields such as economics,
business, telecommunication, and manufacturing fields. In this article, let us discuss the
definition of linear programming, its components, and different methods to solve linear
programming problems.

16
 Linear Programming
Linear programming is a mathematical concept that is used to find the optimal solution of
the linear function. This method uses simple assumptions for optimizing the given function.
Linear Programming has a huge real-world application and it is used to solve various types
of problems.
The term “linear programming” consists of two words linear and programming, the word
linear tells the relation between various types of variables of degree one used in a problem
and the word programming tells us the step-by-step procedure to solve these problems.
In this article, we will learn about linear programming, its examples, formulas, and other
concepts in detail.

What is Linear Programming?

Linear programming or Linear optimization is a technique that helps us to find the
optimum solution for a given problem, an optimum solution is a solution that is the best
possible outcome of a given particular problem.
In simple terms, it is the method to find out how to do something in the best possible way.
With limited resources, you need to do the optimum utilization of resources and achieve the
best possible result in a particular objective such as least cost, highest margin, or least
time.
The situation that requires a search for the best values of the variables subject to certain
constraints is where we use linear programming problems. These situations cannot be
handled by the usual calculus and numerical techniques.

Components of Linear Programming

The basic components of a linear programming(LP) problem are:
 Decision Variables: Variables you want to determine to achieve the optimal solution.
 Objective Function: Mathematical equation that represents the goal you want to
achieve

16
 Constraints: Limitations or restrictions that your decision variables must follow.
 Non-Negativity Restrictions: In some real-world scenarios, decision variables cannot
be negative

Additional Characteristics of Linear Programming

 Finiteness: The number of decision variables and constraints in an LP problem are
finite.
 Linearity: The objective function and all constraints must be linear functions of the
decision variables. It means the degree of variables should be one.

Linear Programming Examples

We can understand the situations in which Linear programming is applied with the help of
the example discussed below,
Suppose a delivery man has to deliver 8 packets in a day to the different locations of a city.
He has to pick all the packets from A and has to deliver them to points P, Q, R, S, T, U, V,
and W. The distance between them is indicated using the lines as shown in the image
below. The shortest path followed by the delivery man is calculated using the concept of
Linear Programming.

Linear Programming Problems

Linear Programming Problems (LPP) involve optimizing a linear function to find the
optimal value solution for the function. The optimal value can be either the maximum value
or the minimum value.

16
In LPP, the linear functions are called objective functions. An objective function can have
multiple variables, which are subjected to conditions and have to satisfy the linear
constraints.

Types of Linear Programming Problems

There are many different linear programming problems(LPP) but we will deal with three
major linear programming problems in this article.
Manufacturing Problems
Manufacturing problems are a problem that deals with the number of units that should be
produced or sold to maximize profits when each product requires fixed manpower, machine
hours, and raw materials.
Diet Problems
It is used to calculate the number of different kinds of constituents to be included in the diet
to get the minimum cost, subject to the availability of food and their prices.
Transportation Problems
It is used to determine the transportation schedule to find the cheapest way of transporting a
product from plants /factories situated at different locations to different markets.
Linear Programming Formula
A linear programming problem consists of,
 Decision variables
 Objective function
 Constraints
 Non-Negative restrictions
Decision variables are the variables x, and y, which decide the output of the linear
programming problem and represent the final solution.
The objective function, generally represented by Z, is the linear function that needs to be
optimized according to the given condition to get the final solution.
The restrictions imposed on decision variables that limit their values are called constraints.
Now, the general formula of a linear programming problem is,
Objective Function: Z = ax + by
Constraints: cx + dy ≥ e, px + qy ≤ r
Non-Negative restrictions: x ≥ 0, y ≥ 0
In the above condition x, and y are the decision variables.
How to Solve Linear Programming Problems?

16
Before solving the linear programming problems first we have to formulate the problems
according to the standard parameters. The steps for solving linear programming problems
are,
Step 1: Mark the decision variables in the problem.
Step 2: Build the objective function of the problem and check if the function needs to be
minimized or maximized.
Step 3: Write down all the constraints of the linear problems.
Step 4: Ensure non-negative restrictions of the decision variables.
Step 5: Now solve the linear programming problem using any method generally we use
either the simplex or graphical method.

Linear Programming Methods

We use various methods for solving linear programming problems. The two most common
methods used are,
 Simplex Method
 Graphical Method
Let’s learn about these two methods in detail in this article,

Linear Programming Simplex Method

One of the most common methods to solve the linear programming problem is the simplex
method. In this method, we repeat a specific condition ‘n’ a number of times until an
optimum solution is achieved.
The steps required to solve linear programming problems using the simplex method are,
Step 1: Formulate the linear programming problems based on the given constraints.
Step 2: Convert all the given inequalities to equations or equalities of the linear
programming problems by adding the slack variable to each inequality where ever
required.
Step 3: Construct the initial simplex table. By representing each constraint equation in a
row and writing the objective function at the bottom row. The table so obtained is called
the Simplex table.
Step 4: Identify the greatest negative entry in the bottom row the column of the element
with the highest negative entry is called the pivot column
Step 5: Divide the entries of the right-most column with the entries of the respective pivot
column, excluding the entries of the bottommost row. Now the row containing the least

16
entry is called the pivot row. The pivot element is obtained by the intersection of the pivot
row and the pivot column.
Step 6: Using matrix operation and with the help of the pivot element make all the entries
in the pivot column to be zero.
Step 7: Check for the non-negative entries in the bottommost row if there are no negative
entries in the bottom row, end the process else start the process again from step 4.
Step 8: The final simplex table so obtained gives the solution to our problem.

Linear Programming Graphical Method

Graphical Method is another method than the Simplex method which is used to solve linear
programming problems. As the name suggests this method uses graphs to solve the given
linear programming problems. This is the best method to solve linear programming
problems and requires less effort than the simplex method.
While using this method we plot all the inequalities that are subjected to constraints in the
given linear programming problems. As soon as all the inequalities of the given LPP are
plotted in the XY graph the common region of all the inequalities gives the optimum
solution. All the corner points of the feasible region are calculated and the value of the
objective function at all those points is calculated then comparing these values we get the
optimum solution of the LPP.
Example: Find the maximal and minimal value of z = 6x + 9y when the constraint
conditions are,
 2x + 3y ≤ 12
 x and y ≥ 0
 x+y≤5
Solution:
Step 1: First convert the inequations into normal equations. Hence the equations will be
2x+3y = 0, x = 0, y = 0 and x + y = 5.
Step 2: Find the points at which 2x + 3y and x + y = 5 cut the x-axis and y-axis. To find the
point of intersection of the x-axis put y = 0 in the respective equation and find the point.
Similarly for y-axis intersection points put x = 0 in the respective equation.
Step 3: Draw the two lines cutting the x-axis and y-axis. We find that the two axes cut each
other at (3,2).

16
Step 4: For x ≥ 0 and y ≥ 0, we find that both inequations are followed. Hence the region
will include an area region enclosed by two axes and both lines including the origin. The
plotted region is shown below in the figure.
Step 5: Find Z for each point and maxima and minima.

Coordinates Z = 6x + 9y

(0,5) Z = 45

(0,4) Z = 36

(5,0) Z = 30

(6,0) Z = 36

(3,2) Z = 36

Hence, we find that Z = 6x + 9y is maximum at (0,5) and minimum at (5,0).

Linear Programming
Applications
Linear Programming has applications in various fields. It is used to find the minimum cost
of a process when all the constraints of the problems are given. It is used to optimize the
transportation cost of the vehicle, etc. Various applications of Linear Programming are

16
Engineering Industries
Engineering Industries use linear programming to solve design and manufacturing problems
and to get the maximum output from a given condition.
Manufacturing Industries
Manufacturing Industries use linear programming to maximize the profit of the companies
and to reduce the manufacturing cost.
Energy Industries
Energy companies use linear programming to optimize their production output.
Transportation Industries
Linear programming is also used in transportation industries to find the path to minimize
the cost of transportation.
Importance of Linear Programming
Linear Programming has huge importance in various industries it maximizes the output
value while minimizing the input values according to various constraints.
LP is highly applicable when we have multiple conditions while solving a problem and we
have to optimize the output of the problem i.e. either we have to find the minimum or the
maximum value according to a given condition.

16
 NUMERICALS

Since number of units transported to each depot must be greater than or equal
to zero :-
∴ x ≥ 0 , y ≥0

16
16
16
Minimum cost = Rs 1550

From P : 0,5,3 units to depots A,B,C respectively

From Q : 5,0,1 units to depots A,B,C respectively

Corner Points Value of objective function

16
 1
Z= 10 (3x+y+39500)

A (3000,0) z = 4850

B (4500,0) z = 5300

C (4500,2500) 1
Z= 10 (13500+2500+39500)
= 5550
D (4000,3000) 1
Z= 10 (12000+3000+39500)
= 5450
E (500,3000) 1
Z= 10 (1500+3000+39500)
= 4400

z is Minimum at x=500 & y= 3000

∴From A: 500 liters, 3000 liters & 3500 liters to D, E, F Respectively

∴From B: 4000 liters, 0 liter and 0 liter to D, E, F Respectively

and Min transportation cost is Rs. 4400 ans.

Q.6) If a young man drives his vehicle at, he has to spend Rs. 2 per km on
petrol. If he drives it at a faster speed of, the petrol cost increases to. He has
Rs. 100 to spend on petrol and travel with one hour. Express this on LPP and
solve the same.

Sol.6) Let x km distance traveled with speed and y km distance traveled with
speed. Let z total distance traveled.

LPP:

Maximize. (Distance)

Z=x+y

subject to constraints

2x + 5y ≤ 100 .....(Investment on petrol constraint)

16
 Conclusion
Linear programming is a systematic and structured approach to solving optimization
problems. It can be used to maximize or minimize a desired outcome while considering
constraints. Here are some conclusions about linear programming:

A powerful tool

16
Linear programming is a valuable tool for decision-making that can help organizations save
time and money. It can be used in a wide range of industries, including agriculture,
engineering, supply chain management, healthcare, and transportation.

Provides clear results

Linear programming can provide clear, actionable results that help organizations make data-
driven decisions.

Can solve complex problems

Linear programming can be used to solve complex problems by representing them

mathematically and then finding the optimal solution.

Can be solved graphically

Linear programming problems with two variables can be solved using the graphical method,
which is visual and provides a clear picture.

Has multiple categories

Linear programming can be divided into three categories: integer programming, nonlinear
programming, and mixed-integer programming.

Has assumptions and limitations

Linear programming has certain assumptions and limitations, but it can still provide practical
solutions to complex problems.

16