A MODULAR APPROACH

Prepared by
Mrs. Marivic R. Rosini

1
Learning Outcomes
• Discuss basic concepts of Linear programming.
• Determine the applications of Linear
programming
• Identify some applications of Linear
programming
• Use Graphical method in Linear programming
modeling
• Solve problems using graphical method in
linear programming
2
The adjective
Before we linearexamples,
present means that all
let
AreIt is
you
Hi there!
Thus, actually
thinking
May
linear not.
that
programming Rather,
linear
I ask what comes
involves
mathematical
usTry guessing
first
programming defineis
functions
the
some
one
words
of
in
terms
the
bythis
re-
that
computer
theprogramming
intoplanning
your headof is
whenessentially
activitiesyoulinear
toheara
obtain
model
will are
arranging required
the to be
jumbled-letters.
help Programming?”
languages? us better understand
an synonym
“Linear
optimal to planning.
result.
functions.
linear programming.

3
This word is used in the context of either maximizing
or minimizing an objective function (like minimizing
cost of production and maximizing profit)

4
Refers to the resources that are available in limited
quantities

5
This region is the collection of points that satisfy
all of the inequalities.

6
A function such as profit or cost that indicates
how much each variable contributes to the
value to be optimized

7
Solution that lies at the corner of feasible region

8
I hope you get acquainted with
Let us now move on with our
these terms and enjoyed that
examples on linear programming
simple jumbled-letter game too.

9
What is Linear Programming (LP)?

• A model consisting of linear

relationships representing a
firm’s objective and resource
constraints

10
What is Linear Programming (LP)?

• LP is a mathematical modeling
technique used to determine a
level of operational activity in
order to achieve an objective,
subject to restrictions called
constraints
11
LINEAR PROGRAMMING

THE GRAPHICAL
METHOD:
Maximization and Minimization

12
Sample Problem # 1

A calculator company in the US 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 must 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?

13
DECISION VARIABLES
The question asks for the optimal number of calculators, so
my variables will stand for that:
Let x: number of scientific calculators produced
y: number of graphing calculators produced

Since they can't produce negative numbers of calculators, we have

two constraints,
x > 0 and y > 0

But in this case, we can ignore these constraints, because stated in

the problem was “the expected demand of at least 100 scientific
and 80 graphing calculators each day” or
x > 100 and y > 80 14
The exercise also gives maximums: from the statement “no more
than 200 scientific and 170 graphing calculators can be made
daily” so, we have
x < 200 and y < 170

It is also mentioned that “a shipping contract for a total of at

least 200 calculators must be shipped each day” this gives us
another constraint which is
x + y > 200
And finally, “the scientific calculator sold results in a $2 loss,
but each graphing calculator produces a $5 profit” will tell us
that we need to maximize profit using the equation (or the
objective function)
P = –2x + 5y where P is the profit.
15
 Generally the problem simply wants us to find the maximum
value of P = –2x + 5y, subject to the following constraints:

x > 100 and x < 200

y > 80 and y < 170
x + y > 200

100 < x < 200

OR 80 < y < 170
x + y > 200

Graphing the system we

obtained the feasibility region
(shaded area)

16
17
 Solving for the corner points, we get
(100, 170) (200, 80)
(100, 100) (200, 170)
(120, 80)

Substituting the corner points

to P = –2x + 5y

We obtain the maximum value

P = 650 at (x, y) = (100, 170)

Therefore, the solution is

"100 scientific calculators and
170 graphing calculators".
18
Let us try another problem. But
this time, we solve for the
minimum value.

19
 References
Published and Unpublished Sources
• Hillier, F.S., Lieberman, G.J. (2001). Introduction to Operations Research 7th Ed., McGraw
Hill Companies Inc., 24-108.
• Gustafson, R.D, Frisk, P.D. (1994). College Algebra 5th Edition. Brooks/Cole Publishing
Company, CA, 403-412
• Viswanathan, P.K.; Linear Programming Module–A conceptual Framework, Unpublished.
pp.1-35.

Web Sources
• Stapel, Elizabeth. "Linear Programming: Introduction." Purplemath. Available from
http://www.purplemath.com/modules/linprog.htm. Accessed November 2013.
• Linear Programming at Explore Learning. Retrieved from
http://cs.explorelearning.com/materials/LinearProgTG.pdf. Accessed November 2013.
• Waner, S. (2006). Finite Mathematics / Finite Mathematics & Applied Calculus Topic:
Linear Programming. Retrieved from
http://people.hofstra.edu/Stefan_Waner/Realworld/Summary4.html. Accessed
November 2013.
• Linear Programming. Accessed from
http://www.vitutor.com/alg/linear_programming/problems_solutions.html 20