Scribd
Upload
4 views19 pages

Linear Programming

Linear Programming (LP) is a method for finding optimal solutions under constraints, aiming to maximize profit or minimize costs. It includes graphical techniques like the isoprofit line and corner point methods to identify optimal solutions based on decision variables. Special cases in LP include alternate optimal solutions, infeasible problems, unboundedness, and redundancy, which can indicate errors in problem formulation.

Uploaded by

tusiapriljonamae
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
4 views19 pages

Linear Programming

Linear Programming (LP) is a method for finding optimal solutions under constraints, aiming to maximize profit or minimize costs. It includes graphical techniques like the isoprofit line and corner point methods to identify optimal solutions based on decision variables. Special cases in LP include alternate optimal solutions, infeasible problems, unboundedness, and redundancy, which can indicate errors in problem formulation.

Uploaded by

tusiapriljonamae
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/ 19

INTRODUCTION TO LINEAR

PROGRAMMING (LP)
WHAT IS LINEAR
PROGRAMMING

LP is a problem-solving The term


approach developed for PROGRAMMING
situations where we
require to determine an refers not to the need
optimum solution and for computer
where we face certain programming but to
limitations or constraints the fact that technique
on what we are able to do. comprises a set of
We may seek to: logical steps to
• maximize profit determine the optimal
• minimize costs solution to an LP
ISOPROFIT LP GRAPHICAL
METHOD
 The "isoprofit line solution method" is a graphical
technique used in linear programming to find the optimal
solution by plotting lines representing different levels of
profit (isoprofit lines) within the feasible region, where the
point on the line that intersects the feasible region at the
highest profit level is the optimal solution; it's primarily
used for problems with only two decision variables due to
its visual nature.
CORNER POINT LP GRAPHICAL
METHOD
 The "corner point solution method" is a graphical
technique used in linear programming to find the optimal
solution to a problem by evaluating the objective function
at each "corner point" (or extreme point) of the feasible
region, with the assumption that the optimal solution will
always lie at one of these corners; essentially, it involves
plotting the constraints, identifying the feasible region,
and then testing the objective function at each corner
point to find the maximum or minimum value depending
on the problem objective. .
1. Alternate
Optimal
Solution
FOUR
SPECIAL
When there are CASES IN
multiple points on the
feasible region that
LINEAR
provide the same PROGRAMM
optimal value for the ING
objective function,
meaning there are
several equally "best"
solutions.
An Infeasible
Problem

maximize Z = 5x1 + 3x2


subject to:

The three constraints do not overlap to form a


feasible solution area. Because no point
satisfies all three constraints simultaneously,
there is no solution to the problem. Infeasible
problems do not typically occur, but when they
do, they are usually a result of errors in defining
the problem or in formulating the linear
programming model.

20XX
3.
Unboundedness
When the objective
function can be increased
(in maximization FOUR SPECIAL
problems) or decreased (in
minimization problems) CASES IN
indefinitely without
violating any constraints,
LINEAR
often indicated by a line in PROGRAMMIN
the feasible region that
extends infinitely in one
G
direction.

4. Redundancy
When one constraint in a
linear programming
An Unbounded Problem

the objective function is shown to


increase without bound; thus, a
solution is never reached.

Unlimited profits are not possible


in the real world; an unbounded
solution, like an infeasible
solution, typically reflects an error
in defining the problem or in
formulating the model.
THANK YOU.
20XX
A COMPANY PRODUCES 2 BIKES, A MOUNTAIN
BIKE AND A ROAD BIKE. IT TAKES 3 HOURS TO
ASSEMBLE A MOUNTAIN BIKE AND 4 HOURS TO
ASSEMBLE A ROAD BIKE. THE TOTAL TIME
AVAILABLE TO ASSEMBLE IS 60 HOURS. THE
COMPANY WANTS TO HAVE TWICE AS MANY
MOUNTAIN BIKES AS THE ROAD BIKES.
COMPANY MAKES A PROFIT OF $200 PER
MOUNTAIN BIKE AND $100 PER ROAD BIKE.
20XX

You might also like