LINEAR
PROGRAMMING
(Group 8)
Introduction
Linear programming is the simplest way of optimizing a problem.
Through this method, we can formulate a real-world problem into a
mathematical model. There are various methods for solving Linear
Programming Problems and one of the easiest and most important
methods for solving LPP is the graphical method. In Graphical
Solution of Linear Programming, we use graphs to solve LPP.
We can solve a wide variety of problems using Linear
programming in different sectors, but it is generally used for
problems in which we have to maximize profit, minimize cost, or
minimize the use of resources.
TABLE OF CONTENTS
•Linear Programming
•Graphical Solution
Lorem ipsum dolor sit amet,
of a Linear Programming
consectetur adipiscing elit.
Problems
Sed eget lorem ac nibh auctor
•Corner Point
euismod. Duis malesuada, mi a
vehicula vehicula, quam nisl
Methods
fringilla neque, vel tristique
orci nisl sed diam.
Types of Linear
Programming
Problems
Manufacturing
Problem:
In this type of problem, some constraints like
manpower, output units/hour, and machine hours are
given in the form of a linear equation. And we have
to find an optimal solution to make a maximum profit
or minimum cost.
Diet Problem:
These problems are generally easy to
understand and have fewer variables. Our
main objective in this kind of problem is to
minimize the cost of diet and to keep a
minimum amount of every constituent in the
diet.
Transportation
Problem:
In these problems, we have to find
the cheapest way of transportation
by choosing the shortest
route/optimized path.
Corner Point
Methods
Step 1: Create mathematical formulation from
the given problem. If not given.
Step 2: Now plot the graph using the given
constraints and find the feasible region.
Step 3: Find the coordinates of the feasible
region(vertices) that we get from step 2.
Step 4: Now evaluate the objective function at
each corner point of the feasible region. Assume
N and n denotes the largest and smallest values
of these points.
Step 5: If the feasible region is bounded then N
and n are the maximum and minimum value of
the objective function. Or if the feasible region
is unbounded then:
N is the maximum value of the objective function if the
open half plan is got by the ax + by > N has no common
point to the feasible region. Otherwise, the objective
function has no solution.
n is the minimum value of the objective function if the
open half plan is got by the ax + by < n has no common
point to the feasible region. Otherwise, the objective
function has no solution.
Solution:
EXAMPLE 1:
Step 1: Constraints are,
Solve the given linear x + y ≤ 40
programming problems 2x + y ≤ 60
graphically: x ≥ 0, y ≥ 0
Maximize: Z = 8x + y
Constraints are, Step 2: Draw the graph
x + y ≤ 40 using these constraints.
2x + y ≤ 60
x ≥ 0, y ≥ 0
Here both the constraints
are less than or equal to,
so they satisfy the below
region (towards origin).
You can find the vertex of
feasible region by graph,
or you can calculate using
the given constraints:
x + y = 40 …(i)
2x + y = 60 …(ii)
Now multiply eq(i) by 2 and
then subtract both eq(i) and
(ii), we get
y = 20
Now put the value of y in any
of the equations, we get
x = 20
So the third point of the
feasible region is (20, 20)
Step 3: To find the maximum value
of Z = 8x + y. Compare each
intersection point of the graph to
find the maximum value
Points Z = 8x + y
(0, 0) 0
(0, 40) 40
(20, 20) 180
(30, 0) 240
So the maximum value of Z =
240 at point x = 30, y = 0.
Example 2: 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.
Solution:
Step 1: Create a table like
this for easy understanding.
Flour(g) Fat(g)
Cake of
first kind
(x)
200 25
Cake of
second 100 50
kind (y)
Availability 5000 1000
Step 2: Create linear
equation using inequality
200x + 100y ≤ 5000 or
2x + y ≤ 50
25x + 50y ≤ 1000 or x
+ 2y ≤ 40
Also, x > 0 and y > 0
Step 3: Create a
graph using the
inequality
(remember only to
take positive x and
y-axis)
Step 4: To find the maximum number of
cakes (Z) = x + y. Compare each
intersection point of the graph to find the
maximum number of cakes that can be
baked.
X Y Z = (x+y)
O 20 20
20 10 30
25 0 25
Clearly, Z is maximum at
co-ordinate (20, 10). So
the maximum number of
cakes that can be baked
is Z = 20 + 10 = 30.
Application (Creativity)
Solve for the optimal solution of the given LPPs.
A. Maximize:P = 2x + 3y
Application Subject to:
(Creativity) x + 3y <= 15
x + y <= 6
x + y <= 3
x >= 0, y >= 0
To determine the optimal
number of steel cabinets and
rolling chairs that should be
made per day to maximize
profit, we can use linear
programming.
Let's define the variables:
Let x = number of steel cabinets
produced per day
Let y = number of rolling chairs
produced per day
The objective function P, representing
the total profit, can be defined as:
P = 1925x + 1375y
Now, let's consider the constraints:
1. Assembly work constraint: 3x + 2y ≤
100 (maximum 100 hours of assembly
work per day)
2. Painting work constraint: 1.5x + 0.5y ≤
25 (maximum 25 hours of painting work
per day)
3. Non-negativity constraint: x ≥ 0, y ≥ 0
(the number of cabinets and chairs cannot
be negative)
We can now solve this linear programming
problem to find the optimal solution.
Using the graphical method, we can
plot the feasible region based on the
constraints and identify the corner
points. We will then evaluate the
objective function at each corner
point to find the maximum profit.
Alternatively, we can use linear
programming software or tools to
solve the problem and find the
optimal solution directly.
Note:
Please note that without specific
numerical values for the
constraints, we cannot determine
the exact quantities of steel
cabinets and rolling chairs that
maximize profit. However, by using
linear programming techniques,
you can input the numerical values
into the model and find the optimal
solution.
Summary:
Systems of linear inequalities are essential
tools to optimize the available resources.
They are needed to model the problems to
come up with reliable decisions and
judgments for the benefit of the company,
Linear programming graphical method
shows a way of finding the optimal
solutions to every business problem
involving allocation of available resources.
Summary:
Linear Programming (LP) is a mathematical
optimization technique for decision-making. It
seeks to maximize or minimize a linear objective
function within a set of linear constraints. LP is
widely used in operations research, economics,
and various fields to find the most efficient
allocation of resources or the best course of
action, offering practical solutions to complex
problems.
The team
Allyzon Visayas Ruby Grace Zamudio
Harvey Villareal
THANK
YOU
