Scribd
Upload
9 views

Chapter IV Linear Programming

Uploaded by

tbosorio
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
9 views

Chapter IV Linear Programming

Uploaded by

tbosorio
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 23

Linear programming

Graphical Method

Maximization Model
Linear programming
is a process that is used to determine the best outcome of a linear function. It is
the best method to perform linear optimization by making a few simple
assumptions. The linear function is known as the objective function. Real-world
relationships can be extremely complicated. However, linear programming can
be used to depict such relationships, thus, making it easier to analyze them.
Linear programming is used in many industries such as energy,
telecommunication, transportation, and manufacturing. This article sheds light on
the various aspects of linear programming such as the definition, formula,
methods to solve problems using this technique, and associated linear
programming examples.
What is Linear Programming?
Linear programming, also abbreviated as LP, is a simple
method that is used to depict complicated real-world
relationships by using a linear function. The elements in
the mathematical model so obtained have a linear
relationship with each other. Linear programming is used
to perform linear optimization so as to achieve the best
outcome
Linear Programming Definition
Linear programming can be defined as a technique that is
used for optimizing a linear function in order to reach the
best outcome. This linear function or objective function
consists of linear equality and inequality constraints. We
obtain the best outcome by minimizing or maximizing
the objective function
Linear Programming
• A technique which help us find the optimum
solution for a given problem.
• An OPTIMUM SOLUTION is that solution
which is the best possible outcome of a
given problem
How to Solve Linear Programming Problems?
The most important part of solving linear programming problem is
to first formulate the problem using the given data. The steps to
solve linear programming problems are given below:
• Step 1: Identify the decision variables.
• Step 2: Formulate the objective function. Check whether the
function needs to be minimized or maximized. (Profit function)
• Step 3: Write down the constraints.
• Step 4: Ensure that the decision variables are greater than or
equal to 0. (Non-negative restraint)
• Step 5: Solve the linear programming problem using either the
simplex or graphical method.
Example:

A company manufactures and sells two types of Products: A and B.


The cost of production of each unit of A and B is ₱200.00 and ₱150.00
respectively. Each unit of A yields a profit of ₱20.00 and each unit of B yields
a profit of ₱15.00 on selling.
Company estimates the monthly demand of A and B to be at maximum of
500 units in all. The production budget for the month is set at ₱50,000.00.
How many units should the company manufacture in order to earn
maximum profit from its monthly sales of A and B?
We have to find the maximum profit the company can earn with the constraints.
The constraints here is the production budget

But how do we approach this problem now?


1st, let’s try to represent this problem in a tabular form
Note that we have to convert this problem to a Linear Programming Problem
We do that by writing the problem in the form of mathematical expressions.

Like in this case, the company wants to sell some numbers of products A and B. As we don’t know the exact quantity, let’s
assume the number of units of product A to be x and the number of units of product B to be y.

Therefore, the total cost to manufacture this many units of A and B would be:
200x + 150y ( let’s just multiply the quantity with the price).
Next, let’s look at the constraints, it says, the production budget is ₱50,000.00, that means, the cost to be incurred
should not exceed ₱50,000.00, it can be less than or equal to ₱50,000.00. We then now write these constraints in the
form of a mathematical expression.
200x + 150y ≤ 50,000
This expression represents the budget constraints of the problem. The total cost should not be more than ₱50,000.

Now let’s express the total demand of the two products in a similar manner.
The combined monthly demand of the two products will not exceed 500 units. Therefore, we use the less than of equal
sign to write this expression:

X + y ≤ 500
This constraints represents the demand constraints of the given problem, This means, if the company produces more
than 500 units of products A and B in all, it might not be able to sell them.
Looking at the profit per unit, the company would like try to maximize the profit which it can yield by selling A and B.
Now let z denote the total profit for the month.
We now write the total profit in mathematical expression, it’s the product of the quantity and the profit per unit. With
this, we will write the objection function of this problem.
The objective function in a linear programming is a mathematical expression of the ultimate goal. So, we have the two
constraints here; a budget constraint and a demand constraints.

The objective function is:


Maximize z= 20x + 15y
Subject to constraints:
200x + 150y ≤ 50,000 (budget)
X + y ≤ 500 (Demand)
Question: Can the number
of units produced by a
company be negative?
The answer is. NO, it can never be negative,
so we need to add the non-negative
constraints, it can be written mathematically
like this
X≥0
Y≥0
It’s very important to write the non-negative constraints in the formulation
of a linear programming problem.
What we did, the entire problem of so many words is reduced to the simple
format using mathematical language, as the problem is formulated in the
linear form, its called as LINEAR PROGRAMMING.
FEASIBLE REGION: It’s the common region determined by all
constraints of a linear programming problem
Each point of feasible region satisfies the linear inequalities of
the problem
Linear programming
Graphical Method

Minimization Model
Linear programming Simplex Method

You might also like