Good

Morning
!!!
Mr. Alexis R. Osorio
 Learning Objectives:
1. Identify the objective function
in linear programming;
2. Find the minimum and
maximum value of z of the
objective function; and
3. Solve linear programming
problems using graphical
method.
Target –
Project
Based
Situation
s
Sales target Within a budget of
Within 15 days
within a month 7000php

OBJECTIVE Maximum sales Minimize the cost

Maximum Score
in a month
Pre – decided
LIMITING FACTOR Time Time
budget

CONSTRAINTS
 Find the optimum
Optimization solution subject to
Problems the constraints of
the problem.

Optimization Techniques

Linear Programming
 Linear
Programm
ing
Mr. Alexis R. Osorio
 What is Linear Programming?

Linear programming (LP) or Linear

Optimization may be defined as the problem of
maximizing or minimizing a linear function that is
subjected to linear constraints. The constraints
may be equalities or inequalities. The
optimization problems involve the calculation of
profit and loss. Linear programming problems are
an important class of optimization problems, that
helps to find the feasible region and optimize the
solution in order to have the highest or lowest
value of the function.
 What is Linear Programming?

In other words, linear programming is

considered as an optimization method to
maximize or minimize the objective function of
the given mathematical model with the set of
some requirements which are represented in the
linear relationship. The main aim of the linear
programming problem is to find the optimal
solution.
 Linear Programming

1. Product mix
2. Diet problem
3. The portfolio selection problem
4. Media selection
5. Blending problem
6. Transportation problem
7. Travelling salesman problem
 Components of Linear
Programming
The basic components of the LP are as
follows:

1. Decision Variables
2. Constraints
3. Data
4. Objective Functions
 Characteristics of Linear
Programming
The following are the six characteristics of
the linear programming problem:

1. Constraints – The limitations should be expressed

in the mathematical form, regarding the resource.
2. Objective Function – In a problem, the objective
function should be specified in a quantitative way.
3. Linearity – The relationship between two or more
variables in the function must be linear. It means
that the degree of the variable is one.
 Characteristics of Linear
Programming
The following are the six characteristics of
the linear programming problem:

4. Finiteness – There should be finite and infinite

input and output numbers. In case, if the function
has infinite factors, the optimal solution is not
feasible.
5. Non-negativity – The variable value should be
positive or zero. It should not be a negative value.
 Characteristics of Linear
Programming
The following are the six characteristics of
the linear programming problem:

6. Decision Variables – The decision variable will

decide the output. It gives the ultimate solution of
the problem. For any problem, the first step is to
identify the decision variables.
 Linear Programming Problems

The linear programming problems (LPP)

helps to find the best optimal solution of a linear
function (also, known as the objective function)
which are placed under certain constraints (set of
linear inequality constraints).
 Graphical Method Simplex Method

Maximize z = 20x + 50y Minimize z = 100a + 1250b + 750c

Subject to constraints Subject to constraints
200x + 150y ≤ 50,000 a ≤ 10
x + y ≤ 500 b ≥ 15
x≥0 a + b + c ≤ 35
y≥0 a≥0
b≥0
c≥0
Example #1
Maximize z = 50x + 18y Objective Function
Subject to constraints z = 50x + 18y
2x + y ≤ 100
x + y ≤ 80
Constraints
x≥0
y≥0
2x + y ≤ 100
x + y ≤ 80

Non-negative Constraints
x≥0
y≥0
 Example #1
Maximize z = 50x + 18y
Subject to constraints

2x +
2x + y ≤ 100

y≤
x + y ≤ 80

100
x≥0
y≥0
x+
Corresponding Coordinates of Coordinates of y≤
Inequalities Equations x-intercept y-intercept 80

2x + y ≤ 100 2x + y = 100 (50,0) (0,100)

x + y ≤ 80 x + y = 80 (80,0) (0,80)
 y
Example #1
100
Feasible Region
Maximize z = 50x + 18y
Corner point method

2x
Subject to constraints

+
A (0,0)

y≤
2x + y ≤ 100 80

100
x + y ≤ 80
x≥0 C B (0,80)
y≥0 C (20,60)
D (50,0)
2x + y = 100

x+
x + y = 80

y≤
80
D
x

A 50 80
 y
Example #1
100
Maximize z = 50x + 18y
Corner point method

2x
Subject to constraints

+
A (0,0)

y≤
2x + y ≤ 100 80

100
x + y ≤ 80
x≥0 C B (0,80)
y≥0 C (20,60)
z = 50x + 18y D (50,0)

x+
A (0,0) 50(0)+18(0)=0

y≤
80
D
B (0,80) 50(0)+18(80)=1440 x

A 50 80

C (20,60) 50(20)+18(60)=2080 The maximum value of z is 2500.

D (50,0) 50(50)+18(0)=2500 Optimal Solution: x = 50 and y = 0

Example #2
Maximize z = 4x+5y Objective Function
Subject to constraints z = 4x + 5y
x + y ≤ 20
3x + 4y ≤ 72
Constraints
x≥0
y≥0
x + y ≤ 20
3x + 4y ≤ 72

Non-negative Constraints
x≥0
y≥0
 Example #2
x+
Maximize z = 4x+5y y≤
Subject to constraints 20
x + y ≤ 20
3x + 4y ≤ 72
x≥0
3x
y≥0 + 4y
≤ 72
Corresponding Coordinates of Coordinates of
Inequalities Equations x-intercept y-intercept

x + y ≤ 20 x + y = 20 (20,0) (0,20)

3x + 4y ≤ 72 3x + 4y = 72 (24,0) (0,18)
 y
Example #2
Feasible Region
Maximize z = 4x+5y
Subject to constraints
Corner point method
x + y ≤ 20 20 A (0,0)

x+
3x + 4y ≤ 72 18

y≤
B (0,18)
B

20
x≥0
y≥0 C C (8,12)
x + y = 20 D (20,0)
3x + 4y = 72 3x
+ 4y
≤ 72

A x
20 D 24
 y
Example #2
Maximize z = 4x+5y
Subject to constraints
Corner point method
x + y ≤ 20 20 A (0,0)

x+
3x + 4y ≤ 72 18

y≤
B (0,18)
B

20
x≥0
y≥0 C C (8,12)
z = 4x+5y D (20,0)
3x
+ 4y
A (0,0) 4(0)+5(0)=0 ≤ 72

B (0,18) 4(0)+5(18)=90 A x
20 D 24

C (8,12) 4(8)+5(12)=92 The maximum value of z is 92.

D (20,0) 4(20)+5(0)=80 Optimal Solution: x = 8 and y = 12

Example #3
Minimize z = 2x+3y Objective Function
Subject to constraints z = 2x+3y
3x + 6y ≥ 24
3x + y ≥ 9
Constraints
x≥0
y≥0
3x + 6y ≥ 24
3x + y ≥ 9

Non-negative Constraints
x≥0
y≥0
 Example #3
Minimize z = 2x+3y

3x +
Subject to constraints

y
3x + 6y ≥ 24

≥9
3x + y ≥ 9
x≥0 3x
+ 6y
y≥0 ≥ 24

Corresponding Coordinates of Coordinates of

Inequalities Equations x-intercept y-intercept

3x + 6y ≥ 24 3x + 6y = 24 (8,0) (0,4)

3x + y ≥ 9 3x + y = 9 (3,0) (0,9)
 y
Example #3
Minimize z = 2x+3y A
9
Subject to constraints

3x +
3x + 6y ≥ 24
3x + y ≥ 9

≥9 y
x≥0
y≥0
4
Corner point method
A (0,9) 3x + 6y = 24 B 3x +
3x + y = 9 6y ≥
B (2,3) 24
x

C (8,0) 3 8 C
 y
Example #3
Minimize z = 2x+3y A
9
Subject to constraints

3x +
3x + 6y ≥ 24
3x + y ≥ 9

≥9 y
x≥0
y≥0
4
z = 2x+3y
Corner Points Value of z B 3x +
6y ≥
24
A (0,9) 2(0)+3(9)=27 x
3 8 C
B (2,3) 2(2)+3(3)=13 The minimum value of z is 13.

C (8,0) 2(8)+3(0)=16 Optimal Solution: x = 2 and y = 3

 Example #4
A furniture company makes book shelves and desks. Each shelf
requires 2 hours for carpentry work and 1 hour for painting. Each desk requires 3
hours for carpentry and 4 hours for painting. The company has a maximum of 60
hours for carpentry and 40 hours of painting available each week, and they make a
profit of $15 per shelf and $40 per desk. How many shelves and desks should they
make to maximize the profit?

Book
Desks (y)
shelves (x)
Carpentry 2 hours 3 hours Constraint: 2x+3y ≤ 60

Painting 1 hour 4 hours Constraint: x+4y ≤ 40

Profit $15 $40 Objective Function: z = 15x+40y

 Example #4
Objective Function: z = 15x+40y
Constraint: 2x+3y ≤ 60
Constraint: x+4y ≤ 40 2x
x≥0 + 3y
≤
y≥0 60
Corresponding Coordinates of Coordinates of
Inequalities Equations x-intercept y-intercept
x+4y
2x+3y ≤ 60 2x+3y = 60 (30,0) (0,20) ≤ 40

x+4y ≤ 40 x+4y = 40 (40,0) (0,10)

 y
Example #4
2x+3y = 60
Objective Function: z = 15x+40y
Constraint: 2x+3y ≤ 60 x+4y = 40
Constraint: x+4y ≤ 40
x≥0
y≥0
2x+
20 3y
A (0,0) ≤ 60
15(0)+40(0)=0 B
10
B (0,10) 15(0)+40(10)=400 C x+4y
≤ 40
x
C (24,4) 15(24)+40(4)=520 A 30
D 40

D (30,0) 15(30)+40(0)=450
 Example #4
A furniture company makes book shelves and desks. Each shelf
requires 2 hours for carpentry work and 1 hour for painting. Each desk requires 3
hours for carpentry and 4 hours for painting. The company has a maximum of 60
hours for carpentry and 40 hours of painting available each week, and they make a
profit of $15 per shelf and $40 per desk. How many shelves and desks should they
make to maximize the profit?

A (0,0) 15(0)+40(0)=0

B (0,10) 15(0)+40(10)=400 The company should make 24 book shelves

and 4 desks to maximize the profit.
C (24,4) 15(24)+40(4)=520

D (30,0) 15(30)+40(0)=450
 Example #5
A self-employed carpenter earns $90 for the sale of a table and $180 for
the sale of a rocking chair. It takes 2 hours for him to make a table and 5 hours to
manufacture a rocking chair. He is limited to working 40 hours per week. The
average manufacturing cost is $15 per table and $45 per rocking chair. He wishes
to keep his manufacturing costs at $315 per week. How many tables and rocking
chairs should he make to maximize his weekly sales? Determine the maximum
sales and profit he can make per week?

Rocking
Table (T)
chair (R)
Sales $90 $180 Objective Function: S = 90T+180R

Time 2 hours 5 hours Constraint: 2T + 5R ≤ 40

Costs $15 $45 Constraint: 15T + 45R ≤ 315

Example #5
Objective Function: S = 90T+180R
Constraint: 2T + 5R ≤ 40
Constraint: 15T + 45R ≤ 315
 Example #5
Objective Function: S = 90T+180R
Constraint: 2T + 5R ≤ 40
Constraint: 15T + 45R ≤ 315
x≥0
y≥0
Corresponding Coordinates of Coordinates of
Inequalities Equations x-intercept y-intercept 2T +
5R ≤
40
2T + 5R ≤ 40 2T + 5R = 40 (20,0) (0,8)
15T
+ 45
15T + 45R ≤ 315 15T + 45R = 315 (21,0) (0,7) R≤
315
 y
Example #5
2T + 5R = 40
Objective Function: S = 90T+180R 15T + 45R = 315
Constraint: 2T + 5R ≤ 40
Constraint: 15T + 45R ≤ 315
x≥0
y≥0
8 2T
+ 5R
7 ≤ 40
A (0,0) 90(0)+180(0)=0 B C 15
T+
45R
B (0,7) 90(0)+180(7)=1260 ≤ 315
x
C (15,2) 90(15)+180(2)=1710 A 20 D21
D (20,0) 90(20)+180(0)=1800
 Example #5
A self-employed carpenter earns $90 for the sale of a table and $180 for the sale of a
rocking chair. It takes 2 hours for him to make a table and 5 hours to manufacture a rocking chair. He
is limited to working 40 hours per week. The average manufacturing cost is $15 per table and $45
per rocking chair. He wishes to keep his manufacturing costs at $315 per week. How many tables
and rocking chairs should he make to maximize his weekly sales? Determine the maximum sales
and profit he can make per week?

A (0,0) 90(0)+180(0)=0 The carpenter needs 20 tables to maximize

his weekly sales.
B (0,7) 90(0)+180(7)=1260
The maximum sales per week is $1800.
C (15,2) 90(15)+180(2)=1710
The maximum profit per week is
D (20,0) 90(20)+180(0)=1800 $1800 - $315 = $1485.
 References:
https://byjus.com/maths/linear-programming/#:~:text=In%20Mathematics
%2C%20linear%20programming%20is,in%20the%20form%20of
%20inequalities

https://www.youtube.com/watch?v=Uo6aRV-mbeg

https://www.youtube.com/watch?v=uJFiR0DG2Bw

https://www.youtube.com/watch?v=qQFAvPF2OSI

https://www.youtube.com/watch?v=Y7e7DCsDUMY

https://www.youtube.com/watch?v=w9BlUqa2JpI&t=51s