Scribd
Upload
21 views12 pages

Linear Programming Graphical Method

Linear programming is a technique for optimizing a linear objective function subject to linear equality and inequality constraints. It can be used to plan activities by considering resources and limitations. There are two main approaches to solving linear programming problems - the graphical method and the simplex method. The graphical method uses graphs to arrive at an optimal solution and is useful for problems with 2-3 variables. It involves representing the problem, formulating the objective function and constraints, graphing the constraints, and selecting the optimal value from the feasible region.

Uploaded by

Janesene Sol
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
Download as pptx, pdf, or txt
21 views12 pages

Linear Programming Graphical Method

Linear programming is a technique for optimizing a linear objective function subject to linear equality and inequality constraints. It can be used to plan activities by considering resources and limitations. There are two main approaches to solving linear programming problems - the graphical method and the simplex method. The graphical method uses graphs to arrive at an optimal solution and is useful for problems with 2-3 variables. It involves representing the problem, formulating the objective function and constraints, graphing the constraints, and selecting the optimal value from the feasible region.

Uploaded by

Janesene Sol
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1/ 12

LINEAR

PROGRAMMIN
G
Laureta, Ricart Von
Sol, Janesene
Introduction
LINEAR
– it implies direct proportionality of
relationship of variables
Linear – it implies direct proportionality of relationship of variables

PROGRAMMING
Programming – making schedules or plans of activities to undertake in
the–future
making schedules or plans of activities to
undertake
Linear Programming in– the future
planning by the use of linear relationship of
variables involved

LINEAR PROGRAMMING
– planning by the use of linear relationship of
variables involved
A minimization or maximization
problem can be classified as linear
programming if it has the following
properties:
1. The objective of 2. The actions of the 3. All variable 4. The relationship of
the decision-maker decision-maker must be have a value variables could be
must be either to constrained and the expressed in terms
greater than or
maximize or to decision variables must of equations or
minimize. not violate the equal to 0. inequalities.
limitations or
constraints.
2 ways of solving a linear
programming problem:

GRAPHICAL
SIMPLEX
METHOD
METHOD
used when the problem has 2 or 3
variables, since there are only 2 can handle a problem having
coordinate axes in a plane and 3 any number of variables
coordinates in space
GRAPHICAL METHOD
-makes use of graphs to arrive at the optimum solution

Optimum Solution – a solution that makes the objective function as large as


possible in the case of maximization process, and as small as possible in the case
of minimization process.

Feasible Solution – set of all points in the graph satisfying the constraints;
located in the feasible region
2 MAIN PARTS OF A
LINEAR PROGRAM

OBJECTIVE CONSTRAINTS OR
FUNCTION LIMITATIONS
an algebraic expression introduced by – introduced by “subject to”
the word “maximize” or “minimize”.
TWO PARTS:
1. Explicit – conditions to be
expressed in mathematical sentence
2. Implicit – already implied
Steps in using
the graphical
method
1.Represent the unknown in the problem.
2.Tabulate the data about the unknown (if necessary).
3.Formulate the objective function and constraints.
4.Graph the constraints, and always solve for the coordinates
at the point of intersection of lines.
5.Substitute the coordinates at the vertices of the feasible
region in the objective function.
6.Formulate your decision by selecting the highest value of
the objective if it is maximization and the lowest value if it is
minimization.
Sample problem:
The Margan Furniture makes two products: tables & chairs, which must
be processed through assembly and finishing departments. Assembly
department is available for 60 hrs in every production period, while the
finishing department is available for 48 hrs of work. Manufacturing 1
table requires 4 hrs in the assembly and 2 hrs in the finishing. Each
chair requires 2 hrs in the assembly and 4 hrs in the finishing. 1 table
contributes 180 to profit, while a chair contributes 100.

The problem is to determine the number of tables and chairs to


make per production period in order to maximize the profit.
Sample problem:
A small generator burns two types of fuel: low sulfur and high
sulfur to produce electricity. For one hour, each gallon of low
sulfur emits 3 units of sulfur dioxide, generates 4 kilowatts
electricity and costs 160. Each gallon of high sulfur emits 5 units
of sulfur dioxide, generates 4 kilowatts and costs 150. The
environmental protection agency insists that the maximum
amount of sulfur dioxide that can be emitted per hour is 15 units.
Suppose that at least 16 kilowatts must be generated per hour,
how many gallons of high sulfur and low sulfur must be utilized
per hour in order to minimize the cost of fuel?
THANK
YOU

You might also like