Scribd
Upload
580 views

Linear Programming

Linear programming was invented in the 1940s by George Dantzig to help efficiently distribute military resources like men, weapons, and supplies across different fronts in World War 2. It involves modeling a problem with constraints as linear inequalities and an objective function to maximize or minimize. The optimal solution will occur at a corner point of the feasible region defined by the constraints. Two examples are given of craftspeople maximizing their weekly profit from making different products with constraints on their time and material costs.

Uploaded by

AlliahData
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
580 views

Linear Programming

Linear programming was invented in the 1940s by George Dantzig to help efficiently distribute military resources like men, weapons, and supplies across different fronts in World War 2. It involves modeling a problem with constraints as linear inequalities and an objective function to maximize or minimize. The optimal solution will occur at a corner point of the feasible region defined by the constraints. Two examples are given of craftspeople maximizing their weekly profit from making different products with constraints on their time and material costs.

Uploaded by

AlliahData
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 37

Linear Programming

MATHEMATICS IN THE MODERN WORLD


PREPARED BY: NICKO L. TUMALA
Linear Programming

invented in the 1940s by George Dantzig

a result of a military research project on planning


how to distribute men, weapons, and supplies
efficiently to the various fronts during World War II.
Definition of Terms
Linear Equation
Linear Equation

 A linear equation in two variables x and y is an


equation that can be written in the form
ax + by = c, where a, b, and c are constants. Such an
equation is referred to as a linear equation because
its graph is a line.
Linear Inequality
Linear Inequality

 A linear inequality in two variables x and y is an


inequality that can be written in the form ax + by > c
(or with <, ≤ , or ≥ instead of = ). In other words, a
linear inequality is the result of replacing a linear
equation’s equals symbol with an inequality symbol.
Optimization
Optimization

 Maximizing or minimizing a quantity


Objective Function
Objective Function

 The objective function is a function that


mathematically describes the profit.
Constraints
Constraints

 The restrictions of the given problem.


Corner Principle
Corner Principle

 The maximum and minimum values of an objective


function occur at corner points of the region of
possible solutions if that region is bounded.
Graphing of Linear
Equation
Using your graphing calculator, graph
the following equations.
1. x + y = 3
2. 2x + 3y = 12
3. x – 10y = 20
Graphing of Linear
Inequality
Using your graphing calculator, graph
the following equations.
1. x + y > 3
2. 2x + 3y ≤ 12
3. x – 10y ≥ 20
The Geometry of Linear
Programming
Example #1.
A craftsman produces two products: coffee tables and end tables.
Production of one coffee table requires six hours of his labor, and the
materials cost him Php200. Production of one end table requires five
hours of labor, and the materials cost him Php100. The craftsman
wants to work no more than 40 hours each week, and his financial
resources allow him to pay no more than Php1,000 for materials
each week. If he can sell as many tables as he can make and if his
profit is Php240 per coffee table and Php160 per end table, how
many coffee tables and how many end tables should he make each
week to maximize weekly profit?
Variables needed
• The number of coffee tables made each week
• The number of end tables made each week
• The number of hours the craftsman works each week
• The amount of money he spends on materials each week
• The weekly profit
Constraints
• The craftsman’s weekly hours ≤ 40
• The craftsman’s weekly expenses ≤ Php1,000
Labor Cost of Profit
Materials

Coffee Tables 6 hours Php 200 Php 240

End Tables 5 hours Php 100 Php 160


Step 1: List the independent variables.

x - number of coffee tables made each week


y - number of end tables made each week
Step 2: List the constraints and translate
them into linear inequality

The craftsman’s weekly hours ≤ 40


The craftsman’s weekly expenses ≤ Php1,000
Step 3: Find the objective and translate it
into linear equation
Step 4: Graph the possible region.
Step 5: Find all corner points and the z-
value associated with these points.
Example #2
A craftswoman produces two products: floor lamps and table lamps.
Production of one floor lamp requires 75 minutes of her labor and
materials that cost Php25. Production of one table lamp requires 50
minutes of labor, and the materials cost Php20. The craftswoman
wishes to work no more than 40 hours each week, and her financial
resources allow her to pay no more than Php900 for materials each
week. If she can sell as many lamps as she can make and if her profit
is Php39 per floor lamp and Php33 per table lamp, how many floor
lamps and how many table lamps should she make each week to
maximize her weekly profit? What is that maximum profit?
Labor Cost of Profit
Materials

Floor lamps 75 minutes Php 25 Php 39

Table lamps 50 minutes Php 20 Php 33


Step 1: List the independent variables.

x - number of floor lamps made each week


y - number of table lamps made each week
Step 2: List the constraints and translate
them into linear inequality

The craftswoman’s weekly hours ≤ 40


The craftswoman’s weekly expenses ≤ Php900
Step 3: Find the objective and translate it
into linear equation
Step 4: Graph the possible region.
Step 5: Find all corner points and the z-
value associated with these points.

You might also like