Siliguri Institute of Technology

Department of Information Technology(IT)

7TH Semester 2023-2024
PPT for CA-1Assignment

Student Name:Trisha Dutta

University roll number-11900220014
Subject Name-operations Rsearch
 Linear Programming

• In Mathematics, linear programms 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.
 What is Linear Programming ?
• Linear programming (LP) or Linear Optimisation may be
defined as the problem of maximizing or minimizing a
linear function that is subjected to linear constraints. The
constraints may be equalities or inequalities. The
optimisation problems involve the calculation of profit
and loss. Linear programming problems are an
important class of optimisation problems, that helps to
find the feasible region and optimise the solution in
order to have the highest or lowest value of the function.
 Components of linear programming:

Decision Variable
Constraints
Data
Objective Functions
 Characteristics of Linear Programming
The following are the five characteristics of the linear programming problem:

• Constraints – The limitations should be expressed in the mathematical form,

regarding the resource.
• Objective Function – 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. It means that the degree of the variable is one.
•
Finiteness – There should be finite and infinite input and output numbers. In
case, if the function has infinite factors, the optimal solution is not feasible.
 Characterristic of linear programming
• Non-negativity – The variable value should be
positive or zero. It should not be a negative value.
•
Decision Variables – The decision variable will decide
the output. It gives the ultimate solution of the
problem. For any problem, the first step is to identify
the decision variables.
 Linear Programming Problems

• The Linear Programming Problems (LPP) is a problem that is

concerned with finding the optimal value of the given linear
function. The optimal value can be either maximum value or
minimum value. Here, the given linear function is considered an
objective function. The objective function can contain several
variables, which are subjected to the conditions and it has to satisfy
the set of linear inequalities called linear constraints. The linear
programming problems can be used to get the optimal solution for
the following scenarios, such as manufacturing problems, diet
problems, transportation problems, allocation problems and so on.
 Formulation of LPP

• Identify the decision variable.

• Write the Objective Function
• Write the constraints
• State the non-negative restrictions
Types of Linear Programming Problems

• Manufacturing Problem
• Diet Problem
• Transportation Problem
• Optimal Assignment Problem
 Methods to solve Linear Programming Problems

• Graphical Method
• Simplex Method
• North West Corner Method
• Least Square Methods
 Graphical Method

• Steps for Graphical Method:

• Formulate the LPP.
• Construct the graph and plot all the constraint lines.
• Determine the valid side of each constraint line.
• Identify the feasible solution region.
• Find the optimum points.
• Calculate the coordinates of optimum points.
Example: Solve the given linear programming problem by graphical
method.

Max Z = f(x, y) = 3x + 2y
Constraints: 2x + y <= 18
2x + 3y <= 42
3x + y <= 24
x >= 0, y >= 0
Now, let’s plot the graph of the given constraints and find
the feasible region.
Corner point F(x,y) = 3x+2y
(0,0) 0

(8,0) 24

(6,6) 30

(3,12) 33

(0,14) 28
 Application of Linear Problem
Linear Programming Problems has their application across different domains like manufacturing/
transportation/ sports/ share market/ engineering/ energy industry/ machine learning, etc. But here,
we will discuss some of its real-life applications.
• Let ‘n’ number of tasks and ‘m’ number of people completing the task. Now, assign the task so that
overall productivity is optimum. We will get the optimum solution by setting the minimum cost,
time is taken by each person or maximum profit. This type of problem is a type of Optimal
Assignment problem.
• Transport Company: Company like and Rapidouses LPP to optimize delivery routes. The
objective of these companies is to reduce time and operational costs and increase revenue.
• Transport Company: Company like ola, uber, and Rapido uses LPP to optimize delivery routes.
The objective of these companies is to reduce time and operational costs and increase revenue.
•Machine Learning: Supervised learning works on the fundamental of
linear programming.