A firm produces two products, $x$ and $y$, using two inputs, $A$ and $B$. The available quantities of $A$ and $B$ are 1600 units and 2000 units, respectively. Producing one unit of $x$ requires 4 units of $A$ and 2 units of $B$. Producing one unit of $y$ requires 2 units of $A$ and 5 units of $B$. The profits per unit of $x$ and $y$ are 10 and 8, respectively. The goal is to find the output mix of $x$ and $y$ that maximizes profit using linear programming.
2025/5/16
1. Problem Description
A firm produces two products, and , using two inputs, and . The available quantities of and are 1600 units and 2000 units, respectively. Producing one unit of requires 4 units of and 2 units of . Producing one unit of requires 2 units of and 5 units of . The profits per unit of and are 10 and 8, respectively. The goal is to find the output mix of and that maximizes profit using linear programming.
2. Solution Steps
Let be the number of units of product and be the number of units of product .
The objective function (to maximize) is the total profit:
The constraints are based on the available quantities of inputs and :
Constraint for input A:
Constraint for input B:
Also, and must be non-negative:
We need to find the feasible region defined by these inequalities.
First, convert the inequalities to equalities:
Find the intersection points of the lines:
Intersection of and :
Multiply the first equation by -1 to eliminate x after adding the equations:
Multiply the second equation by 2:
Add the equation to the first:
Substitute into :
Intersection point:
Intersection of and :
Intersection point:
Intersection of and :
Intersection point:
Intersection of and :
Intersection point:
Intersection of and :
Intersection point:
The vertices of the feasible region are , , , and .
Evaluate the objective function at each vertex:
At :
At :
At :
At :
The maximum profit occurs at with a profit of
4
9
0
0.
3. Final Answer
The output mix that maximizes profit is and .