LINEAR PROGRAMMING LINE Example: (16, 12)

7 X1 + 6 𝑿𝟐 = 84 7 (16) + 6 (12) ≤ 84 4 (16) + 2 (12) ≤ 32

1ST EXAMPLE:
X1 = 0 X2 = ? X1 = ? X2 = 0 112 + 72 ≤ 84 64 + 24 ≤ 32
A company that manufactures 2 kinds of pen, felt-tipped
pen and ball-point pen. (0) X1 + 6 X2= 84 7 X1+ (0) X2 = 84 184 ≤ 84 88 ≤ 32
6 X2 = 84 . 7 X1 = 84 .
Felt-Tipped Ballpoint It is the best profit we can get but not our capacity
Constraints 6 6 7 7
Pens Pens 𝑿𝟐 = 14 𝑿𝟏 = 12
Process 1 7 hours 6 hours 84 hours
Process 2 4 hours 2 hours 32 hours (0, 14) (12, 0) You are constrained to the red area and choose the
Profit P4,400 P1,600 highest profit.
(12, 14)
The optimal/best answer always lies in a corner point.
─ It takes x hours to make 100,000 pens.
─ They can only work 84 / 32 hours on that machine in 4 X1 + 2 𝑿𝟐 = 32 Corner Points Maximize z = 4,400 𝑿𝟏 + 1,600 𝑿𝟐
a week. A. (0, 14) 4,400 (0) + 1,600 (14) = z
─ For every 100,000 pens, we earn P4,400 / P1,600. X1 = 0 X2 = ? X1 = ? X2 = 0 0 + 22,400 = 22,400
B. (0, 0) 4,400 (0) + 1,600 (0) = z
(0) X1 + 2 X2 = 32 4 X1 + (0) X2 = 32 0+0=0
How many bundles of each pen should the company 2 X2 = 32 . 4 X1 = 32 . C. (8, 0) 4,400 (8) + 1,600 (0) = z
manufacture to realize maximum profit? … … ≤ (less than – downwards)
2 2 4 4 35,200 + 0 = 35,200
𝑿𝟐 = 16 𝑿𝟏 = 8 ─ The area of each constraints are forever
12 56
D. ( 5 , )
12 56
4,400 ( 5 ,) + 1,600 ( 5 ) = z
Defining Variables: 5
─ We only focus on the first quadrant because 10,560 + 17,920 = 28,480
(0, 16) (8, 0) everything should be non-negative. It is possible to
X1 = number of bundles of felt-tipped pens to
manufacture have 0, not negative.
(8, 16) ─ We don’t want to use a point beyond those CONCLUSION: The company should produce 8 bundles of
X2 = number of bundles of ballpoint pens to manufacture lines/constraints (even if we want to maximize) since felt tipped pens and 0 ballpoint pens to earn a maximum
we have constraints. of P35,200.
WHERE IS THE AREA?

Objective Function: ─ All of the constraints must be satisfied

A = (0, 14) B = (0, 0) C = (8, 0) D=?
─ Safest thing to do is to choose a point Note:
Maximize z = 4,400 X1 + 1,600 X2  Objective Function is our Profit Statement
Intersection of C1 and C2
 Another way to solve the maximum profit we can
Example: (2, 2) X1 X2 get.
Constraints: AREA Multiply a number to get Substitute the value of X1  We cannot choose a point outside the red area
7 (2) + 6 (2) ≤ 84 4 (2) + 2 (2) ≤ 32
rid of X2 and get X1 to either because of the constraints.
Subject to: 14 + 12 ≤ 84 8 + 4 ≤ 32  We want our point father away from (0,0)
7 X1+ 6 X2 = 84 4 X1 + 2 X2= 32 because we are maximizing revenue.
Technological Constraints 26 ≤ 84 12 ≤ 32 12
4 5 + 2 X2= 32  We want to be farthest away as possible from
-3 (4 X1 + 2 X2= 32) 48
7 X1 + 6 X2 ≤ 84 It is less than 84 or 32 hours but not enough to + 2 X2= 32 (0,0) without going out of the area.
-12 X1 - 6 X2 = -96 5
 The last point to hit before leaving the area is
maximize profit
4 X1 + 2 X2 ≤ 32 2 X2 = 32 –
48 (8,0)—the answer.
7 X1 - 12 X1 = 84 – 96 5
Example: (12, 6) -5 X1 = -12
-5 -5 2 X2 = 32
32 (5)
–
48
7 (12) + 6 (6) ≤ 84 4 (12) + 2 (6) ≤ 32 1 (5) 5
Non-Negativity Constraints
84 + 36 ≤ 84 48 + 12 ≤ 32 160 48
X1 ≥ 0 X2 ≥ 0 OR X1, X2 ≥ 0 2 X2 = –
5 5
120 ≤ 84 60 ≤ 32
112
2 X2 =
It is more than 84 or 32 hours 5

CORNER POINTS 𝟓𝟔
X1 = 12 . X2 =
5 𝟓
─ Corner points define the area of intersection
─ Look for area where all constraints intersect 12 56
D=( , )
─ Where you see all the colors is where the area 5 5
intersect Find the coordinate (X1, X2), such that when you put it
─ It is only in the read area where we can all the colors into objective function, and it will give the highest value
─ Red is the area of intersection (maximize profit).
─ The best answer will always lies in corner points.
Look for an area where all those constraints intersect.

APRIL KAE APRIL KAE APRIL KAE APRIL KAE APRIL KAE APRIL KAE
2|Page
 Minimize z = 0.75 X1 + X2 CORNER POINTS

Constraints: Note:
 We want the slope (objective function) to move
Subject to: inward because we are minimizing. As we move
inward, we are moving towards (0,0), which
Technological Constraints
means we spend less. But as we move outward,
40 X1 + 30 X2 ≥ 100 the costs are increasing.
 We cannot find a point below the area or line
40 X1 + 60 X2 ≥ 160 because of constraints
 The last point to hit before leaving the area is
(1,2)—the answer.
Non-Negativity Constraints  We must always find a point inside the area
because that is where all constraints are satisfied
X1 ≥ 0 X2 ≥ 0

LINE

Note: 40 X1 + 30 X2 = 100
… … ≥ (greater than – upwards)
─ Graphing can only solve for 2 variables X1 = 0 X2 = ? X1 = ? X2 = 0
─ One line per constraint
─ 2 or more variables have other method (0) X1 + 30 X2 = 100 40 X1+ (0) X2 = 100 A = (0, 3.33) B=? C = (4, 0)
30 X2 = 100 . 40 X1 = 100 .
30 30 40 40 Intersection of C1 and C2
𝑿𝟐 = 3.33 𝑿𝟏 = 2.5
2ND EXAMPLE: X1 X2
(0, 3.33) (2.5, 0) Multiply a number to get Substitute the value of X2
A doctor has ordered his patient to take at least 100 mg
rid of 1 variable and get to either
of Drug A and 160 mg of Drug B twice a day as part of
(2.5, 3.33) the other variable
his treatment for tuberculosis.
40 X1 + 30 X2 = 100
These drugs are not available in pure form but the 40 X1 + 30 X2 = 100 40 X1 + 30 (2) = 100
40 X1 + 60 = 100
drugstore stocks tablets containing 40 mg of A and 40 mg
-1 (40 X1 + 60 X2 = 160) 40 X1 = 100 – 60
of B and capsules containing 30 mg of A and 60 mg of B. 40 X1 + 60 X2 = 160 -40 X1 - 60 X2 = -160
The cost is 75 centavos per tablet and one peso per 40 X2 = 40
X1 = 0 X2 = ? X1 = ? X2 = 0 Maximization = We want the line to be as high it can be
30 X2 - 60 X2 = 100 – 160 40 40
capsule. How many of each must the patients buy to without going out to the constraints
-30 X2 = -60
minimize his cost? (0) X1 + 60 X2 = 160 40 X1 + (0) X2 = 160 -30 -30 Minimization = We want the line to be as low as possible
60 X2 = 160 . 40 X1 = 160 .
Tablets Capsules Constraints 60 60 40 40 without leaving the area.
X2 = 2 X1= 1
At least 100 𝑿𝟐 = 2.67 𝑿𝟏 = 4
Drug A 40 mg 30 mg
mg (2x / day)
At least 160 (0, 2.67) (4, 0) B = (1, 2) 3RD EXAMPLE:
Drug B 40 mg 60 mg mg
(2x / day) You are constrained to the red area and choose the Solve the following problems given these constraints and
(4, 2.67)
Profit P0.75 P1.00 highest profit. this objective.

AREA The optimal/best answer always lies in a corner point. Objective Function:
How many of each must the patients buy to minimize his
cost? ─ All of the constraints must be satisfied Corner Points Minimize z = 0.75 X1 + X2 Maximize z = 30 X1 + 40 X2
A. (0, 3.33) 0.75 (0) + (3.33) = z
Defining Variables: 0 + 3.33 = 3.33
B. (1, 2) 0.75 (1) + (2) = z
X1 = number of Tablets to buy 0.75 + 2 = 2.75 Constraints:
C. (4, 0) 0.75 (4) + (0) = z
X2 = number of Capsules to buy Subject to:
4+0=8
Technological Constraints

Objective Function: CONCLUSION: This person must buy 1 tablet and 2 4 X1 + 2 X2 ≤ 16

capsules to spend minimum amount of P2.75.

APRIL KAE APRIL KAE APRIL KAE APRIL KAE APRIL KAE APRIL KAE
3|Page 4|Page
2 X1 – X 2 ≥ 2 CORNER POINTS

X2 ≤ 2 Corner Points Maximize z = 30 X1 + 40 X2 LINE

A. (1, 0) 30 (1) + 40 (0) = z
30 + 0 = 30 2 X1 + 4 X2 = 400
B. (2, 2) 30 (2) + 40 (2) = z
Non-Negativity Constraints X1 = 0 X2 = ? X1 = ? X2 = 0
60 + 80 = 140
X1 ≥ 0 X2 ≥ 0 C. (3, 2) 30 (3) + 40 (2) = z
2 (0) + 4 X2 = 400 2 X1 + 4 (0) = 400
90 + 80 = 170
4 X2 = 400 . 2 X1 = 400 .
D. (4, 0) 30 (4) + 40 (0) = z
4 4 2 2
120 + 0 = 120
LINE 𝑿𝟐 = 100 𝑿𝟏 = 200

4 X1 + 2 X2 = 16 CONCLUSION: Produce 3 of X1 and 2 of X2 to maximize (0, 100) (200, 0)

profit of P170.
X1 = 0 X2 = ? X1 = ? X2 = 0 (200, 100)

4 (0) + 2 X2 = 16 4 X1 + 2 (0) = 16
2 X2 = 16 . 4 X1 = 16 . 4TH EXAMPLE: 100 X1 + 50 X2 = 8,000
2 2 4 4
𝑿𝟐 = 8 𝑿𝟏 = 4 Personal Mini Warehouses is planning to expand its X1 = 0 X2 = ? X1 = ? X2 = 0
successful Orlando business into Tampa. In doing so, the
(0, 8) (4, 0) company must determine how many storage rooms of 100 (0) + 50 X2 = 8,000 100 X1 + 50 (0) = 8,000
each size to build. Its objective and constraints follow: 50 X2 = 8,000 100 X1 = 8,000
(4, 8) 50 50 100 100
A = (1, 0) B=? C=? D = (4, 0) Defining Variables: 𝑿𝟐 = 160 𝑿𝟏 = 80
Intersection of C2 and C3 X1 = number of large spaces developed
2 X1 – X 2 = 2 (0, 160) (80, 0)
X1 X2 X2 = number of small spaces developed
X1 = 0 X2 = ? X1 = ? X2 = 0 2 X1 – X 2 = 2 2 X 1 – X2 = 2 (80, 160)
2 (2) – X2 = 2
2 (0) – X2 = 2 2 X 1 – X2 = 2 X2 = 2 4 - 2 = X2 Objective Function:
– X2 = 2 . 2 X1 = 2 . X1 = 60
-1 -1 2 2 2 X1 = 2 + 2 Maximize monthly earnings = 50 X1 + 20 X2
𝑿𝟐 = -2 𝑿𝟏 = 1 2 X1 = 4 (60, 0)
2 2
(0, -2) (1, 0) Constraints:
CORNER POINTS
X1 = 2 X1= 2
(1, -2) Subject to:

Technological Constraints
B = (2, 2)
X2 = 2
2 X1 + 4 X2 ≤ 400 (advertising budget available)
(0, 2)
100 X1 + 50 X2 ≤ 8,000 (square footage required)
A = (1, 0) B = (2, 2) C=? D = (4, 0)
X1 ≤ 60 (rental limit expected)
Intersection of C1 and C3

X1 X2
Non-Negativity Constraints
4 X1 + 2 X2 = 16 4 X1 + 2 X2 = 16
4 (3) + 2 X2 = 16 X1 ≥ 0 X2 ≥ 0
-2 (X2 = 2) 12 + 2 X2 = 16
-2 X2 = -4 2 X1 = 16 - 12

4 X1 = 16 – 4 2 X2 = 4
4 X1 = 12 2 2
4 4

X1 = 3 X2 = 2

C = (3, 2)

APRIL KAE APRIL KAE APRIL KAE APRIL KAE APRIL KAE APRIL KAE
5|Page 6|Page
 CONCLUSION: Personal Mini Warehouses should develop (20, 60) 6TH EXAMPLE:
60 large spaces and 40 small spaces to maximize profit
A = (0, 0) B = (0, 100) C=? D=? of P3,800. Consider this LP formulation
CORNER POINTS
E = (60,0) Objective Function:

Intersection of C1 and C2 5TH EXAMPLE: Minimize Cost = $ X + $ 2Y

X1 X2 The High Note Sound Company manufactures quality

100 X1 + 50 X2 = 8,000 2 X1 + 4 (80) = 400 compact disc (CD) players and stereo receivers. Each of
2 X1 + 320 = 400 Constraints:
these products requires a certain amount of skilled
-50 (2 X1 + 4 X2 = 400) 2 X1 = 400 – 320
artisanship, of which there is a limited weekly supply. The Subject to:
-100 X1 – 200 X2 = -20,000
firm formulates the following LP problem in order to
2 X1 = 80
determine the best production mix of CD players (X1) and Technological Constraints
50 X2 – 200 X2 = 8,000 – 2 2
20,000 receivers (X2):
X + 3Y ≥ 90
Objective Function:
-150 X2 = –12,000 8X + 2Y ≥ 160
-150 -150
Maximize cost = $50 X1 + $120 X2
3X + 2Y ≥ 120

X2 = 80 X1= 40 Y ≤ 70
Constraints:

C = (40, 80) Subject to:

Non-Negativity Constraints
Technological Constraints
X≥ 0 Y≥0
A = (0, 0) B = (0, 100) C = (40, 80) D=? 2 X1 + 4 X2 ≤ 80 (hours of available electricians’ time) A = (0, 0) B = (0, 20) C=? D = (20, 0)

E = (60,0) 3 X1 + 1 X2 ≤ 60 (hours of audio technicians’ time avail.) Intersection of C1 and C2 LINE

Intersection of C2 and C3 X1 X2 X + 3Y = 90
2 X1 + 4 X2 = 80 2 X1 + 4 X2 = 80
X1 X2 Non-Negativity Constraints
2 (16) + 4 X2 = 80 X=0 Y=? X=? Y=0
100 X1 + 50 X2 = 8,000 100 X1 + 50 X2 = 8,000 -4 (3 X1 + 1 X2 = 60) 32 + 4 X2 = 80
X1 ≥ 0 X2 ≥ 0
100 X1 + 50 (40) = 8,000 -12 X1 – 4 X2 = –240 4 X2 = 80 – 32 (0) + 3Y = 90 X + 3 (0) = 90
-100 (X1 = 60) 100 X1 + 2,000 = 8,000 3Y = 90 .
-100 X1 = -6,000 100 X1 = 8,000 – 2,000 2 X1 – 12 X1 = 80 – 240 4 X2 = 48 3 3 X = 90
LINE 4 4 Y= 30
50 X2 = 8,000 - 6,000 100 X1 = 6,000 -10 X1 = –160 (90, 0)
50 X2 = 2,000 100 100 2 X1 + 4 X2 = 80 -10 -10 (0, 30)
50 50
𝑋1 = 0 𝑋2 = ? 𝑋1 = ? 𝑋2 = 0
(90, 30)
X1 = 16 X2 = 12
X2 = 40 X1= 60 2 (0) + 4 X2 = 80 2 X1 + 4 (0) = 80
4 X2 = 80 . 2 X1 = 80 .
8X + 2Y = 160
4 4 2 2
D = (60, 40) C = (16, 12)
𝑿𝟐 = 20 𝑿𝟏 = 40 X=0 Y=? X=? Y=0

(0, 20) (40, 0) 8 (0) + 2Y = 160 8X + 2 (0) = 160

Corner Points Maximize z = 50 X1 + 120 X2 2Y = 160 8X = 160
(40, 20) A. (0, 0) 50 (0) + 120 (0) = z 2 2 8 8
Corner Points Maximize z = 50 X1 + 20 X2 0+0=0 Y = 80 X = 20
A. (0, 0) 50 (0) + 20 (0) = z B. (0, 20) 50 (0) + 120 (20) = z
0+0=0 3 X1 + 1 X2 = 60 0 + 0 = 2,400 (0, 80) (20, 0)
B. (0, 100) 50 (0) + 20 (100) = z C. (16, 12) 50 (16) + 120 (12) = z
𝑋1 = 0 𝑋2 = ? 𝑋1 = ? 𝑋2 = 0 800 + 1,440 = 2,240
0 + 2,000 = 2,000 (20, 80)
C. (40, 80) 50 (40) + 20 (80)= z D. (20, 0) 50 (20) + 120 (0) = z
3 (0) + 1 X2 = 60 3 X1 + 1 (0) = 60 1,000 + 0 = 1,000
2,000 + 1,600 = 3,600
1 X2 = 60 3 X1 = 60
D. (60, 40) 50 (60) + 20 (40)= z 3X + 2Y = 120
1 1 3 3
3,000 + 800 = 3,800
𝑿𝟐 = 60 𝑿𝟏 = 20 CONCLUSION: High Note Sound Company should X=0 Y=? X=? Y=0
E. (60, 0) 50 (60) + 20 (0) = z
3,000 + 0 = 3,000 produce 0 compact disc (CD) players and 20 stereo
(0, 60) (20, 0) receivers to maximize a weekly profit of $2,400.

APRIL KAE APRIL KAE APRIL KAE APRIL KAE APRIL KAE APRIL KAE
7|Page 8|Page
 A = (2.5, 70) B=? C=? D = (90, 0)
3 (0) + 2Y = 120 3X + 2 (0) = 120
2Y = 120 3X = 120 Intersection of C2 and C3
2 2 3 3
Y = 60 X = 40 X Y
8X + 2Y = 160 8X + 2Y = 160
(0, 60) (40, 0) 8 (8) + 2Y = 160
-1 (3X + 2Y = 120) 64 + 2Y = 160
-3X – 2Y = -120 2Y = 160 – 64
(40, 60)
8X – 3X = 160 – 120 2Y = 96
2 2
Y = 70
5X = 40
(0, 70) 5 5

CORNER POINTS X= 8 Y = 48

Notes

B = (8, 48) o =  Line (only line without an area)

o <  Inequality
o The intersection of an area in a line is oinly the
points in a line.
A = (2.5, 70) B = (8, 48) C=? D = (90, 0)
o The intersection of an Area and a Line is the line.
Intersection of C1 and C3

X Y
3X + 2Y = 120 3X + 2Y = 120
3X + 2 (21.43) = 120
-3 (X + 3Y = 90) 3X + 42.86 = 120
-3X – 9Y = -270 3X = 120 – 42.86

2Y – 9Y = 120 – 270 3X = 77.14

3 3
–7Y = –150
–7 –7

Y = 21.43 X = 25.71
A=? B=? C=? D = (90, 0)

Intersection of C2 and C4 C = (25.71, 21.43)

X Y
8X + 2Y = 160 8X + 2Y = 160
8 (2.50) + 2Y = 160 Corner Points Minimize z = X + 2Y
-2 (Y = 70) 20 + 2Y = 160 A. (2.5, 70) (2.5) + 2 (70) = z
-2Y = -140 2Y = 160 – 20 2.5 + 140 = 142.5
B. (8, 48) (8) + 2 (48) = z
8X = 160 – 140 2Y = 140 8 + 96 = 104
2 2 C. (25.71, 21.43) (25.71) + 2 (21.43) = z
8X = 20 25.71 + 42.86 = 68.57
8 8 D. (90, 0) (90) + 2 (0) = z
90 + 0 = 90

X = 2.5 Y = 70
CONCLUSION: C (25.71, 21.43) = to minimize costs of
$68.57

A = (2.5, 70)

APRIL KAE APRIL KAE APRIL KAE APRIL KAE APRIL KAE APRIL KAE
9|Page 10 | P a g e