Scribd
Upload
17 views

Linear Programming 3

The document describes a linear programming problem to minimize the cost of producing a drug from two ingredients (A and B) given ingredient cost and antibiotic production requirements. The optimal solution is to produce 1 unit of ingredient A and 3 units of ingredient B, resulting in a minimum cost of ₧230. This satisfies all antibiotic production constraints while minimizing overall cost.

Uploaded by

Nicole Ashley
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
17 views

Linear Programming 3

The document describes a linear programming problem to minimize the cost of producing a drug from two ingredients (A and B) given ingredient cost and antibiotic production requirements. The optimal solution is to produce 1 unit of ingredient A and 3 units of ingredient B, resulting in a minimum cost of ₧230. This satisfies all antibiotic production constraints while minimizing overall cost.

Uploaded by

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

Linear Programming:

Graphical Method 3
Example 2: Minimization Problem
A pharmacist produces a drug from two ingredients. Each ingredient contains the
same three antibiotics in different proportions. Each ingredient A produced results
₧80 in cost; each ingredient B results ₧50 in cost. The production of the
antibiotics is dependent on the availability of limited resources. The resource
requirements for the production are as follows.

  Resources Requirement Minimum


Antibiotic Ingredient A Ingredient B Requirement

Antibiotic 1 3 units 1 unit 6


Antibiotic 2 1 unit 1 unit 4
Antibiotic 3 2 units 6 units 12
The company wants to determine the quantity of ingredient A and B that must go in
to drug in order to meet the antibiotics minimum requirements at the minimum cost
Solution for Example 2

Let x be the quantity of ingredient A, and


y be the quantity of ingredient B.

Materials Ingredient A (x) Ingredient B (y) Requirement


Antibiotic 1 3 1 6
Antibiotic 2 1 1 4
Antibiotic 3 2 6 12
Cost ₧80 ₧50  
LP Model

Minimize: C = 80x + 50y


Subject to:
3x + y ³ 6 Þ Antibiotic 1
x+ y³4 Þ Antibiotic 2

2x + 6y ³ 12 Þ Antibiotic 3

x ³ 0, y ³ 0
Solution for Example 2

3x + y ³ 6
3x + y = 6 (0, 6) (2, 0)

x+y³4
x+y=4 (0, 4) (4, 0)

2x + 6y ≥ 12
2x + 6y = 12 (0, 2) (6, 0)
Plotting of Graphs

3x + y = 6

(0, 6) ⬤

(0, 4) ⬤ x+y=4
2x + 6y = 12
(0, 2) ⬤

⬤ ⬤ ⬤
(2, 0) (4, 0) (6, 0)
Determining the Feasible Region

3x + y ³ 6

Feasible
(0, 6) ⬤
Region
(0, 4) ✗
⬤ x+y³4

(0, 2) ✗✗
⬤
2x + 6y ³ 12

✗ ⬤✗ ⬤✗ ⬤
(2, 0) (4, 0) (6, 0)
Identifying the Extreme Points

3x + y ³ 6

Intersection of 1st
Eq. & 2nd Eq.
(0, 6) ⬤
Intersection of
⬤ 2nd Eq. & 3rd Eq.
⬤
⬤
x+y³4 2x + 6y ³ 12
⬤
⬤ ⬤ ⬤
(6, 0)
Solution for 1st Equation and 2nd Equation

1(3x + y = 6) Þ 3x + y = 6
3( x + y = 4) Þ (–) 3x + 3y = 12
0x – 2y = –6
– 2y = –6
y=3
3x + 3 = 6
3x = 6 – 3
The intersection of first equation and
3x = 3
second equation is (1, 3).
x=1
Solution for 2nd Equation and 3rd Equation

2( x + y = 4) Þ 2x + 2y = 8
1(2x + 6y = 12) Þ (–) 2x + 6y = 12
0x – 4y = –4
– 4y = –4
y=1
x+1=4
x=4–1
x=3 The intersection of second equation and
third equation is (3, 1).
Identifying the Extreme Points

3x + y ³ 6

(0, 6) ⬤

⬤
(1, 3)
⬤
⬤
(3, 1) 2x + 6y ³ 12
⬤
x+y³4
⬤ ⬤ ⬤
(6, 0)
Optimal Solution for Example 2

Objective Function: C = 80x + 50y

Extreme points Values of the objective function


(0, 6) 80(0) + 50(6) = 0 + 300 = 300 Optimal
Value
(6, 0) 80(6) + 50(0) = 480 + 0 = 480
(1, 3) 80(1) + 50(3) = 80 + 150 = 230
(3, 1) 80(3) + 50(1) = 240 + 50 = 290

Decision: C = ₧230
x = 1 unit of Ingredient A
y = 3 units of Ingredient B
Checking
Solution: (x, y) = (1, 3)

Constraint for Antibiotic 1

3x + y ³ 6 Þ 3(1) + 3 ³ 6 Þ3+3³6 Þ6³6

Constraint for Antibiotic 2


x+y³4 Þ1+3³4 Þ4³4

Constraint for Antibiotic 3


2x + 6y ³ 12 Þ 2(1) + 6(3) ³ 12 Þ 2 + 18 ³ 12 Þ 20 ³ 12

You might also like