Scribd
Upload
516 views2 pages

Linear Programming Solutions for Profit Maximization

The document summarizes the solutions to two linear programming problems using graphical methods. The first problem involves maximizing profit from production of two items with constraints on resources. The optimal solution is found to be producing 10 units of the first item. The second problem involves maximizing profit from producing dresses and trousers with time constraints. The optimal solution is found to be producing 12 dresses and 8 trousers for a maximum profit of 880 pesos.

Uploaded by

Ojie
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
516 views2 pages

Linear Programming Solutions for Profit Maximization

The document summarizes the solutions to two linear programming problems using graphical methods. The first problem involves maximizing profit from production of two items with constraints on resources. The optimal solution is found to be producing 10 units of the first item. The second problem involves maximizing profit from producing dresses and trousers with time constraints. The optimal solution is found to be producing 12 dresses and 8 trousers for a maximum profit of 880 pesos.

Uploaded by

Ojie
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

Rogelio G.

Julian Aug 5, 2017


MM-EM Engr. Rey Robles

Activity: To solve the linear programming exercise using graphical method:

Problem #1:
Maximize Z = 100x1 + 60x2

Subject to:
5x1 + 10x2 50,
8x1 + 2x2 16,
3x1 - 2x2 6,
x1, x2 0

Solution:
5x1 + 10x2 = 50, x1 0 10
1. If x1 = 0; x2 = 5 x2 5 0

If x2 = 0; x1 = 10

8x1 + 2x2 = 16, x1 0 2


2. If x1 = 0; x2 = 8
x2 8 0
If x2 = 0; x1 = 2

3x1 - 2x2 = 6, x1 0 2
3. If x1 = 0; x2 = -3 x2 12 0

If x2 = 0; x1 = 2

For Point A:

5x1 + 10x2 = 50 5x1 +10x2 = 50 5x1 + 10x2 = 50


(3x1 - 2x2 = 6) 5 15x1 - 10x2 = 30 5(4) + 10x2 = 50
20x1 + 0 = 80 x2 = (50-20)/10
x1 = 80/20 = 4 x2 =30/10 = 3

Z @ (2,0)
ZA = 100(4)+ 60(3) = 580

Z @ (2,0)
ZB = 100(2)+ 60(0) = 200

Z @ (10,0)
ZC = 100(10)+ 60(0) = 1000

Therefore, maximum is at point C, where: x1 = 10 & x2 = 0


Problem #2:

A small business enterprise makes dresses and trousers. To make a dress requires 1/2 hour of
cutting and 20 minutes of stitching. To make trousers requires 15 minutes of cutting and 1/2 hour
of stitching. The profit on a dress is Php.40 and on a pair of trousers Php.50. The business
operates for a maximum of 8 hours per day. Determine how many dresses and trousers should
be made to maximize profit and what the maximum profit is.

Interpretation:

Product Cutting time Stitching time Profit


Dress (x1) hour 1/3 hour $ 40
Trouser (x2) hour hour $ 50
Equation 1/2x1 + 1/4x2 8; 1/3x1 + 1/2x2 8, Z = 40x1 + 50x2
2x1 + x2 32 2x1 + 3x2 48

Solution:

1. If x1 = 0; x2 = 32 x1 0 16
If x2 = 0; x1 = 32/2 = 16 x2 32 0

2. If x1 = 0; x2 = 48/3 = 16 x1 0 24
If x2 = 0; x1 = 48/2 = 24 x2 16 0

Z @ (12,8)
ZA = 40(12) + 50(8) = 880

Z @ (0,16)
ZB = 40(0) + 50(16) = 800

Z @ (16,0)
ZC = 40(16) + 50(0) = 640

Therefore, there should be 12 dresses and 8 trousers to have maximum profit.

The maximum profit is Php 880.

You might also like