0% found this document useful (0 votes)
146 views4 pages

Linear Programming for Students

1. A gem maker makes two bracelet designs: heart and flower. The heart design uses 3 ounces of gold and 4.5 ounces of platinum per bracelet for a $2,500 profit. The flower design uses 2.5 ounces of gold and 3 ounces of platinum for a $3,400 profit. 2. The problem involves maximizing total profit given constraints of 28 ounces of gold and 20 ounces of platinum. The optimal solution produces 5 heart bracelets and 4 flower bracelets for a maximum profit of $26,100. 3. A second problem involves two machines, A and B, that produce items at rates of 50 and 40 per hour respectively. The goal is to
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
146 views4 pages

Linear Programming for Students

1. A gem maker makes two bracelet designs: heart and flower. The heart design uses 3 ounces of gold and 4.5 ounces of platinum per bracelet for a $2,500 profit. The flower design uses 2.5 ounces of gold and 3 ounces of platinum for a $3,400 profit. 2. The problem involves maximizing total profit given constraints of 28 ounces of gold and 20 ounces of platinum. The optimal solution produces 5 heart bracelets and 4 flower bracelets for a maximum profit of $26,100. 3. A second problem involves two machines, A and B, that produce items at rates of 50 and 40 per hour respectively. The goal is to
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

MODULE 5.2 RAÑOLA, ANDREY MARY C.

ACTIVITY
LINEAR PROGRAMMING MMW SECTION: 04015 - 17:00-18:30 TTH
APPLICATIONS
1) THE GEM MAKER OF JEWELRY MAKES TWO BRACELET
DESIGNS, HEART DESIGN AND FLOWER DESIGN.....
Product
Quantity Gold Platinum Profit

Heart (x) 3 4.5 2,500

Flower (y) 2.5 3 3,400

3x +4.5y ≤ 28 x=9.33, y=6.22 4.5x +3y ≤ 20 x=8, y=6.67


3x +2.5y = 28 X-Intercept (9.33, 0) 4.5x +3y = 20 X-Intercept (8, 0)

3x +2.5y = 28 Y-Intercept (0, 6.22) 4.5x +3y = 20 Y-Intercept (0, 6.67)


MODULE 5.2 RAÑOLA, ANDREY MARY C.
ACTIVITY
LINEAR PROGRAMMING MMW SECTION: 04015 - 17:00-18:30 TTH
APPLICATIONS
1) THE GEM MAKER OF JEWELRY MAKES TWO BRACELET
DESIGNS, HEART DESIGN AND FLOWER DESIGN.....
(0,6.67) The store has 28 ounces of gold and 20 ounces
of platinum.
(0,6.22) Verticles of the Maximum profit:
feasible region 2500x +3400y = z

POINT OF (5, 4) 12,500 + 13,600 = 26,100


INTERSECTION

(2.67, 4.44) (2, 2) 5,000 + 6,800 = 11,800

(2, 4) 5,000 + 13,600 = 18,600

2500x +3400y = z
2500(5) + 3400(4) = z
12,500 + 13,600 = 26,100 Maximum profit
0 (8,0) (9.33,0)
MODULE 5.2 RAÑOLA, ANDREY MARY C.
ACTIVITY
LINEAR PROGRAMMING MMW SECTION: 04015 - 17:00-18:30 TTH
APPLICATIONS
2) TWO MACHINES, A AND B PRODUCE ITEMS AT THE RATE
OF 50 PER HOUR AND 40 PER HOUR, RESPECTIVELY.....
A B Units to be
produced
Units per 50 40 1,000
hour

Substitute:
1,000 = 50A + 40B A + B = 24
A = 24 - B
1,000 = 50(24 - B) + 40B A + 20 = 24
1,000 = 1,200 - 50B + 40B A = 24
-200 = -10B
B = 20

"A" produces for four hours, while


"B" produces for twenty hours
MODULE 5.2 RAÑOLA, ANDREY MARY C.
ACTIVITY
LINEAR PROGRAMMING MMW SECTION: 04015 - 17:00-18:30 TTH
APPLICATIONS
2) TWO MACHINES, A AND B PRODUCE ITEMS AT THE RATE
OF 50 PER HOUR AND 40 PER HOUR, RESPECTIVELY.....

Verticles of the
feasible region Maximum : 1,000= z
(0,25)
(0,24) POINT OF
INTERSECTION (5, 4) 250, 160
(4,20)
20
(10, 22) 500, 880
15
(20,24) 1000, 960

10

0 5 10 15 (20,0)
(24,0)

You might also like