Scribd
Upload
20 views3 pages

Linear Programming - Maximization

The document outlines a linear programming problem focused on maximizing profit from roasting, grinding, and packing coffee products. It includes the objective function, constraints, feasible points, and optimal points, with calculations showing that the optimal solution is to produce 14 cases of classic coffee and 0 cases of decaf. Additionally, it provides details on slack variables for each constraint.

Uploaded by

rodriguezgdc08
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
20 views3 pages

Linear Programming - Maximization

The document outlines a linear programming problem focused on maximizing profit from roasting, grinding, and packing coffee products. It includes the objective function, constraints, feasible points, and optimal points, with calculations showing that the optimal solution is to produce 14 cases of classic coffee and 0 cases of decaf. Additionally, it provides details on slack variables for each constraint.

Uploaded by

rodriguezgdc08
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
You are on page 1/ 3

Rodriguez, Gianne Danielle C.

| A-334

Linear Programming: Maximization

Process/Product Classic Decaf Sign Mins per Day

Roasting 9 7 ≤ 126

Grinding 7 8 ≤ 112

Packing 6 11 ≤ 132

Profit per case 6 4 = MAX

a.​ Objective Function: Zj = 6x + 4y

b.​ Constraints:

Roasting: (14,18) 9x + 7y = 126 9x + 7y = 126

9(0) + 7y = 126 9x + 7(0) = 126


0 + 7y = 126 9x + 0 = 126
7=7 9x = 126
y = 18 9=9
x = 14

Grinding: (16,14) 7x + 8y = 112 7x + 8y = 112

7(0) + 8y = 112 7x + 8(0) = 112


0 + 8y = 112 7x + 0 = 112
8=8 7x = 112
y = 14 7=7
x = 16

Packing: (22,12) 6x + 11y = 132 6x + 11y = 132

6(0) + 11y = 132 6x + 11(0) = 132


0 + 11y = 132 6x + 0 = 132
11 = 11 6x = 132
y = 12 6=6
x = 22
c.​ Graph

d.​ Elimination

9
(7x + 8y = 112) 63x + 72y = 1,008 7x + 8y = 112
7x + 8(5.4782) = 112
7
(9x + 7y = 126) 63x + 49y = 882 7x + 43.8256 = 112
7x = 112 - 43.8256
23y = 126 7x = 68.1744
23 = 23 7 =7
y = 5.4782 x = 9.7392

9
(6x + 11y = 132) 54x + 99y = 1,188 6x + 11y = 132
6x + 11(7.57895) = 132
6
(9x + 7y = 126) 54x + 42y = 756 6x + 83.36845 = 132
6x = 132 - 83.36845
57y = 432 6x = 48.63155
57 = 57 6 =6
y = 7.57895 x = 8.10526
e.​ Feasible Points:

A.​ (14,0) 6(14) + 4(0) 84

B.​ (9.7392, 5.47826) 6(9.7392) + 4(5.47826) 80.34824

C.​ (8.10526, 7.57895) 6(8.10526) + 4(7.57895) 78.94736

D.​ (0,12) 6(0) + 4(12) 48

f. Optimal Points: 14,0

g. Slack Variables:

Constraints Available Required Slack

Roasting 9x + 7y 9(14) + 7(0) 126 126 0

Grinding 7x + 8y 7(14) + 8(0) 112 98 14

Packing 6x + 11y 6(14) + 11(0) 132 84 48

You might also like