Module 8 Part 2

LINEAR PROGRAMMING
Module 9
OBJECTIVES
With the help of this power point presentation, you should be able to
1. Write linear programming models, and
2. Solve using the graphical method

LINEAR PROGRAMMING
• The “programming” part of the name actually comes from World War II – era military
terminology, in which training, supply, and unit deployment plans were called programs.
• Linear programming was developed by George B. Dantzig in the 1940’s and was first used by
the U.S. Air Force as an aid in decision making.
• Linear programming, one of the oldest and still one of the most important tools of operations
research, is used when a problem can be described using equations and inequalities that are all
linear.
LINEAR PROGRAMMING
• A method for solving problems in which a particular quantity that must
be maximized or minimized is limited by other factors.
• Is one of the most widely used tools in management science.
• Accounts for more than 50% and perhaps as much as 90% of all
computing time used for management decisions.
LINEAR PROGRAMMING PROBLEM
• When the function to be maximized or minimized is linear.
• The corresponding constraints are linear inequalities or linear equations and that all
variables be nonnegative.
• Objective function: is an algebraic expression in two or more variables describing a
quantity that must be maximized or minimized.
• Although there are usually infinitely many solutions to the system of constraints,
which are called feasible solutions or feasible points, the aim is to find one such
solution that is an optimum solution – one that maximizes or minimizes the value of
the objective function.
• Constraints restrictions, expressed as linear inequalities.
EXAMPLE:
•
The number of 10 times the number of 6 times the number of medical

is plus
people helped bottles of water kits
EXAMPLE:
Bottled water and medical supplies are to be shipped to survivors of an earthquake by plane. Each container of bottled water will
serve 10 people and each medical kit will aid 6 people. Each plane can carry no more than 80000 pounds. The bottled water
weighs 20 pounds per container and each medical kit weighs 10 pounds. Each plane can carry a total volume of supplies that does
not exceed 60000 cubic feet. Each water bottle is 1 cubic foot and each medical kit is also has a volume of 1 cubic foot.
•
EXAMPLE:
•
EXAMPLE:
To graph the constraints in one Cartesian plane Follow

steps in graphing system of linear equations.
Constraint Equation of the

boundary line
Means
Means feasible
feasible region
region is
is found
found
in
in the
the first
first quadrant
quadrant
EXAMPLE:
To graph the constraints in one Cartesian plane Follow

steps in graphing system of linear equations.
Constraint Equation of the

boundary line
Means
Means feasible
feasible region
region is
is found
found
in
in the
the first
first quadrant
quadrant
EXAMPLE:
EXAMPLE:
EXAMPLE:
Solution
set/feasible
region
EXAMPLE:
Determine the corner
points
Corner points
EXAMPLE:
Determine the corner
points
EXAMPLE:
• Find the value of the objective function at each corner of the graphed region.
The maximum and minimum of the objective function occur at one or more of
the corner points.
maximum
•
SOLVING A LINEAR
•
PROGRAMING PROBLEM
PRACTICE EXERCISE
1. During this you to do baking. You want to produce whole wheat bread and cheese
bread to share to our frontliners. The whole wheat bread is denser and requires
more baking time, whereas the cheese bread requires more labor. The baking times
and average amount of labor per loaf are given in the table along with the supposed
profit for each bread. Planning to do business under the new normal.
Time to bake Labor Profit
Wheat Bread 1.5 hour Php 36
Cheese Bread 1 hour Php 30

PRACTICE EXERCISE CONTINUED…
Time to bake Labor Profit
Wheat Bread 1.5 hour Php 36
Cheese Bread 1 hour Php 30
The oven space restricts you from baking more than 120 loaves. Furthermore, the
amount of oven time for baking is no more than 165 hour and the amount of available
labor is at most 55 hr. Determine the number of loaves of each type of bread that you
should bake to maximize your profit. Assume that all loaves of bread produced are
sold.
REFERENCES
Blitzer, R. (2010). College Algebra. Pretice Hall. Upper Saddle River, New Jersey.
Miller, J. (2014). College algebra. McGraw – Hill Education LLC. USA
CHAPTER 11: BASIC LINEAR PROGRAMMING CONCEPTS

https://faculty.washington.edu/toths/Presentations/Lecture%202/Ch11_LPIntro.pdf

Module 8 Part 2

Uploaded by

Copyright:

Available Formats

Module 8 Part 2

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Module 8 Part 2

Uploaded by

Copyright:

Available Formats

LINEAR PROGRAMMING

2. Solve using the graphical method

• Is one of the most widely used tools in management science.

The number of 10 times the number of 6 times the number of medical

To graph the constraints in one Cartesian plane Follow

Constraint Equation of the

To graph the constraints in one Cartesian plane Follow

Constraint Equation of the

Time to bake Labor Profit

Wheat Bread 1.5 hour Php 36

Cheese Bread 1 hour Php 30

Time to bake Labor Profit

Wheat Bread 1.5 hour Php 36

Cheese Bread 1 hour Php 30

Miller, J. (2014). College algebra. McGraw – Hill Education LLC. USA

CHAPTER 11: BASIC LINEAR PROGRAMMING CONCEPTS

You might also like