Scribd
Upload
5 views

Linear Programming

Uploaded by

Jericho Somera
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
5 views

Linear Programming

Uploaded by

Jericho Somera
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 46

Linear

Programming
Linear
Inequalities
𝑎𝑥 + 𝑏𝑦 = 𝑐 𝑦 = 𝑚𝑥 + 𝑏

𝑎 𝑏 𝑐 𝑚
𝑏
𝑎𝑥 + 𝑏𝑦 < 𝑐

𝑎𝑥 + 𝑏𝑦 > 𝑐
≤, ≥)
𝑎𝑥 + 𝑏𝑦 ≤ 𝑐

𝑎𝑥 + 𝑏𝑦 ≥ 𝑐
How to graph
Linear
inequality
Example 1. Solve the linear
inequality for y
2𝑥 − 4𝑥 ≥ 10

−2𝑥 ≥ 10

−2𝑥 10
≥
−2 −2
𝑥 ≤ −5
2. Graph the line. The line is described by the equation
associated with the inequality

𝑚
𝑦 = 𝑚𝑥 + 𝑏 𝑏

𝑥=𝑎 (𝑎, 0)
2. Graph the line. The line is described by the equation
associated with the inequality

≤ 𝑜𝑟 ≥

< 𝑜𝑟 >
3. Shade in one side of the line.
Sample
problems
𝑥 − 2𝑦 ≥ −5

4𝑥 + 𝑦 ≤ 7
𝑓 𝑥, 𝑦 = 𝑥 + 𝑦
2𝑥 + 5𝑦 ≥ −1
𝑥 − 2𝑦 ≥ −5
Solve for y-intercept (0,2.5)
Solve for x-intercept (−5,0) 𝑥=0
𝑦=0 0−2𝑦 = −5
𝑥 − 2 0 = −5 −2𝑦 = −5
𝑥 = −5 −2𝑦 −5
=
−2 −2
5
𝑦 = or 𝑦 = 2.5
2
𝑥 − 2𝑦 ≥ −5
Test point (0,0)

0−2 0 ≥ −5
0 ≥ −5
true
𝑥 − 2𝑦 ≥ −5
Test point (0,0)

0−2 0 ≥ −5
0 ≥ −5
true
4𝑥 + 𝑦 ≤ 7 Solve for y-intercept (0,7)
Solve for x-intercept (1.75,0) 𝑥=0
𝑦=0
4(0)+𝑦 = 7
4𝑥 + 0 = 7
𝑦=7
4𝑥 = 7
4𝑥 7
=
4 4
7
x= or x = 1.75
4
4𝑥 + 𝑦 ≤ 7
Test point (0,0)

4(0) + 0 ≤ 7
0≤7
true
4𝑥 + 𝑦 ≤ 7
Test point (0,0)

4(0) + 0 ≤ 7
0≤7
true
2𝑥 + 5𝑦 ≥ −1 1
Solve for y-intercept 0, −
1 5
Solve for x-intercept − ,0 𝑥=0
2
𝑦=0
2(0)+5𝑦 = −1
2𝑥 + 5 0 = −1
5𝑦 = −1
2𝑥 = −1
5𝑦 1
2𝑥 1 =−
=− 5 5
2 2
1 1
𝑥=− 𝑦=−
2 5
2𝑥 + 5𝑦 ≥ −1
Test point (0,0)

2(0) + 5(0) ≥ −1
0 ≥ −1
true
2𝑥 + 5𝑦 ≥ −1
Test point (0,0)

2(0) + 5(0) ≥ −1
0 ≥ −1
true
2𝑥 + 5𝑦 ≥ −1
Test point (0,0)
A
2(0) + 5(0) ≥ −1
C
0 ≥ −1
true B

FEASIBLE
SOLUTION
A

B
C
4𝑥 + 𝑦 = 7 4𝑥 + 𝑦 = 7
−2(2𝑥 + 5𝑦 = −1) 4𝑥 − 1 = 7
Resulting equation: 4𝑥 = 7 + 1
4𝑥 + 𝑦 = 7 4𝑥 = 8
−4𝑥 − 10𝑦 = 2 𝑥=2
−9𝑦 = 9 Points of intersection: (2 , -1)
𝑦 = −1
𝑓 𝑥, 𝑦 = 𝑥 + 𝑦 Value

Points A: (1 , 3) 1+3 4
Points B: (-3 , 1) −3 + 1 −2
Points C: (2 , -1) 2 + (−1) 1

Maximum Value= 4 at point (1, 3)


Minimum Value= -2 at point (-3, 1)
Solve! 𝑧 = 3𝑥 + 2𝑦

𝑥 + 2𝑦 ≤ 4
𝑥−𝑦 ≤1
𝑥≥0
𝑦≥0
Geometry Linear
of Inequalities
3 components of linear programming
Variables

objective

constraints
The Corner Principle states that:
Steps to follow in using graphical method
10𝑥 + 15𝑦
3𝑥 + 6𝑦 ≤ 60
3𝑥 + 6𝑦 ≤ 60
𝑥 + 𝑦 ≤ 16
3𝑥 + 6𝑦 ≤ 60

𝑥=0 𝑦=0
3 0 + 6𝑦 = 60 3𝑥 + 6(0) = 60
6𝑦 = 60 3𝑥 = 60
𝑦 = 10 𝑥 = 20

(0,10) (20,0)
3𝑥 + 6𝑦 ≤ 60
3𝑥 + 6𝑦 ≤ 60
test point (0,0)
3(0) + 6(0) ≤ 60
0 ≤ 60
true
𝑥 + 𝑦 ≤ 16
𝑥=0 𝑦=0
0+𝑦 = 16 𝑥 + 0 = 16
𝑦 = 16 𝑥 = 16

(0,16) (16,0)
𝑥 + 𝑦 ≤ 16
test point (0,0)
0 + 0 ≤ 16
0 ≤ 16
true
3𝑥 + 6𝑦 = 60
−3(𝑥 + 𝑦 = 16) B
3𝑥 + 6𝑦 = 60
−3𝑥 − 3𝑦 = −48 B
3𝑦 = 12
𝑦=4
𝑥 + 𝑦 = 16
𝑦=4
𝑥 + 4 = 16 B
𝑥 = 16 − 4
𝑥 = 12

B (12,4)
10𝑥 + 15𝑦 Value
Points A: (0 , 10) 10 0 + 15(10) 150
Points B: (12 , 4) 10 12 + 15(4) 180
Points C: (16 , 0) 10 16 + 15(0) 160
10𝑥 + 15𝑦 Value
Points A: (0 , 10) 10 0 + 15(10) 150
Points B: (12 , 4) 10 12 + 15(4) 180
Points C: (16 , 0) 10 16 + 15(0) 160

I should answer 12 items in question A and 4 items in question B


in order to get the best score.
Solve!

You might also like