A firm uses labour, capital, and gold to produce jewelry of type X and Y. To produce one unit of X, the firm requires 1 unit of labour, 1 unit of capital, and 2 units of gold. To produce one unit of Y, the firm requires 1 unit of labour, 2 units of capital, and 1 unit of gold. The firm has 50 units of labour, 30 units of capital, and 80 units of gold available. Each unit of X contributes Shs 20 to profit, while each unit of Y contributes Shs 30 to profit. Use a linear programming approach to find the optimal combination of product X and Y that will maximize profits.
2025/5/16
1. Problem Description
A firm uses labour, capital, and gold to produce jewelry of type X and Y. To produce one unit of X, the firm requires 1 unit of labour, 1 unit of capital, and 2 units of gold. To produce one unit of Y, the firm requires 1 unit of labour, 2 units of capital, and 1 unit of gold. The firm has 50 units of labour, 30 units of capital, and 80 units of gold available. Each unit of X contributes Shs 20 to profit, while each unit of Y contributes Shs 30 to profit.
Use a linear programming approach to find the optimal combination of product X and Y that will maximize profits.
2. Solution Steps
Let be the number of units of product X produced.
Let be the number of units of product Y produced.
The objective function to maximize is the profit:
The constraints are:
Labour:
Capital:
Gold:
Non-negativity: ,
We will analyze the corner points of the feasible region.
1. Intersection of $x+y=50$ and $x+2y=30$:
Subtracting the first equation from the second: . Since cannot be negative, this intersection point is not feasible.
2. Intersection of $x+y=50$ and $2x+y=80$:
Subtracting the first equation from the second: .
Substituting into the first equation: , so .
Point: .
Profit:
3. Intersection of $x+2y=30$ and $2x+y=80$:
Multiply the first equation by 2:
Subtract the second equation from this: , so . Since cannot be negative, this intersection point is not feasible.
4. Intersection of $x+2y=30$ and $x=0$:
, so , which gives .
Point: .
Profit:
5. Intersection of $2x+y=80$ and $y=0$:
, so , which gives .
Point: .
Profit:
6. Intersection of $x+y = 50$ and $x=0$:
, so .
Point:
The capital constraint is violated because . Therefore is not feasible.
7. Intersection of $x+y=50$ and $y=0$:
, so .
Point: .
The gold constraint is violated because . Therefore is not feasible.
Let's check the corner points:
(0,0): Z = 0
(40,0): Z = 800
(0,15): Z = 450
(30,20): Z = 1200
However, the capital constraint needs to be checked at :
, meaning (30, 20) is infeasible.
We need to find the intersection of and where . If we have we can write . Substituting that into the other equation, we get
, so , meaning , which are both not feasible. This intersection does not produce a feasible point.
Let's find the intersection of and . Multiply the first equation by 2 and subtract the second. , so and .
Then which is non-feasible.
It seems , and are the corner points. , and .
The intersection between labour and gold constraints
and .
Subtracting from results in . This leads to .
However, is infeasible because . Let's consider , meaning that is our binding constraint.
If we use , we can find by substituting in such that is maximized with .
When , , , and since , the labour constraint is met.
If , . Z =
The point (30,0)
, ok
capital constraint is ok
, so , ok.
The profit is $
6
0
0.
Let's revisit (30,20) in case this is our optimal solution.
When x+2y =30 and x+y=50, x=100-2y. Substituting, $100-2y+2y = 30, which doesnt work since 100 doesnt =
3
0. However, if labor is fully utilized x+y=50,
2x+y <= 80 and x+2y=30
From x+2y=30, x=30-2y
Substituting in: 30-2y +y =50, or 30-y=50, y= -
2
0.
So we dont utilize full labour capacity to maximize profit. So we have labour = 0 or below (x+y)<
5
0.
3. Final Answer
The optimal combination is to produce 30 units of X and 0 units of Y.
The maximum profit is Shs
6
0
0.