Scribd
Upload
22 views

Chapter IV Linear Programming

Uploaded by

tbosorio
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
22 views

Chapter IV Linear Programming

Uploaded by

tbosorio
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 50

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
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.
Linear programming
Graphical Method

Minimization Model
2nd Constraints
Linear programming Simplex Method
For linear programming problems involving two variables,
the graphical solution method introduced in Section 9.2 is
convenient. However, for problems involving more than two
variables or problems involving a large number of
constraints, it is better to use solution methods that are
adaptable to computers. One such method is called the
simplex method, developed by George Dantzig in 1946. It
provides us with a systematic way of examining the vertices
of the feasible region to determine the optimal value of the
objective function.
Simplex Method

Solve the following LPP using the simplex method

Maximize Z = 12x + 16y


Subject to:
 10x + 20y ≤ 120
 8x +8y ≤ 80
X+y≥0
Next
o Old Value=0-8 x 1 /20
o 0-8/20
o New Value= -2/5

Next
o 1-8 x 0 / 20
o 1-0/20
o New Value=1

Next
o 80-8 x 120 /20
o 80-960/20
o 80-48
o New Value= 32

You might also like