Scribd
Upload
46 views

Linear Programming

Linear programming is used to obtain the optimal solution to problems with constraints. It formulates a real-life problem into a mathematical model with an objective function to maximize or minimize and constraints restricting activities. An example problem maximizes profit from producing two candy flavors with constraints on production capacity and minimum shipping requirements. The linear programming model is set up with variables for each candy, constraints, and an objective function to maximize profit. Testing the feasible region identifies the optimal solution of 100 scientific and 170 graphing calculators.

Uploaded by

FRANCEEN LEANNA KATIGBAK
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
46 views

Linear Programming

Linear programming is used to obtain the optimal solution to problems with constraints. It formulates a real-life problem into a mathematical model with an objective function to maximize or minimize and constraints restricting activities. An example problem maximizes profit from producing two candy flavors with constraints on production capacity and minimum shipping requirements. The linear programming model is set up with variables for each candy, constraints, and an objective function to maximize profit. Testing the feasible region identifies the optimal solution of 100 scientific and 170 graphing calculators.

Uploaded by

FRANCEEN LEANNA KATIGBAK
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 12

LINEAR PROGRAMMING

OBJECTIVE:
At the end of the lesson, the student
is expected to:
1. define linear Programming and
explain its use
2. set up simple decision problems
as Linear Programming problems
and solve
Linear programming is used for obtaining the most
optimal solution for a problem with given constraints.
In linear programming, we formulate our real-life
problem into a mathematical model. 

KEYWORDS:
Linear Programming, Maximization,
Minimization, constraints, decision, variables
Properties of a Linear Programming:
1. The objective function is to be optimized by either
maximization or minimization
2. There are constraints restricting the activities that
are required to carry out thee objective.
3. All equations are linear.
4. The activities ( or decision variables) are generally
non-negative
Example:
1. Suppose that a manufacturer of candies want to maximize
his profit by producing two flavors: chocolate and caramel. The
manufacturer knows that the net profit of producing chocolate
candies Is P 0.25 per piece, while caramel candies is P0.30 per
piece. The manufacturer’s objective is to maximize profit from the
production of the two flavors which can be presented by:
Z (maximize) = 0.25x+0.30y
The variable x & y are called activities (decision variables
in the linear programming.
If there were no constraints then the manufacturer would produce
more caramel candies because of higher profit.
Example for Linear Programming:
A calculator company produces a scientific calculator and a
graphing calculator. Long-term projections indicate an expected
demand of at least 100 scientific and 80 graphing calculators each
day. Because of limitations on production capacity, no more
than 200 scientific and 170 graphing calculators can be made daily.
To satisfy a shipping contract, a total of at least 200 calculators much
be shipped each day.
If each scientific calculator sold results in a $2 loss, but each
graphing calculator produces a $5 profit, how many of each type
should be made daily to maximize net profits?
The question asks for the optimal number of

calculators, so my variables will stand for that:

x: number of scientific calculators produced

y: number of graphing calculators produced


Since they can't produce negative numbers of calculators,
I have the two constraints, x > 0 and y > 0.
But in this case, I can ignore these constraints, because
I already have that x > 100 and y > 80.
The exercise also gives maximums: 
x < 200 and y < 170.
The minimum shipping requirement gives me
x + y > 200; in other words, y > –x + 200.
The profit relation will be my optimization equation:
 P = –2x + 5y. So the entire system is:
P = –2x + 5y, subject to:
100 < x < 200 
80 <  y < 170 
y > –x + 200 
The feasibility region graphs as:  
When you test the corner points at :
(100, 170), (200, 170), (200, 80),
(120, 80), and (100, 100),
you should obtain the maximum value of
 P = 650 at (x, y) = (100, 170).
That is, the solution is "100 scientific calculators
and 170 graphing calculators".

You might also like