MATH 125 - FINITE MATHEMATICS
- Optimization and Decision Making
Question Bank - Set 1
Liberty University
Question 1
Question
A company produces two types of products, Product A and Product B. Each
unit of Product A requires 4 hours of labor and 2 hours of machine time to
produce, while each unit of Product B requires 2 hours of labor and 3 hours
of machine time to produce. It is estimated that the company has 200 hours
of labor available per week and 150 hours of machine time available per week.
If the profit on each unit of Product A is
$
30 and the profit on each unit of
Product B is
$
40, how many units of each product should the company produce
to maximize the weekly profit?
Solution
Step 1: Define the decision variables. Let xbe the number of units of Product
A produced and ybe the number of units of Product B produced.
Step 2: Write the objective function. We want to maximize the profit, which
is given by:
P= 30x+ 40y
Step 3: Write the constraints. The constraints are the labor and machine
time constraints:
Labor constraint: 4x+ 2y≤200
Machine time constraint: 2x+ 3y≤150
Step 4: Non-negativity constraints. Since the number of units produced
cannot be negative:
x≥0, y ≥0
Step 5: Plot the feasible region. To find the feasible region, we graph the
inequalities from the constraints and find the region that satisfies all of them.
Step 6: Identify the corner points of the feasible region. The corner points
of the feasible region where the maximum profit occurs are the intersections of
the lines defined by the constraints.
Step 7: Evaluate the objective function at each corner point to find the
maximum profit. The corner points are the intersections of the following lines:
Corner point 1: (0,50)
Corner point 2: (0,66.¯
6)
Corner point 3: (50,25)
Corner point 4: (37.5,25)
Corner point 5: (25,0)
Corner point 6: (50,0)
Evaluate the profit at each corner point:
Corner point 1: P= 40(50) = 2000
Corner point 2: P= 30(66.¯
6) ≈2000
Corner point 3: P= 30(50) + 40(25) = 2500
Corner point 4: P= 30(37.5) + 40(25) = 1875
Corner point 5: P= 30(25) = 750
Corner point 6: P= 30(50) = 2000
Step 8: Conclusion. The company should produce 50 units of Product A
and 25 units of Product B to maximize the weekly profit, which would be
$
2500.
Question 2
Question
A company manufactures two types of products, Product A and Product B.
Each unit of Product A requires 4 hours of labor and 3 hours of machine time,
while each unit of Product B requires 2 hours of labor and 5 hours of machine
time. The company has 80 hours of labor and 60 hours of machine time avail-
able per day. If the profit from each unit of Product A is
$
6 and from each
unit of Product B is
$
4, how many units of each product should the company
manufacture per day to maximize profit?
Solution
Step 1: Define the variables: Let xbe the number of units of Product A to be
produced per day, and let ybe the number of units of Product B to be produced
per day.
2
Step 2: Write the objective function: The total profit can be expressed as
P= 6x+ 4y.
Step 3: Write the constraints: The constraints are based on the available
labor and machine time per day: - Labor constraint: 4x+ 2y≤80 (labor hours
available) - Machine time constraint: 3x+ 5y≤60 (machine hours available)
Step 4: Plot the feasible region: To find the feasible region, plot the lines
formed by the constraints and shade the region that satisfies all constraints.
Step 5: Find the corner points: The corner points of the feasible region are
the intersection points of the constraint lines.
Step 6: Evaluate the objective function at each corner point: Calculate the
value of the objective function P= 6x+ 4yat each corner point.
Step 7: Determine the maximum profit: Identify the corner point that yields
the maximum profit. That combination of xand ywill maximize the profit for
the company.
Step 8: Make the conclusion: The company should manufacture a certain
number of units of Product A and Product B per day to maximize profit.
Question 3
Question
A company manufactures two types of electronic gadgets: Gadget A and Gadget
B. Each Gadget A sold contributes
$
30 to the profit, while each Gadget B sold
contributes
$
50 to the profit. The company has a production constraint such
that they can produce at most 100 gadgets in total per week. Additionally, they
have a resource constraint where Gadget A requires 2 hours of labor to produce,
and Gadget B requires 3 hours of labor to produce per unit. The company has
a labor constraint such that they can dedicate at most 240 hours to production
per week. How many of each gadget should the company produce to maximize
their profit?
Solution
Step 1: Define the decision variables.
Let’s define: - x: the number of Gadget A produced per week - y: the number
of Gadget B produced per week
Step 2: Write the objective function.
The profit function to be maximized can be expressed as:
P= 30x+ 50y
Step 3: Write the constraints.
We have the following constraints from the problem: - Production constraint:
x+y≤100 - Labor constraint: 2x+ 3y≤240
Step 4: Set up the feasible region.
Graph the constraints to determine the feasible region.
3
Step 5: Find the feasible region’s corner points.
The corner points of the feasible region are obtained by solving the system of
equations formed by the intersection of the constraint lines.
Step 6: Evaluate the objective function at each corner point.
Calculate the profit at each corner point: (0, 0), (0, 80), (60, 40), (100, 0).
Step 7: Determine the optimal solution.
Identify the point that maximizes the profit. The optimal solution is the pro-
duction quantity that yields the highest profit.
Therefore, the company should produce 60 units of Gadget A and 40 units
of Gadget B to maximize their profit.
Question 4
Question
A company manufactures two products, A and B. The manufacturing process
for each product requires labor and materials. Product A requires 5 hours of
labor and 2 units of material, while product B requires 4 hours of labor and 3
units of material. The company has 120 hours of labor and 60 units of material
available each week. Product A sells for
$
10 per unit and product B sells for
$
15 per unit. How many units of each product should the company produce
each week to maximize revenue?
Solution
Step 1: Define the variables. Let xbe the number of units of product A produced
each week and ybe the number of units of product B produced each week.
Step 2: Write the constraints based on the available labor and material. The
constraints are: 5x+ 4y≤120 (labor constraint)
2x+ 3y≤60 (material constraint)
Step 3: Write the objective function. The objective is to maximize revenue,
given by:
Revenue = 10x+ 15y
Step 4: Plot the feasible region and vertices. The feasible region will be the
intersection of the labor and material constraints in the first quadrant.
Step 5: Calculate the vertices of the feasible region.
Vertex 1 (0, 0): 10(0) + 15(0) = $0
Vertex 2 (0, 20): 10(0) + 15(20) = $300
Vertex 3 (12, 0): 10(12) + 15(0) = $120
Vertex 4 (6, 8): 10(6) + 15(8) = $150 + $120 = $270
Step 6: Determine the optimal solution. The company should produce 6
units of product A and 8 units of product B each week to maximize revenue,
with a total revenue of
$
270.
4
Question 5
Question
A company produces two types of products: chairs and tables. The profit per
chair is $30 and the profit per table is $50. Each chair requires 3 units of wood
and 2 units of labor to produce, while each table requires 4 units of wood and
5 units of labor to produce. The company has a total of 300 units of wood and
220 units of labor available. How many chairs and tables should the company
produce to maximize its profit?
Solution
Step 1: Define the variables.
Let xbe the number of chairs produced and ybe the number of tables produced.
Step 2: Write the objective function.
The objective is to maximize the profit, which is given by P= 30x+ 50y.
Step 3: Write the constraints.
We are limited by the amount of wood and labor available:
(3x+ 4y≤300
2x+ 5y≤220
Step 4: Solve the system of inequalities.
Plot the inequalities on a graph to find the feasible region and then find the
vertices of this region.
Step 5: Find the vertices of the feasible region.
The vertices of the feasible region after plotting are (0,0),(0,60),(40,40),(75,0).
Step 6: Evaluate the profit function at each vertex.
Vertex (x, y) Profit
(0,0) 0 0
(0,60) 0 3000
(40,40) 3200 4000
(75,0) 2250 3750
Step 7: Decide the optimal production quantities.
The company should produce 40 chairs and 40 tables to maximize its profit.
Question 6
Question
A company manufactures two types of products, Product A and Product B.
The company can produce up to 80 units of Product A and 60 units of Product
B per day. It is estimated that Product A requires 3 hours of labor and Product
B requires 2 hours of labor to manufacture. The company has a total of 180
5
hours of labor available per day. Each unit of Product A yields a profit of
$
50,
while each unit of Product B yields a profit of
$
60. How many units of each
product should the company produce to maximize its daily profit?
Solution
Let xbe the number of units of Product A to be produced, and ybe the number
of units of Product B to be produced.
Step 1: Write the objective function and constraints The objective
is to maximize the profit, which is given by P= 50x+ 60y.
The constraints are: - Labor constraint: 3x+ 2y≤180 - Production con-
straint for Product A: x≤80 - Production constraint for Product B: y≤60
Step 2: Graph the feasible region To graph the feasible region, we plot
the lines 3x+ 2y= 180, x= 80, and y= 60, and shade the region that satisfies
all constraints.
Step 3: Find the corner points of the feasible region The corner
points of the feasible region are the intersections of the lines, which are: - Point
A(0,0) - Point B(0,60) - Point C(60,0) - Point D(60,30)
Step 4: Evaluate the objective function at each corner point - Point
A:P(0,0) = 50(0) + 60(0) = 0 - Point B:P(0,60) = 50(0) + 60(60) = 3600
- Point C:P(60,0) = 50(60) + 60(0) = 3000 - Point D:P(60,30) = 50(60) +
60(30) = 4200
Step 5: Determine the maximum profit Since the maximum profit
occurs at Point D(60,30), the company should produce 60 units of Product A
and 30 units of Product B to maximize its daily profit. The maximum profit is
P= $4200.
Question 7
Question
A farmer wants to enclose a rectangular plot of land that lies along a river with
1000 meters of fencing. If the side along the river does not need to be fenced,
what dimensions should the farmer choose to maximize the area of the enclosed
plot?
Solution
Let’s denote the length of the plot as xmeters and the width as ymeters.
Since we are not fencing the side along the river, the fencing required will be
2x+y= 1000 =⇒y= 1000 −2x. The area of the rectangular plot is given by
A=x·y=x(1000 −2x).
Step 1: Express the area Asolely in terms of x.
A=x(1000 −2x) = 1000x−2x2
6
Step 2: To maximize the area, find the critical points by setting the deriva-
tive of Awith respect to xequal to 0.
dA
dx = 1000 −4x
1000 −4x= 0
x=1000
4= 250
Step 3: To confirm that x= 250 yields the maximum area, we will perform
the second derivative test. d2A
dx2=−4<0
Since the second derivative is negative, x= 250 corresponds to a maximum
area.
Step 4: Calculate the corresponding width yusing y= 1000 −2x.
y= 1000 −2·250 = 500
Step 5: Therefore, the farmer should choose the dimensions 250 meters by
500 meters to maximize the area of the enclosed plot.
Question 8
Question
A company traditionally produces two types of products: Product A and Prod-
uct B. Product A generates a profit of 5perunitsold, whileP roductBgeneratesaprof itof8
per unit sold. The company has limited resources and can only produce a total
of 200 units of both products combined. Additionally, they can only produce
60 units of Product A due to manufacturing constraints. If the company wants
to maximize their profit, how many units of each product should they produce?
Solution
Step 1: Define the variables. Let xbe the number of units of Product A
produced and ybe the number of units of Product B produced.
Step 2: Write the objective function. The company’s objective is to maxi-
mize profit, given by P= 5x+ 8y.
Step 3: Write the constraints. - The total number of units of both products
produced cannot exceed 200: x+y≤200. - The number of units of Product A
produced cannot exceed 60: x≤60.
Step 4: Draw the feasible region by graphing the constraints. - Note that
x≥0 and y≥0. - Graph the lines x+y= 200 and x= 60.
Step 5: Find the vertices of the feasible region. - The vertices are where the
lines intersect. - Vertices: (60,140), (60,140), (0,200).
7
Step 6: Evaluate the objective function at each vertex. - Evaluate P=
5x+ 8yat each vertex: - (60,140) →P= 5(60) + 8(140) = 1320 - (60,140) →
P= 5(60) + 8(140) = 1320 - (0,200) →P= 5(0) + 8(200) = 1600
Step 7: Determine the maximum profit. - The maximum profit occurs at
the vertex (0,200) with a profit of 1600.
Therefore, the company should produce 0 units of Product A and 200 units
of Product B to maximize their profit.
Question 9
Question
A company manufactures and sells two types of products: Product A and Prod-
uct B. Each unit of Product A requires 3 hours of labor and 2 hours of machine
time to produce, while each unit of Product B requires 2 hours of labor and
1 hour of machine time. The company has 150 hours of labor and 100 hours
of machine time available each day. If the profit per unit for Product A is
$
50
and for Product B is
$
30, how many units of each product should the company
produce to maximize its profit?
Solution
Step 1: Define the variables.
Let xbe the number of units of Product A produced, and let ybe the number
of units of Product B produced.
Step 2: Write the objective function.
The objective is to maximize the total profit. The total profit (P) is given by:
P= 50x+ 30y
Step 3: Write the constraints.
The constraints are the labor and machine time available each day.
Labor Constraint: 3x+ 2y≤150
Machine Time Constraint: 2x+y≤100
Step 4: Plot the feasible region.
Plot the lines representing the constraints and shade the feasible region that
satisfies all constraints.
Step 5: Find the corner points of the feasible region.
Solve the system of inequalities to find the corner points of the feasible region.
Step 6: Evaluate the objective function at each corner point.
8
Calculate the total profit at each corner point:
Corner Point 1: (0,0) ⇒P= 0
Corner Point 2: (0,100) ⇒P= 3000
Corner Point 3: (50,0) ⇒P= 2500
Corner Point 4: (25,50) ⇒P= 2750
Step 7: Determine the optimal solution.
The maximum profit of
$
2750 is achieved when the company produces 25 units
of Product A and 50 units of Product B.
Question 10
Question
A company produces two types of products, A and B. Producing each unit of
product A requires 2 hours of labor, 3 hours of machine time, and yields a profit
of
$
20. Producing each unit of product B requires 4 hours of labor, 1 hour of
machine time, and yields a profit of
$
15. The company has 200 hours of labor
and 90 hours of machine time available each week. How many units of each
product should the company produce to maximize profit?
Solution
Let xbe the number of units of product A produced, and ybe the number of
units of product B produced.
Step 1: Determine the objective function. The total profit can be repre-
sented as the sum of the profits from product A and product B:
Total profit = 20x+ 15y
Step 2: Determine the constraints. The constraints are based on the avail-
able labor and machine time:
2x+ 4y≤200 (Labor constraint)
3x+y≤90 (Machine time constraint)
Step 3: Set up the optimization problem. Now, we want to maximize the
total profit subject to the constraints:
Maximize Z= 20x+ 15y
subject to the constraints:
2x+ 4y≤200
3x+y≤90
x≥0, y ≥0
9
Step 4: Solve the linear programming problem. Solving the linear program-
ming problem, we find the optimal solution to be x= 20 units of product A
and y= 15 units of product B.
Therefore, the company should produce 20 units of product A and 15 units
of product B to maximize profit.
Question 11
Question
A company produces two types of products, Product A and Product B. Each
unit of Product A yields a profit of
$
20, while each unit of Product B yields a
profit of
$
30. The company has a limited supply of 500 units of plastic and 300
units of metal. Producing one unit of Product A requires 2 units of plastic and
1 unit of metal, while producing one unit of Product B requires 1 unit of plastic
and 2 units of metal. How many units of each product should the company
produce to maximize its total profit?
Solution
Step 1: Define the decision variables: Let xbe the number of units of Product
A to produce, and let ybe the number of units of Product B to produce.
Step 2: Write the objective function: The total profit function, P(x, y), that
the company wants to maximize is given by:
P(x, y) = 20x+ 30y
Step 3: Write the constraints: The constraints are the limited supply of
plastic and metal:
2x+y≤500 (Plastic constraint)
x+ 2y≤300 (Metal constraint)
Step 4: Find the feasible region: Graph the inequalities to find the feasible
region where the constraints are satisfied.
Step 5: Find the vertices of the feasible region: Solve the equations of the
lines that intersect at the vertices of the feasible region.
Step 6: Evaluate the objective function at each vertex: Calculate P(x, y) for
each vertex to find the maximum total profit.
Step 7: Make a conclusion: Determine how many units of each product the
company should produce to maximize its total profit.
10
Question 12
Question
A company produces two types of products, xand y, which are sold for
$
30
and
$
40 per unit, respectively. The company’s total production capacity is 500
units per day. Production of product xrequires 2 hours of labor per unit and
product yrequires 3 hours of labor per unit. The company has 800 labor hours
available per day. How many units of each product should the company produce
to maximize its daily revenue?
Solution
Let’s denote the number of units of product xproduced per day as a, and
the number of units of product yproduced per day as b. The objective is to
maximize the revenue function:
R(a, b) = 30a+ 40b
Subject to the constraints:
a+b≤500 (total production capacity)
2a+ 3b≤800 (labor hours available)
a, b ≥0 (non-negativity)
To solve this optimization problem, we will first find the corner points of the
feasible region and then evaluate the objective function at each corner point to
determine the maximum revenue.
Step 1: Find corner points To find the corner points, we need to solve the
system of inequalities. The corner points are the intersections of the boundary
lines.
Step 2: Check the boundary:
When a= 0, from a+b≤500, we have b= 500.
When b= 0, from a+b≤500, we have a= 500.
When b= 0, from 2a+ 3b≤800, we have a= 400.
When a= 0, from 2a+ 3b≤800, we have b= 800/3.
Step 3: Evaluate the objective function at each corner point
Corner point 1: (0,500)
Revenue R(0,500) = 30(0) + 40(500) = $20000
Corner point 2: (500,0)
Revenue R(500,0) = 30(500) + 40(0) = $15000
11
Corner point 3: (400,0)
Revenue R(400,0) = 30(400) + 40(0) = $12000
Corner point 4: (0,800/3)
Revenue R(0,800/3) = 30(0) + 40(800/3) ≈$10667
Thus, the maximum revenue of
$
20000 can be achieved by producing 500
units of product yand no units of product x.
Question 13
Question
A manufacturer produces two types of smartphones, A and B. It costs
$
50 to
produce each unit of type A and
$
80 to produce each unit of type B. The
manufacturer can sell type A for
$
120 each and type B for
$
150 each. The
manufacturer has a budget of
$
8000 for production costs and can sell at most
120 units. How many units of each type should the manufacturer produce to
maximize profit?
Solution
Step 1: Define the variables. Let xbe the number of units of type A produced
and sold, and let ybe the number of units of type B produced and sold.
Step 2: Write the constraints based on the information given: - Production
cost constraint: 50x+ 80y≤8000 - Demand constraint: x+y≤120 - Non-
negativity constraint: x≥0, y≥0
Step 3: Write the objective function to maximize profit. The profit function
is the revenue minus the production cost: P(x, y) = 120x+150y−(50x+80y) =
70x+ 70y
Step 4: Combine the constraints and objective function to form the linear
programming problem: Maximize P(x, y) = 70x+ 70ySubject to: 50x+ 80y≤
8000 x+y≤120 x≥0, y≥0
Step 5: Solve the linear programming problem. To find the maximum profit,
we need to graph the feasible region formed by the constraints and then find
the corner points.
The corner points are: (0, 0), (0, 100), (96, 24), and (120, 0).
Step 6: Calculate the profit at each corner point: - (0, 0): P(0,0) = 0 - (0,
100): P(0,100) = 0 - (96, 24): P(96,24) = 70(96) + 70(24) = 6720 - (120, 0):
P(120,0) = 70(120) + 70(0) = 8400
Step 7: The maximum profit of
$
8400 is achieved when the manufacturer
produces 120 units of type A and 0 units of type B.
12
Question 14
Question
A company produces two types of products, A and B, using machines X and Y.
Each unit of product A requires 2 hours of machine X and 1 hour of machine
Y. Each unit of product B, on the other hand, requires 1 hour of machine X
and 3 hours of machine Y. Machine X can operate for a maximum of 40 hours
a week, while machine Y can operate for a maximum of 30 hours a week. If the
profit from each unit of product A is
$
30 and each unit of product B is
$
40,
how many units of each should the company produce to maximize profit?
Solution
Let’s denote the number of units of product A produced as xand the number
of units of product B produced as y. The objective is to maximize the profit,
which can be represented by the function P(x, y) = 30x+ 40y.
We also have the following constraints based on the available machine hours:
Machine X constraint: 2x+y≤40
Machine Y constraint: x+ 3y≤30
Non-negativity constraint: x, y ≥0
The feasible region for this problem is the intersection of the shaded regions
defined by the constraints.
Now, we need to find the corner points of the feasible region by solving the
system of equations formed by the boundaries of the constraints.
When 2x+y= 40 and x+ 3y= 30, we get x= 15 and y= 10. This gives
us the point (15,10).
When 2x+y= 40 and x= 0, we get y= 40. This gives us the point
(0,40).
When x+ 3y= 30 and y= 0, we get x= 30. This gives us the point
(30,0).
Next, we evaluate the profit function at each of these corner points to deter-
mine the optimal solution.
At (15,10): P(15,10) = 30(15) + 40(10) = 450 + 400 = 850
At (0,40): P(0,40) = 30(0) + 40(40) = 0 + 1600 = 1600
At (30,0): P(30,0) = 30(30) + 40(0) = 900 + 0 = 900
Therefore, the company should produce 15 units of product A and 10 units
of product B to maximize profit at
$
850.
13
Question 15
Question
A company manufactures two products, Product Aand Product B. The profit
per unit for Product Ais
$
20 and for Product Bis
$
30. Each unit of Product A
requires 3 hours of labor and 2 hours of machine time, while each unit of Product
Brequires 4 hours of labor and 3 hours of machine time. The company has 360
hours of labor and 240 hours of machine time available per week. How many
units of each product should the company produce in order to maximize their
profit?
Solution
Step 1: Let’s define our variables: - Let xbe the number of units of Product A
to produce. - Let ybe the number of units of Product Bto produce.
Step 2: Write the objective function: The total profit Pis given by:
P= 20x+ 30y
Step 3: Write the constraints based on the available hours of labor and
machine time: The labor constraint is:
3x+ 4y≤360
The machine time constraint is:
2x+ 3y≤240
Step 4: Transform the inequalities into equations to find the corner points:
- Solving 3x+ 4y= 360 and 2x+ 3y= 240 gives the corner points: (80,60),
(120,40), and (0,80).
Step 5: Calculate the profit at each corner point: - For (80,60): P= 20(80)+
30(60) = 2600 - For (120,40): P= 20(120) + 30(40) = 3200 - For (0,80):
P= 20(0) + 30(80) = 2400
Step 6: Determine the maximum profit: The maximum profit is
$
3200 when
the company produces 120 units of Product Aand 40 units of Product B.
Question 16
Question
A company manufactures two types of products, A and B. Each unit of product
A requires 3 hours of labor and 2 hours of machine time, while each unit of prod-
uct B requires 2 hours of labor and 4 hours of machine time. The company has
120 hours of labor available and 160 hours of machine time available each day.
Each unit of product A generates a profit of 30, whileeachunitof productBgeneratesaprofitof40.
How many units of each product should the company produce each day to max-
imize profit?
14
Solution
Step 1: Assign variables to represent the unknowns. Let xbe the number of
units of product A produced daily, and let ybe the number of units of product
B produced daily.
Step 2: Write the constraints based on the available labor and machine time:
3x+ 2y≤120 (labor constraint)
2x+ 4y≤160 (machine time constraint)
Step 3: Write the objective function to maximize profit:
Maximize Z= 30x+ 40y
Step 4: Graph the feasible region determined by the constraints. First, solve
the labor constraint for y:
y≤60 −3
2x
Then, solve the machine time constraint for y:
y≤40 −1
2x
Step 5: Calculate the corner points of the feasible region by solving the
equations simultaneously. The corner points are:
A(0,0), B(0,40), C(20,20), D(30,0)
Step 6: Evaluate the objective function at each corner point:
ZA= 30(0) + 40(0) = 0
ZB= 30(0) + 40(40) = 1600
ZC= 30(20) + 40(20) = 1400
ZD= 30(30) + 40(0) = 900
Step 7: Compare the values of the objective function at each corner point.
The maximum profit of 1600isachievedatpointB(0,40).
Step 8: Therefore, the company should produce 0 units of product A and 40
units of product B daily to maximize profit.
Question 17
Question
A company produces two types of products, Product A and Product B. Each
unit of Product A yields a profit of 120, whileeachunitof P roductByieldsaprof itof150.
The production of Product A requires 2 labor-hours and 3 machine-hours, while
the production of Product B requires 4 labor-hours and 2 machine-hours. The
company has 100 labor-hours and 80 machine-hours available in a week. How
many units of each product should the company produce to maximize its profit?
15
Solution
Step 1: Define the variables. Let xbe the number of units of Product A
produced and ybe the number of units of Product B produced. We want to
maximize the profit P, which is given by the equation P= 120x+ 150y.
Step 2: Write the constraints. The labor-hours constraint is given by 2x+
4y≤100 and the machine-hours constraint is given by 3x+ 2y≤80.
Step 3: Set up the objective function and constraints. The optimization
problem can be formulated as follows:
Maximize P= 120x+ 150y
subject to
2x+ 4y≤100
3x+ 2y≤80
x≥0, y ≥0
Step 4: Solve the linear programming problem. We can graph the feasible
region determined by the constraints and find the corner points where the max-
imum profit occurs. The corner points are: - (0,0) - 0,40
3- (20,0) - (16,12)
Step 5: Evaluate the objective function at each corner point: - At (0,0):
P= 0 - At 0,40
3:P= 2000 - At (20,0): P= 2400 - At (16,12): P= 2880
Step 6: Determine the maximum profit. The company should produce 16
units of Product A and 12 units of Product B to maximize its profit, yielding a
profit of 2880.
Question 18
Question
A company produces two products: Product A and Product B. It costs
$
5 to
produce each unit of Product A and
$
8 to produce each unit of Product B. The
company can sell Product A for
$
12 per unit and Product B for
$
15 per unit.
The company has a budget of
$
600 for production costs. If the company wants
to maximize its profit, how many units of each product should they produce?
Solution
Step 1: Define the variables. Let xbe the number of units of Product A
produced and ybe the number of units of Product B produced.
Step 2: Write the constraints. - Production cost constraint: 5x+ 8y≤600
(budget constraint) - Non-negativity constraint: x≥0, y≥0
Step 3: Write the objective function. The profit function is given by P=
12x+ 15y.
Step 4: Set up the optimization problem. Maximize P= 12x+ 15ysubject
to the constraints: 1. 5x+ 8y≤600 2. x≥0, y≥0
16
Step 5: Solve the optimization problem using the corner point method or
graphical method.
The corner points of the feasible region are the intersection points of the
constraint lines. Solving the system of equations:
(5x+ 8y= 600
y= 0
We find the corner points: - (0,75) - (120,0) - (96,30)
Step 6: Evaluate the objective function at each corner point. 1. For point
(0, 75): P= 12(0)+15(75) = 1125 2. For point (120, 0): P= 12(120)+15(0) =
1440 3. For point (96, 30): P= 12(96) + 15(30) = 1410
Step 7: Determine the maximum profit. The maximum profit occurs at
the point (120, 0) where x= 120 and y= 0. Therefore, the company should
produce 120 units of Product A and 0 units of Product B to maximize its profit.
Question 19
Question
A company produces two types of souvenirs: mugs and keychains. The pro-
duction of each mug requires 2 hours of labor and 3 hours of machine time,
while each keychain requires 1 hour of labor and 2 hours of machine time. The
company has 300 hours of labor and 400 hours of machine time available per
week. Each mug sold yields a profit of
$
5 and each keychain sold yields a profit
of
$
3. How many mugs and keychains should the company produce each week
to maximize its profit?
Solution
Step 1: Define the variables. Let xbe the number of mugs produced per week
and ybe the number of keychains produced per week.
Step 2: Write the constraints based on the available labor and machine time:
2x+y≤300 (Labor constraint)
3x+ 2y≤400 (Machine time constraint)
Step 3: Write the objective function to maximize profit:
Maximize Z= 5x+ 3y
Step 4: Plot the feasible region determined by the constraints.
17
Step 5: Calculate the coordinates of the corner points of the feasible region:
Corner 1: (0,150)
Corner 2: (0,200)
Corner 3: (100,100)
Corner 4: (133.33,66.66)
Corner 5: (150,0)
Step 6: Evaluate the objective function at each corner point:
Z(0,150) = 450
Z(0,200) = 600
Z(100,100) = 800
Z(133.33,66.66) ≈800
Z(150,0) = 750
Step 7: Determine the maximum value of the objective function: The maxi-
mum profit of
$
800 is achieved when 100 mugs and 100 keychains are produced
per week.
Question 20
Question
A manufacturing company produces two types of products: product A and
product B. Each unit of product A requires 2 hours of labor and 1 hour of
machine time, while each unit of product B requires 1 hour of labor and 2 hours
of machine time. The profit earned per unit of product A is
$
30 and for product
B is
$
40. If the company has 100 hours of labor and 80 hours of machine time
available per week, how many units of each product should be produced to
maximize profit?
Solution
Step 1: Define the variables. Let xbe the number of units of product A pro-
duced, and let ybe the number of units of product B produced.
Step 2: Write the objective function. The profit function can be represented
as:
P(x, y) = 30x+ 40y
Step 3: Write the constraints. The constraints are the available hours of
labor and machine time:
2x+y≤100
x+ 2y≤80
18
Step 4: Non-negativity constraints. Since the number of units produced
cannot be negative:
x≥0, y ≥0
Step 5: Set up the system of inequalities. The problem can be formulated
as the following linear programming problem: Maximize P(x, y) = 30x+ 40y
subject to the constraints:
2x+y≤100
x+ 2y≤80
x≥0, y ≥0
Step 6: Solve the system of inequalities using the graphical method or sim-
plex method to find the values of xand ythat maximize the profit function
P.
Step 7: The optimal solution is to produce 40 units of product A (x = 40)
and 20 units of product B (y = 20) to maximize the profit to
$
2000 per week.
Question 21
Question
A company produces two products, A and B. The profit from each unit of
product A is
$
10, and the profit from each unit of product B is
$
15. Product A
requires 2 hours of labor to produce, while product B requires 3 hours of labor.
The company has 50 hours of labor available each day. How many units of each
product should the company produce to maximize profit?
Solution
Step 1: Define the variables. Let xbe the number of units of product A pro-
duced, and let ybe the number of units of product B produced.
Step 2: Write the objective function. The total profit can be represented as
P= 10x+ 15y
Step 3: Write the constraint equations. The labor constraint is given by
2x+ 3y≤50
Step 4: Non-negativity constraints. Since the number of units cannot be
negative, we have
x≥0, y ≥0
Step 5: Set up the system. We now have the following linear programming
problem: Maximize P= 10x+ 15ysubject to
2x+ 3y≤50
x≥0
y≥0
19
Step 6: Solve the system. We can graph the feasible region and find the
corner points to determine the maximum profit.
The corner points are: (0, 0), (0, 16.67), (25, 0), (20, 10), and (0, 10).
Calculating the profit at each corner point: (0, 0): 10(0) + 15(0) = $0 (0,
16.67): 10(0) + 15(16.67) = $250.05 (25, 0): 10(25) + 15(0) = $250 (20, 10):
10(20) + 15(10) = $250 (0, 10): 10(0) + 15(10) = $150
Therefore, the maximum profit of
$
250 can be achieved by producing 25
units of product A and 0 units of product B.
Question 22
Question
A company manufactures two types of products, A and B. It takes 2 hours to
produce one unit of product A and 3 hours to produce one unit of product B.
The company has a total of 160 hours of production time available each week.
If the profit from each unit of product A is
$
50 and the profit from each unit of
product B is
$
60, how many units of each product should the company produce
in order to maximize its profit?
Solution
Step 1: Define the variables. Let xbe the number of units of product A produced
and let ybe the number of units of product B produced.
Step 2: Write the objective function. The profit function, P(x, y), can be
expressed as:
P(x, y) = 50x+ 60y
Step 3: Write the constraint equation. The constraint is based on the total
production time available each week:
2x+ 3y≤160
Step 4: Set up the optimization problem. We want to maximize the profit
function subject to the constraint equation:
Maximize P(x, y) = 50x+ 60y
Subject to 2x+ 3y≤160
Step 5: Solve the optimization problem using the constraint equation. The
solution can be found at the intersection of the constraint equation and the
non-negative region:
2x+ 3y= 160
y=160 −2x
3
20
Step 6: Find the critical points. To find the critical points, we take the
partial derivatives of the profit function and set them equal to zero:
∂P
∂x = 50 = 0 ⇒No critical point for x
∂P
∂y = 60 + 160 −2x
3= 0
60 + 160 −2x
3= 0
180 + 160 −2x= 0
−2x=−340
x= 170
Step 7: Analyze the critical point. The critical point x= 170 is invalid since
the production time constraint is violated.
Step 8: Determine the valid vertex points. The valid vertex points are found
by evaluating the profit function at the corners of the feasible region. The
corners are (0, 0), (0, 53.33), and (80, 20).
Step 9: Evaluate the profit function at each vertex point.
P(0,0) = 50(0) + 60(0) = 0
P(0,53.33) = 50(0) + 60(53.33) = 3199.8
P(80,20) = 50(80) + 60(20) = 5400
Step 10: Determine the optimal production plan. The company should
produce 80 units of product A and 20 units of product B to maximize its profit,
with a total profit of
$
5400.
Question 23
Question
A company produces two types of smartphones: Model X and Model Y. The
profit from each Model X sold is
$
200, while the profit from each Model Y sold is
$
300. The company can produce up to 400 units of Model X per month and up
to 300 units of Model Y per month. The company estimates that the demand
for Model X is at most 200 units per month and the demand for Model Y is at
most 150 units per month. How many units of each model should the company
produce and sell each month to maximize profit?
21
Solution
Step 1: Let’s define our variables: - Let xrepresent the number of units of
Model X produced and sold per month. - Let yrepresent the number of units
of Model Y produced and sold per month.
Step 2: We need to set up the constraints based on the production limits and
demand: - Production constraint for Model X: x≤400 - Production constraint
for Model Y: y≤300 - Demand constraint for Model X: x≤200 - Demand
constraint for Model Y: y≤150
Step 3: The objective function is to maximize profit: - The total profit P
can be expressed as: P= 200x+ 300y
Step 4: We need to find the feasible region by graphing the constraints
on a coordinate plane. The feasible region will be the intersection of all the
constraints.
Step 5: The feasible region formed by the constraints will be a polygon with
vertices at the intersections of the lines that represent the constraints.
Step 6: Identify the vertices of the feasible region: - Vertices are the points
where the lines intersect. We have four vertices: (0,0), (200,0), (200,150), and
(400,0).
Step 7: Evaluate the objective function at each vertex to find the maximum
profit: - P(0,0) = 0 - P(200,0) = 200(200) + 300(0) = 40000 - P(200,150) =
200(200) + 300(150) = 80000 - P(400,0) = 200(400) + 300(0) = 80000
Step 8: Compare the profits at each vertex to determine the maximum profit:
- The maximum profit of
$
80,000 can be achieved when producing and selling
200 units of Model X and 150 units of Model Y.
Question 24
Question
A farmer wants to build a rectangular pen for his animals using 400 meters
of fencing. If he wants to maximize the area of the pen, what should be the
dimensions of the pen?
Solution
Step 1: Let xbe the width and ybe the length of the rectangular pen.
Step 2: The perimeter of the rectangular pen is given by 2x+ 2y= 400.
Step 3: Solving for one of the variables, we get y= 200 −x.
Step 4: The area of the rectangular pen can be expressed as A=xy.
Step 5: Substitute the equation for yinto the area formula: A=x(200−x) =
200x−x2.
Step 6: To maximize the area, we need to find the critical points. Take the
derivative of the area function: dA
dx = 200 −2x.
Step 7: Set the derivative equal to 0 to find critical points: 200−2x= 0 =⇒
x= 100.
22
Step 8: To check if it is a maximum or minimum, we use the second derivative
test. Taking the second derivative of the area function gives d2A
dx2=−2 which is
less than 0, confirming it is a maximum.
Step 9: Therefore, when x= 100, the width is 100 meters and the length is
200 −100 = 100 meters.
Step 10: The dimensions of the rectangular pen that maximizes the area are
100 meters by 200 meters.
Question 25
Question
A farmer wants to fence off a rectangular area of land along a riverbank. He has
200 meters of fencing material and wants to enclose the largest possible area.
One side of the rectangle will be bordered by the river, so no fencing is needed
on that side. What dimensions should the farmer use for the fenced area?
Solution
Step 1: Let xbe the width of the fenced area parallel to the riverbank, and let
ybe the length perpendicular to the riverbank.
Step 2: The farmer has 200 meters of fencing material, so the total length
of fencing required would be 2x+y.
Step 3: Since one side of the rectangle is bordered by the river, the total
length of fencing would be 2x+y= 200.
Step 4: We want to maximize the area of the fenced area, which is given by
A=xy.
Step 5: We can express the area in terms of a single variable using the
constraint 2x+y= 200. Rewrite yas y= 200 −2x.
Step 6: Substitute y= 200 −2xinto A=xy to get A=x(200 −2x).
Step 7: Rewrite the equation as a quadratic function of A:A= 200x−2x2.
Step 8: To find the maximum area, we need to find the critical points by
taking the derivative of Awith respect to xand setting it equal to 0.
dA
dx = 200 −4x= 0
Step 9: Solve for xto find the critical point: 200 −4x= 0 ⇒x= 50.
Step 10: Now that we have x= 50, we can find yusing 2x+y= 200 ⇒
2(50) + y= 200 ⇒y= 100.
Step 11: Therefore, the dimensions that the farmer should use for the fenced
area are 50 meters by 100 meters to enclose the largest possible area.
23
Question 26
Question
A company manufactures two types of products, Product A and Product B.
Each unit of Product A requires 3 hours of labor and 2 units of raw material,
while each unit of Product B requires 4 hours of labor and 1 unit of raw material.
The company has 120 hours of labor and 40 units of raw material available. The
profit per unit of Product A is
$
30 and the profit per unit of Product B is
$
40.
How many units of each product should the company produce to maximize its
profit?
Solution
Let xbe the number of units of Product A and ybe the number of units of
Product B produced.
Step 1: Write the objective function and constraint equations. The objec-
tive is to maximize the profit:
Z= 30x+ 40y
Subject to constraints:
3x+ 4y≤120
2x+y≤40
x≥0, y ≥0
Step 2: Solve the system of inequalities to find the feasible region. We
graph the inequalities 3x+ 4y≤120 and 2x+y≤40 to find the feasible region.
Step 3: Find the vertices of the feasible region. The vertices of the fea-
sible region are the points of intersection of the lines obtained by solving the
inequalities.
Step 4: Calculate the profit at each vertex. Plug the values of xand yfrom
each vertex into the objective function Z= 30x+ 40yto find the profit at each
vertex.
Step 5: Identify the vertex that gives the maximum profit. Compare the
profits calculated in Step 4 to find the vertex that maximizes the profit.
Therefore, the company should produce a certain number of units of Product
A and Product B to maximize its profit.
Question 27
Question
A company manufactures two types of bookshelves, A and B. Each type A shelf
requires 4 hours of labor and 2 hours of carpentry work, while each type B shelf
requires 3 hours of labor and 3 hours of carpentry work. The company has a
24
total of 40 hours of labor and 30 hours of carpentry work available each week.
Shelf A sells for
$
150 and shelf B sells for
$
120. How many of each type of shelf
should the company produce to maximize profits?
Solution
Let xbe the number of type A shelves and ybe the number of type B shelves
produced.
Step 1: Write the constraints based on the available labor and carpen-
try work. The labor constraint is 4x+ 3y≤40 (total available labor hours
each week), and the carpentry work constraint is 2x+ 3y≤30 (total available
carpentry work hours each week).
Step 2: Write the objective function. The objective is to maximize profit,
which can be expressed as P(x, y) = 150x+ 120y.
Step 3: Find the corner points of the feasible region by solving the system
of inequalities. Solving the system of inequalities:
(4x+ 3y≤40
2x+ 3y≤30
we get corner points at (0,10),(5,10),and (7.5,5).
Step 4: Evaluate the objective function at each corner point. The profit
at (0,10) is P(0,10) = 150(0) + 120(10) = $1200. The profit at (5,10) is
P(5,10) = 150(5) + 120(10) = $1950. The profit at (7.5,5) is P(7.5,5) =
150(7.5) + 120(5) = $1650.
Step 5: Decide on the optimal solution. To maximize profit, the company
should produce 5 type A shelves and 10 type B shelves, resulting in a maximum
profit of
$
1950.
Question 28
Question
A company produces two types of products, Aand B, which both require re-
sources in order to be manufactured. Product Arequires 3 units of resource X
and 5 units of resource Yper unit produced, while product Brequires 4 units
of resource Xand 6 units of resource Yper unit produced. The company has at
most 120 units of resource Xand 180 units of resource Yavailable for produc-
tion. If the profit for each unit of product Ais 10andforeachunitofproductB is
15, howmanyunitsofeachproductshouldthecompanyproducetomaximizeitsprof it?
Solution
Let xbe the number of units of product Aproduced and ybe the number of
units of product Bproduced.
25
Step 1: Set up the objective function to be maximized. The total profit,
P, can be expressed as:
P= 10x+ 15y
Step 2: Set up the constraints based on the available resources. The con-
straints are the limits on the amount of resources Xand Yavailable for pro-
duction.
For resource X: 3x+ 4y≤120
For resource Y: 5x+ 6y≤180
Non-negativity constraints: x≥0 and y≥0
Step 3: Set up the appropriate inequalities based on the constraints:
3x+ 4y≤120
5x+ 6y≤180
x≥0
y≥0
Step 4: Convert the inequalities into equalities for easier visualization (to
find the corner points). For the first constraint:
3x+ 4y= 120 =⇒y= 30 −3x
4
For the second constraint:
5x+ 6y= 180 =⇒y= 30 −5x
6
The corners are at the intersections of these lines within the feasible region.
Step 5: Find the corner points and calculate the profit at each corner. The
corner points are obtained by solving the system of equations formed by the
intersecting constraint lines.
The corner points are: (0,30),(24,0),(28,10)
Calculate the profit at each corner:
At (0, 30): P= 10(0) + 15(30) = 450
At (24, 0): P= 10(24) + 15(0) = 240
At (28, 10): P= 10(28) + 15(10) = 370
Step 6: Determine the optimal solution. The maximum profit of 450isachievedatthepoint(0,30)whichmeansthecompanyshouldproduce30unitsofproductB
and 0 units of product A.
26
Question 29
Question
A company manufactures two types of products, Product A and Product B.
The company’s production process for Product A requires 3 hours of labor and
4 hours of machine time, while Product B requires 2 hours of labor and 5 hours
of machine time. The company has a total of 60 hours of labor and 80 hours of
machine time available per week. If the profit for each unit of Product A is
$
10
and for each unit of Product B is
$
8, how many units of each product should
the company produce to maximize their profit?
Solution
Step 1: Define the variables. Let xbe the number of units of Product A
produced and ybe the number of units of Product B produced.
Step 2: Write the objective function. The total profit, P, is given by:
P= 10x+ 8y
Step 3: Write the constraints based on the available labor and machine time.
The constraints are:
3x+ 2y≤60 (Labor constraint)
4x+ 5y≤80 (Machine time constraint)
Step 4: Non-negativity constraint. Since the number of units produced
cannot be negative, we have:
x≥0, y ≥0
Step 5: Graph the feasible region formed by the constraints. To find the
vertices of the feasible region, solve the system of inequalities:
(3x+ 2y= 60
4x+ 5y= 80
Solving, we find the points of intersection to be: (0,30), (8,12), (20,0).
Step 6: Evaluate the objective function at each vertex to determine the
maximum profit:
P(0,30) = 10(0) + 8(30) = 240
P(8,12) = 10(8) + 8(12) = 176
P(20,0) = 10(20) + 8(0) = 200
Step 7: Therefore, the number of units of each product the company should
produce to maximize profit is 8 units of Product A and 12 units of Product B,
resulting in a profit of
$
176.
27
Question 30
Question
A company produces two types of products, Xand Y, using two machines,
Machine 1 and Machine 2. Producing one unit of Xrequires 3 hours on Machine
1 and 2 hours on Machine 2, while producing one unit of Yrequires 2 hours
on Machine 1 and 1 hour on Machine 2. Each unit of Xyields a profit of
$
10,
while each unit of Yyields a profit of
$
8. Machine 1 is available for 20 hours
per day, and Machine 2 is available for 12 hours per day.
Formulate and solve a linear programming problem to determine how many
units of Xand Ythe company should produce each day to maximize their
profit.
Solution
Step 1: Define the decision variables: Let xbe the number of units of product
Xto produce each day, and ybe the number of units of product Yto produce
each day.
Step 2: Write the objective function: The objective is to maximize the profit.
The total profit Pcan be expressed as:
P= 10x+ 8y
Step 3: Write the constraints: - Machine 1 time constraint: 3 hours of
Machine 1 per unit of Xand 2 hours per unit of Ymust not exceed 20 hours
available each day:
3x+ 2y≤20
- Machine 2 time constraint: 2 hours of Machine 2 per unit of Xand 1 hour per
unit of Ymust not exceed 12 hours available each day:
2x+y≤12
- Non-negativity constraints:
x≥0, y ≥0
Step 4: Solve the linear programming problem using the simplex method or
graphically to find the optimal values of xand ythat maximize the profit.
28
Question 5
Question
A company produces two types of products: chairs and tables. The profit per
chair is $30 and the profit per table is $50. Each chair requires 3 units of wood
and 2 units of labor to produce, while each table requires 4 units of wood and
5 units of labor to produce. The company has a total of 300 units of wood and
220 units of labor available. How many chairs and tables should the company
produce to maximize its profit?
Solution
Step 1: Define the variables.
Let xbe the number of chairs produced and ybe the number of tables produced.
Step 2: Write the objective function.
The objective is to maximize the profit, which is given by P= 30x+ 50y.
Step 3: Write the constraints.
We are limited by the amount of wood and labor available:
(3x+ 4y≤300
2x+ 5y≤220
Step 4: Solve the system of inequalities.
Plot the inequalities on a graph to find the feasible region and then find the
vertices of this region.
Step 5: Find the vertices of the feasible region.
The vertices of the feasible region after plotting are (0,0),(0,60),(40,40),(75,0).
Step 6: Evaluate the profit function at each vertex.
Vertex (x, y) Profit
(0,0) 0 0
(0,60) 0 3000
(40,40) 3200 4000
(75,0) 2250 3750
Step 7: Decide the optimal production quantities.
The company should produce 40 chairs and 40 tables to maximize its profit.
Question 6
Question
A company manufactures two types of products, Product A and Product B.
The company can produce up to 80 units of Product A and 60 units of Product
B per day. It is estimated that Product A requires 3 hours of labor and Product
B requires 2 hours of labor to manufacture. The company has a total of 180
5
hours of labor available per day. Each unit of Product A yields a profit of
$
50,
while each unit of Product B yields a profit of
$
60. How many units of each
product should the company produce to maximize its daily profit?
Solution
Let xbe the number of units of Product A to be produced, and ybe the number
of units of Product B to be produced.
Step 1: Write the objective function and constraints The objective
is to maximize the profit, which is given by P= 50x+ 60y.
The constraints are: - Labor constraint: 3x+ 2y≤180 - Production con-
straint for Product A: x≤80 - Production constraint for Product B: y≤60
Step 2: Graph the feasible region To graph the feasible region, we plot
the lines 3x+ 2y= 180, x= 80, and y= 60, and shade the region that satisfies
all constraints.
Step 3: Find the corner points of the feasible region The corner
points of the feasible region are the intersections of the lines, which are: - Point
A(0,0) - Point B(0,60) - Point C(60,0) - Point D(60,30)
Step 4: Evaluate the objective function at each corner point - Point
A:P(0,0) = 50(0) + 60(0) = 0 - Point B:P(0,60) = 50(0) + 60(60) = 3600
- Point C:P(60,0) = 50(60) + 60(0) = 3000 - Point D:P(60,30) = 50(60) +
60(30) = 4200
Step 5: Determine the maximum profit Since the maximum profit
occurs at Point D(60,30), the company should produce 60 units of Product A
and 30 units of Product B to maximize its daily profit. The maximum profit is
P= $4200.
Question 7
Question
A farmer wants to enclose a rectangular plot of land that lies along a river with
1000 meters of fencing. If the side along the river does not need to be fenced,
what dimensions should the farmer choose to maximize the area of the enclosed
plot?
Solution
Let’s denote the length of the plot as xmeters and the width as ymeters.
Since we are not fencing the side along the river, the fencing required will be
2x+y= 1000 =⇒y= 1000 −2x. The area of the rectangular plot is given by
A=x·y=x(1000 −2x).
Step 1: Express the area Asolely in terms of x.
A=x(1000 −2x) = 1000x−2x2
6
Step 2: To maximize the area, find the critical points by setting the deriva-
tive of Awith respect to xequal to 0.
dA
dx = 1000 −4x
1000 −4x= 0
x=1000
4= 250
Step 3: To confirm that x= 250 yields the maximum area, we will perform
the second derivative test. d2A
dx2=−4<0
Since the second derivative is negative, x= 250 corresponds to a maximum
area.
Step 4: Calculate the corresponding width yusing y= 1000 −2x.
y= 1000 −2·250 = 500
Step 5: Therefore, the farmer should choose the dimensions 250 meters by
500 meters to maximize the area of the enclosed plot.
Question 8
Question
A company traditionally produces two types of products: Product A and Prod-
uct B. Product A generates a profit of 5perunitsold, whileP roductBgeneratesaprofitof8
per unit sold. The company has limited resources and can only produce a total
of 200 units of both products combined. Additionally, they can only produce
60 units of Product A due to manufacturing constraints. If the company wants
to maximize their profit, how many units of each product should they produce?
Solution
Step 1: Define the variables. Let xbe the number of units of Product A
produced and ybe the number of units of Product B produced.
Step 2: Write the objective function. The company’s objective is to maxi-
mize profit, given by P= 5x+ 8y.
Step 3: Write the constraints. - The total number of units of both products
produced cannot exceed 200: x+y≤200. - The number of units of Product A
produced cannot exceed 60: x≤60.
Step 4: Draw the feasible region by graphing the constraints. - Note that
x≥0 and y≥0. - Graph the lines x+y= 200 and x= 60.
Step 5: Find the vertices of the feasible region. - The vertices are where the
lines intersect. - Vertices: (60,140), (60,140), (0,200).
7
Step 6: Evaluate the objective function at each vertex. - Evaluate P=
5x+ 8yat each vertex: - (60,140) →P= 5(60) + 8(140) = 1320 - (60,140) →
P= 5(60) + 8(140) = 1320 - (0,200) →P= 5(0) + 8(200) = 1600
Step 7: Determine the maximum profit. - The maximum profit occurs at
the vertex (0,200) with a profit of 1600.
Therefore, the company should produce 0 units of Product A and 200 units
of Product B to maximize their profit.
Question 9
Question
A company manufactures and sells two types of products: Product A and Prod-
uct B. Each unit of Product A requires 3 hours of labor and 2 hours of machine
time to produce, while each unit of Product B requires 2 hours of labor and
1 hour of machine time. The company has 150 hours of labor and 100 hours
of machine time available each day. If the profit per unit for Product A is
$
50
and for Product B is
$
30, how many units of each product should the company
produce to maximize its profit?
Solution
Step 1: Define the variables.
Let xbe the number of units of Product A produced, and let ybe the number
of units of Product B produced.
Step 2: Write the objective function.
The objective is to maximize the total profit. The total profit (P) is given by:
P= 50x+ 30y
Step 3: Write the constraints.
The constraints are the labor and machine time available each day.
Labor Constraint: 3x+ 2y≤150
Machine Time Constraint: 2x+y≤100
Step 4: Plot the feasible region.
Plot the lines representing the constraints and shade the feasible region that
satisfies all constraints.
Step 5: Find the corner points of the feasible region.
Solve the system of inequalities to find the corner points of the feasible region.
Step 6: Evaluate the objective function at each corner point.
8
Calculate the total profit at each corner point:
Corner Point 1: (0,0) ⇒P= 0
Corner Point 2: (0,100) ⇒P= 3000
Corner Point 3: (50,0) ⇒P= 2500
Corner Point 4: (25,50) ⇒P= 2750
Step 7: Determine the optimal solution.
The maximum profit of
$
2750 is achieved when the company produces 25 units
of Product A and 50 units of Product B.
Question 10
Question
A company produces two types of products, A and B. Producing each unit of
product A requires 2 hours of labor, 3 hours of machine time, and yields a profit
of
$
20. Producing each unit of product B requires 4 hours of labor, 1 hour of
machine time, and yields a profit of
$
15. The company has 200 hours of labor
and 90 hours of machine time available each week. How many units of each
product should the company produce to maximize profit?
Solution
Let xbe the number of units of product A produced, and ybe the number of
units of product B produced.
Step 1: Determine the objective function. The total profit can be repre-
sented as the sum of the profits from product A and product B:
Total profit = 20x+ 15y
Step 2: Determine the constraints. The constraints are based on the avail-
able labor and machine time:
2x+ 4y≤200 (Labor constraint)
3x+y≤90 (Machine time constraint)
Step 3: Set up the optimization problem. Now, we want to maximize the
total profit subject to the constraints:
Maximize Z= 20x+ 15y
subject to the constraints:
2x+ 4y≤200
3x+y≤90
x≥0, y ≥0
9
Step 4: Solve the linear programming problem. Solving the linear program-
ming problem, we find the optimal solution to be x= 20 units of product A
and y= 15 units of product B.
Therefore, the company should produce 20 units of product A and 15 units
of product B to maximize profit.
Question 11
Question
A company produces two types of products, Product A and Product B. Each
unit of Product A yields a profit of
$
20, while each unit of Product B yields a
profit of
$
30. The company has a limited supply of 500 units of plastic and 300
units of metal. Producing one unit of Product A requires 2 units of plastic and
1 unit of metal, while producing one unit of Product B requires 1 unit of plastic
and 2 units of metal. How many units of each product should the company
produce to maximize its total profit?
Solution
Step 1: Define the decision variables: Let xbe the number of units of Product
A to produce, and let ybe the number of units of Product B to produce.
Step 2: Write the objective function: The total profit function, P(x, y), that
the company wants to maximize is given by:
P(x, y) = 20x+ 30y
Step 3: Write the constraints: The constraints are the limited supply of
plastic and metal:
2x+y≤500 (Plastic constraint)
x+ 2y≤300 (Metal constraint)
Step 4: Find the feasible region: Graph the inequalities to find the feasible
region where the constraints are satisfied.
Step 5: Find the vertices of the feasible region: Solve the equations of the
lines that intersect at the vertices of the feasible region.
Step 6: Evaluate the objective function at each vertex: Calculate P(x, y) for
each vertex to find the maximum total profit.
Step 7: Make a conclusion: Determine how many units of each product the
company should produce to maximize its total profit.
10
Question 12
Question
A company produces two types of products, xand y, which are sold for
$
30
and
$
40 per unit, respectively. The company’s total production capacity is 500
units per day. Production of product xrequires 2 hours of labor per unit and
product yrequires 3 hours of labor per unit. The company has 800 labor hours
available per day. How many units of each product should the company produce
to maximize its daily revenue?
Solution
Let’s denote the number of units of product xproduced per day as a, and
the number of units of product yproduced per day as b. The objective is to
maximize the revenue function:
R(a, b) = 30a+ 40b
Subject to the constraints:
a+b≤500 (total production capacity)
2a+ 3b≤800 (labor hours available)
a, b ≥0 (non-negativity)
To solve this optimization problem, we will first find the corner points of the
feasible region and then evaluate the objective function at each corner point to
determine the maximum revenue.
Step 1: Find corner points To find the corner points, we need to solve the
system of inequalities. The corner points are the intersections of the boundary
lines.
Step 2: Check the boundary:
When a= 0, from a+b≤500, we have b= 500.
When b= 0, from a+b≤500, we have a= 500.
When b= 0, from 2a+ 3b≤800, we have a= 400.
When a= 0, from 2a+ 3b≤800, we have b= 800/3.
Step 3: Evaluate the objective function at each corner point
Corner point 1: (0,500)
Revenue R(0,500) = 30(0) + 40(500) = $20000
Corner point 2: (500,0)
Revenue R(500,0) = 30(500) + 40(0) = $15000
11
Corner point 3: (400,0)
Revenue R(400,0) = 30(400) + 40(0) = $12000
Corner point 4: (0,800/3)
Revenue R(0,800/3) = 30(0) + 40(800/3) ≈$10667
Thus, the maximum revenue of
$
20000 can be achieved by producing 500
units of product yand no units of product x.
Question 13
Question
A manufacturer produces two types of smartphones, A and B. It costs
$
50 to
produce each unit of type A and
$
80 to produce each unit of type B. The
manufacturer can sell type A for
$
120 each and type B for
$
150 each. The
manufacturer has a budget of
$
8000 for production costs and can sell at most
120 units. How many units of each type should the manufacturer produce to
maximize profit?
Solution
Step 1: Define the variables. Let xbe the number of units of type A produced
and sold, and let ybe the number of units of type B produced and sold.
Step 2: Write the constraints based on the information given: - Production
cost constraint: 50x+ 80y≤8000 - Demand constraint: x+y≤120 - Non-
negativity constraint: x≥0, y≥0
Step 3: Write the objective function to maximize profit. The profit function
is the revenue minus the production cost: P(x, y) = 120x+150y−(50x+80y) =
70x+ 70y
Step 4: Combine the constraints and objective function to form the linear
programming problem: Maximize P(x, y) = 70x+ 70ySubject to: 50x+ 80y≤
8000 x+y≤120 x≥0, y≥0
Step 5: Solve the linear programming problem. To find the maximum profit,
we need to graph the feasible region formed by the constraints and then find
the corner points.
The corner points are: (0, 0), (0, 100), (96, 24), and (120, 0).
Step 6: Calculate the profit at each corner point: - (0, 0): P(0,0) = 0 - (0,
100): P(0,100) = 0 - (96, 24): P(96,24) = 70(96) + 70(24) = 6720 - (120, 0):
P(120,0) = 70(120) + 70(0) = 8400
Step 7: The maximum profit of
$
8400 is achieved when the manufacturer
produces 120 units of type A and 0 units of type B.
12
Question 14
Question
A company produces two types of products, A and B, using machines X and Y.
Each unit of product A requires 2 hours of machine X and 1 hour of machine
Y. Each unit of product B, on the other hand, requires 1 hour of machine X
and 3 hours of machine Y. Machine X can operate for a maximum of 40 hours
a week, while machine Y can operate for a maximum of 30 hours a week. If the
profit from each unit of product A is
$
30 and each unit of product B is
$
40,
how many units of each should the company produce to maximize profit?
Solution
Let’s denote the number of units of product A produced as xand the number
of units of product B produced as y. The objective is to maximize the profit,
which can be represented by the function P(x, y) = 30x+ 40y.
We also have the following constraints based on the available machine hours:
Machine X constraint: 2x+y≤40
Machine Y constraint: x+ 3y≤30
Non-negativity constraint: x, y ≥0
The feasible region for this problem is the intersection of the shaded regions
defined by the constraints.
Now, we need to find the corner points of the feasible region by solving the
system of equations formed by the boundaries of the constraints.
When 2x+y= 40 and x+ 3y= 30, we get x= 15 and y= 10. This gives
us the point (15,10).
When 2x+y= 40 and x= 0, we get y= 40. This gives us the point
(0,40).
When x+ 3y= 30 and y= 0, we get x= 30. This gives us the point
(30,0).
Next, we evaluate the profit function at each of these corner points to deter-
mine the optimal solution.
At (15,10): P(15,10) = 30(15) + 40(10) = 450 + 400 = 850
At (0,40): P(0,40) = 30(0) + 40(40) = 0 + 1600 = 1600
At (30,0): P(30,0) = 30(30) + 40(0) = 900 + 0 = 900
Therefore, the company should produce 15 units of product A and 10 units
of product B to maximize profit at
$
850.
13
Question 15
Question
A company manufactures two products, Product Aand Product B. The profit
per unit for Product Ais
$
20 and for Product Bis
$
30. Each unit of Product A
requires 3 hours of labor and 2 hours of machine time, while each unit of Product
Brequires 4 hours of labor and 3 hours of machine time. The company has 360
hours of labor and 240 hours of machine time available per week. How many
units of each product should the company produce in order to maximize their
profit?
Solution
Step 1: Let’s define our variables: - Let xbe the number of units of Product A
to produce. - Let ybe the number of units of Product Bto produce.
Step 2: Write the objective function: The total profit Pis given by:
P= 20x+ 30y
Step 3: Write the constraints based on the available hours of labor and
machine time: The labor constraint is:
3x+ 4y≤360
The machine time constraint is:
2x+ 3y≤240
Step 4: Transform the inequalities into equations to find the corner points:
- Solving 3x+ 4y= 360 and 2x+ 3y= 240 gives the corner points: (80,60),
(120,40), and (0,80).
Step 5: Calculate the profit at each corner point: - For (80,60): P= 20(80)+
30(60) = 2600 - For (120,40): P= 20(120) + 30(40) = 3200 - For (0,80):
P= 20(0) + 30(80) = 2400
Step 6: Determine the maximum profit: The maximum profit is
$
3200 when
the company produces 120 units of Product Aand 40 units of Product B.
Question 16
Question
A company manufactures two types of products, A and B. Each unit of product
A requires 3 hours of labor and 2 hours of machine time, while each unit of prod-
uct B requires 2 hours of labor and 4 hours of machine time. The company has
120 hours of labor available and 160 hours of machine time available each day.
Each unit of product A generates a profit of 30, whileeachunitof productBgeneratesaprofitof40.
How many units of each product should the company produce each day to max-
imize profit?
14
Solution
Step 1: Assign variables to represent the unknowns. Let xbe the number of
units of product A produced daily, and let ybe the number of units of product
B produced daily.
Step 2: Write the constraints based on the available labor and machine time:
3x+ 2y≤120 (labor constraint)
2x+ 4y≤160 (machine time constraint)
Step 3: Write the objective function to maximize profit:
Maximize Z= 30x+ 40y
Step 4: Graph the feasible region determined by the constraints. First, solve
the labor constraint for y:
y≤60 −3
2x
Then, solve the machine time constraint for y:
y≤40 −1
2x
Step 5: Calculate the corner points of the feasible region by solving the
equations simultaneously. The corner points are:
A(0,0), B(0,40), C(20,20), D(30,0)
Step 6: Evaluate the objective function at each corner point:
ZA= 30(0) + 40(0) = 0
ZB= 30(0) + 40(40) = 1600
ZC= 30(20) + 40(20) = 1400
ZD= 30(30) + 40(0) = 900
Step 7: Compare the values of the objective function at each corner point.
The maximum profit of 1600isachievedatpointB(0,40).
Step 8: Therefore, the company should produce 0 units of product A and 40
units of product B daily to maximize profit.
Question 17
Question
A company produces two types of products, Product A and Product B. Each
unit of Product A yields a profit of 120, whileeachunitof P roductByieldsaprof itof150.
The production of Product A requires 2 labor-hours and 3 machine-hours, while
the production of Product B requires 4 labor-hours and 2 machine-hours. The
company has 100 labor-hours and 80 machine-hours available in a week. How
many units of each product should the company produce to maximize its profit?
15
Solution
Step 1: Define the variables. Let xbe the number of units of Product A
produced and ybe the number of units of Product B produced. We want to
maximize the profit P, which is given by the equation P= 120x+ 150y.
Step 2: Write the constraints. The labor-hours constraint is given by 2x+
4y≤100 and the machine-hours constraint is given by 3x+ 2y≤80.
Step 3: Set up the objective function and constraints. The optimization
problem can be formulated as follows:
Maximize P= 120x+ 150y
subject to
2x+ 4y≤100
3x+ 2y≤80
x≥0, y ≥0
Step 4: Solve the linear programming problem. We can graph the feasible
region determined by the constraints and find the corner points where the max-
imum profit occurs. The corner points are: - (0,0) - 0,40
3- (20,0) - (16,12)
Step 5: Evaluate the objective function at each corner point: - At (0,0):
P= 0 - At 0,40
3:P= 2000 - At (20,0): P= 2400 - At (16,12): P= 2880
Step 6: Determine the maximum profit. The company should produce 16
units of Product A and 12 units of Product B to maximize its profit, yielding a
profit of 2880.
Question 18
Question
A company produces two products: Product A and Product B. It costs
$
5 to
produce each unit of Product A and
$
8 to produce each unit of Product B. The
company can sell Product A for
$
12 per unit and Product B for
$
15 per unit.
The company has a budget of
$
600 for production costs. If the company wants
to maximize its profit, how many units of each product should they produce?
Solution
Step 1: Define the variables. Let xbe the number of units of Product A
produced and ybe the number of units of Product B produced.
Step 2: Write the constraints. - Production cost constraint: 5x+ 8y≤600
(budget constraint) - Non-negativity constraint: x≥0, y≥0
Step 3: Write the objective function. The profit function is given by P=
12x+ 15y.
Step 4: Set up the optimization problem. Maximize P= 12x+ 15ysubject
to the constraints: 1. 5x+ 8y≤600 2. x≥0, y≥0
16
Step 5: Solve the optimization problem using the corner point method or
graphical method.
The corner points of the feasible region are the intersection points of the
constraint lines. Solving the system of equations:
(5x+ 8y= 600
y= 0
We find the corner points: - (0,75) - (120,0) - (96,30)
Step 6: Evaluate the objective function at each corner point. 1. For point
(0, 75): P= 12(0)+15(75) = 1125 2. For point (120, 0): P= 12(120)+15(0) =
1440 3. For point (96, 30): P= 12(96) + 15(30) = 1410
Step 7: Determine the maximum profit. The maximum profit occurs at
the point (120, 0) where x= 120 and y= 0. Therefore, the company should
produce 120 units of Product A and 0 units of Product B to maximize its profit.
Question 19
Question
A company produces two types of souvenirs: mugs and keychains. The pro-
duction of each mug requires 2 hours of labor and 3 hours of machine time,
while each keychain requires 1 hour of labor and 2 hours of machine time. The
company has 300 hours of labor and 400 hours of machine time available per
week. Each mug sold yields a profit of
$
5 and each keychain sold yields a profit
of
$
3. How many mugs and keychains should the company produce each week
to maximize its profit?
Solution
Step 1: Define the variables. Let xbe the number of mugs produced per week
and ybe the number of keychains produced per week.
Step 2: Write the constraints based on the available labor and machine time:
2x+y≤300 (Labor constraint)
3x+ 2y≤400 (Machine time constraint)
Step 3: Write the objective function to maximize profit:
Maximize Z= 5x+ 3y
Step 4: Plot the feasible region determined by the constraints.
17
Step 5: Calculate the coordinates of the corner points of the feasible region:
Corner 1: (0,150)
Corner 2: (0,200)
Corner 3: (100,100)
Corner 4: (133.33,66.66)
Corner 5: (150,0)
Step 6: Evaluate the objective function at each corner point:
Z(0,150) = 450
Z(0,200) = 600
Z(100,100) = 800
Z(133.33,66.66) ≈800
Z(150,0) = 750
Step 7: Determine the maximum value of the objective function: The maxi-
mum profit of
$
800 is achieved when 100 mugs and 100 keychains are produced
per week.
Question 20
Question
A manufacturing company produces two types of products: product A and
product B. Each unit of product A requires 2 hours of labor and 1 hour of
machine time, while each unit of product B requires 1 hour of labor and 2 hours
of machine time. The profit earned per unit of product A is
$
30 and for product
B is
$
40. If the company has 100 hours of labor and 80 hours of machine time
available per week, how many units of each product should be produced to
maximize profit?
Solution
Step 1: Define the variables. Let xbe the number of units of product A pro-
duced, and let ybe the number of units of product B produced.
Step 2: Write the objective function. The profit function can be represented
as:
P(x, y) = 30x+ 40y
Step 3: Write the constraints. The constraints are the available hours of
labor and machine time:
2x+y≤100
x+ 2y≤80
18
Step 4: Non-negativity constraints. Since the number of units produced
cannot be negative:
x≥0, y ≥0
Step 5: Set up the system of inequalities. The problem can be formulated
as the following linear programming problem: Maximize P(x, y) = 30x+ 40y
subject to the constraints:
2x+y≤100
x+ 2y≤80
x≥0, y ≥0
Step 6: Solve the system of inequalities using the graphical method or sim-
plex method to find the values of xand ythat maximize the profit function
P.
Step 7: The optimal solution is to produce 40 units of product A (x = 40)
and 20 units of product B (y = 20) to maximize the profit to
$
2000 per week.
Question 21
Question
A company produces two products, A and B. The profit from each unit of
product A is
$
10, and the profit from each unit of product B is
$
15. Product A
requires 2 hours of labor to produce, while product B requires 3 hours of labor.
The company has 50 hours of labor available each day. How many units of each
product should the company produce to maximize profit?
Solution
Step 1: Define the variables. Let xbe the number of units of product A pro-
duced, and let ybe the number of units of product B produced.
Step 2: Write the objective function. The total profit can be represented as
P= 10x+ 15y
Step 3: Write the constraint equations. The labor constraint is given by
2x+ 3y≤50
Step 4: Non-negativity constraints. Since the number of units cannot be
negative, we have
x≥0, y ≥0
Step 5: Set up the system. We now have the following linear programming
problem: Maximize P= 10x+ 15ysubject to
2x+ 3y≤50
x≥0
y≥0
19
Step 6: Solve the system. We can graph the feasible region and find the
corner points to determine the maximum profit.
The corner points are: (0, 0), (0, 16.67), (25, 0), (20, 10), and (0, 10).
Calculating the profit at each corner point: (0, 0): 10(0) + 15(0) = $0 (0,
16.67): 10(0) + 15(16.67) = $250.05 (25, 0): 10(25) + 15(0) = $250 (20, 10):
10(20) + 15(10) = $250 (0, 10): 10(0) + 15(10) = $150
Therefore, the maximum profit of
$
250 can be achieved by producing 25
units of product A and 0 units of product B.
Question 22
Question
A company manufactures two types of products, A and B. It takes 2 hours to
produce one unit of product A and 3 hours to produce one unit of product B.
The company has a total of 160 hours of production time available each week.
If the profit from each unit of product A is
$
50 and the profit from each unit of
product B is
$
60, how many units of each product should the company produce
in order to maximize its profit?
Solution
Step 1: Define the variables. Let xbe the number of units of product A produced
and let ybe the number of units of product B produced.
Step 2: Write the objective function. The profit function, P(x, y), can be
expressed as:
P(x, y) = 50x+ 60y
Step 3: Write the constraint equation. The constraint is based on the total
production time available each week:
2x+ 3y≤160
Step 4: Set up the optimization problem. We want to maximize the profit
function subject to the constraint equation:
Maximize P(x, y) = 50x+ 60y
Subject to 2x+ 3y≤160
Step 5: Solve the optimization problem using the constraint equation. The
solution can be found at the intersection of the constraint equation and the
non-negative region:
2x+ 3y= 160
y=160 −2x
3
20
Step 6: Find the critical points. To find the critical points, we take the
partial derivatives of the profit function and set them equal to zero:
∂P
∂x = 50 = 0 ⇒No critical point for x
∂P
∂y = 60 + 160 −2x
3= 0
60 + 160 −2x
3= 0
180 + 160 −2x= 0
−2x=−340
x= 170
Step 7: Analyze the critical point. The critical point x= 170 is invalid since
the production time constraint is violated.
Step 8: Determine the valid vertex points. The valid vertex points are found
by evaluating the profit function at the corners of the feasible region. The
corners are (0, 0), (0, 53.33), and (80, 20).
Step 9: Evaluate the profit function at each vertex point.
P(0,0) = 50(0) + 60(0) = 0
P(0,53.33) = 50(0) + 60(53.33) = 3199.8
P(80,20) = 50(80) + 60(20) = 5400
Step 10: Determine the optimal production plan. The company should
produce 80 units of product A and 20 units of product B to maximize its profit,
with a total profit of
$
5400.
Question 23
Question
A company produces two types of smartphones: Model X and Model Y. The
profit from each Model X sold is
$
200, while the profit from each Model Y sold is
$
300. The company can produce up to 400 units of Model X per month and up
to 300 units of Model Y per month. The company estimates that the demand
for Model X is at most 200 units per month and the demand for Model Y is at
most 150 units per month. How many units of each model should the company
produce and sell each month to maximize profit?
21
Solution
Step 1: Let’s define our variables: - Let xrepresent the number of units of
Model X produced and sold per month. - Let yrepresent the number of units
of Model Y produced and sold per month.
Step 2: We need to set up the constraints based on the production limits and
demand: - Production constraint for Model X: x≤400 - Production constraint
for Model Y: y≤300 - Demand constraint for Model X: x≤200 - Demand
constraint for Model Y: y≤150
Step 3: The objective function is to maximize profit: - The total profit P
can be expressed as: P= 200x+ 300y
Step 4: We need to find the feasible region by graphing the constraints
on a coordinate plane. The feasible region will be the intersection of all the
constraints.
Step 5: The feasible region formed by the constraints will be a polygon with
vertices at the intersections of the lines that represent the constraints.
Step 6: Identify the vertices of the feasible region: - Vertices are the points
where the lines intersect. We have four vertices: (0,0), (200,0), (200,150), and
(400,0).
Step 7: Evaluate the objective function at each vertex to find the maximum
profit: - P(0,0) = 0 - P(200,0) = 200(200) + 300(0) = 40000 - P(200,150) =
200(200) + 300(150) = 80000 - P(400,0) = 200(400) + 300(0) = 80000
Step 8: Compare the profits at each vertex to determine the maximum profit:
- The maximum profit of
$
80,000 can be achieved when producing and selling
200 units of Model X and 150 units of Model Y.
Question 24
Question
A farmer wants to build a rectangular pen for his animals using 400 meters
of fencing. If he wants to maximize the area of the pen, what should be the
dimensions of the pen?
Solution
Step 1: Let xbe the width and ybe the length of the rectangular pen.
Step 2: The perimeter of the rectangular pen is given by 2x+ 2y= 400.
Step 3: Solving for one of the variables, we get y= 200 −x.
Step 4: The area of the rectangular pen can be expressed as A=xy.
Step 5: Substitute the equation for yinto the area formula: A=x(200−x) =
200x−x2.
Step 6: To maximize the area, we need to find the critical points. Take the
derivative of the area function: dA
dx = 200 −2x.
Step 7: Set the derivative equal to 0 to find critical points: 200−2x= 0 =⇒
x= 100.
22
Step 8: To check if it is a maximum or minimum, we use the second derivative
test. Taking the second derivative of the area function gives d2A
dx2=−2 which is
less than 0, confirming it is a maximum.
Step 9: Therefore, when x= 100, the width is 100 meters and the length is
200 −100 = 100 meters.
Step 10: The dimensions of the rectangular pen that maximizes the area are
100 meters by 200 meters.
Question 25
Question
A farmer wants to fence off a rectangular area of land along a riverbank. He has
200 meters of fencing material and wants to enclose the largest possible area.
One side of the rectangle will be bordered by the river, so no fencing is needed
on that side. What dimensions should the farmer use for the fenced area?
Solution
Step 1: Let xbe the width of the fenced area parallel to the riverbank, and let
ybe the length perpendicular to the riverbank.
Step 2: The farmer has 200 meters of fencing material, so the total length
of fencing required would be 2x+y.
Step 3: Since one side of the rectangle is bordered by the river, the total
length of fencing would be 2x+y= 200.
Step 4: We want to maximize the area of the fenced area, which is given by
A=xy.
Step 5: We can express the area in terms of a single variable using the
constraint 2x+y= 200. Rewrite yas y= 200 −2x.
Step 6: Substitute y= 200 −2xinto A=xy to get A=x(200 −2x).
Step 7: Rewrite the equation as a quadratic function of A:A= 200x−2x2.
Step 8: To find the maximum area, we need to find the critical points by
taking the derivative of Awith respect to xand setting it equal to 0.
dA
dx = 200 −4x= 0
Step 9: Solve for xto find the critical point: 200 −4x= 0 ⇒x= 50.
Step 10: Now that we have x= 50, we can find yusing 2x+y= 200 ⇒
2(50) + y= 200 ⇒y= 100.
Step 11: Therefore, the dimensions that the farmer should use for the fenced
area are 50 meters by 100 meters to enclose the largest possible area.
23
Question 26
Question
A company manufactures two types of products, Product A and Product B.
Each unit of Product A requires 3 hours of labor and 2 units of raw material,
while each unit of Product B requires 4 hours of labor and 1 unit of raw material.
The company has 120 hours of labor and 40 units of raw material available. The
profit per unit of Product A is
$
30 and the profit per unit of Product B is
$
40.
How many units of each product should the company produce to maximize its
profit?
Solution
Let xbe the number of units of Product A and ybe the number of units of
Product B produced.
Step 1: Write the objective function and constraint equations. The objec-
tive is to maximize the profit:
Z= 30x+ 40y
Subject to constraints:
3x+ 4y≤120
2x+y≤40
x≥0, y ≥0
Step 2: Solve the system of inequalities to find the feasible region. We
graph the inequalities 3x+ 4y≤120 and 2x+y≤40 to find the feasible region.
Step 3: Find the vertices of the feasible region. The vertices of the fea-
sible region are the points of intersection of the lines obtained by solving the
inequalities.
Step 4: Calculate the profit at each vertex. Plug the values of xand yfrom
each vertex into the objective function Z= 30x+ 40yto find the profit at each
vertex.
Step 5: Identify the vertex that gives the maximum profit. Compare the
profits calculated in Step 4 to find the vertex that maximizes the profit.
Therefore, the company should produce a certain number of units of Product
A and Product B to maximize its profit.
Question 27
Question
A company manufactures two types of bookshelves, A and B. Each type A shelf
requires 4 hours of labor and 2 hours of carpentry work, while each type B shelf
requires 3 hours of labor and 3 hours of carpentry work. The company has a
24
total of 40 hours of labor and 30 hours of carpentry work available each week.
Shelf A sells for
$
150 and shelf B sells for
$
120. How many of each type of shelf
should the company produce to maximize profits?
Solution
Let xbe the number of type A shelves and ybe the number of type B shelves
produced.
Step 1: Write the constraints based on the available labor and carpen-
try work. The labor constraint is 4x+ 3y≤40 (total available labor hours
each week), and the carpentry work constraint is 2x+ 3y≤30 (total available
carpentry work hours each week).
Step 2: Write the objective function. The objective is to maximize profit,
which can be expressed as P(x, y) = 150x+ 120y.
Step 3: Find the corner points of the feasible region by solving the system
of inequalities. Solving the system of inequalities:
(4x+ 3y≤40
2x+ 3y≤30
we get corner points at (0,10),(5,10),and (7.5,5).
Step 4: Evaluate the objective function at each corner point. The profit
at (0,10) is P(0,10) = 150(0) + 120(10) = $1200. The profit at (5,10) is
P(5,10) = 150(5) + 120(10) = $1950. The profit at (7.5,5) is P(7.5,5) =
150(7.5) + 120(5) = $1650.
Step 5: Decide on the optimal solution. To maximize profit, the company
should produce 5 type A shelves and 10 type B shelves, resulting in a maximum
profit of
$
1950.
Question 28
Question
A company produces two types of products, Aand B, which both require re-
sources in order to be manufactured. Product Arequires 3 units of resource X
and 5 units of resource Yper unit produced, while product Brequires 4 units
of resource Xand 6 units of resource Yper unit produced. The company has at
most 120 units of resource Xand 180 units of resource Yavailable for produc-
tion. If the profit for each unit of product Ais 10andforeachunitofproductB is
15, howmanyunitsofeachproductshouldthecompanyproducetomaximizeitsprof it?
Solution
Let xbe the number of units of product Aproduced and ybe the number of
units of product Bproduced.
25
Step 1: Set up the objective function to be maximized. The total profit,
P, can be expressed as:
P= 10x+ 15y
Step 2: Set up the constraints based on the available resources. The con-
straints are the limits on the amount of resources Xand Yavailable for pro-
duction.
For resource X: 3x+ 4y≤120
For resource Y: 5x+ 6y≤180
Non-negativity constraints: x≥0 and y≥0
Step 3: Set up the appropriate inequalities based on the constraints:
3x+ 4y≤120
5x+ 6y≤180
x≥0
y≥0
Step 4: Convert the inequalities into equalities for easier visualization (to
find the corner points). For the first constraint:
3x+ 4y= 120 =⇒y= 30 −3x
4
For the second constraint:
5x+ 6y= 180 =⇒y= 30 −5x
6
The corners are at the intersections of these lines within the feasible region.
Step 5: Find the corner points and calculate the profit at each corner. The
corner points are obtained by solving the system of equations formed by the
intersecting constraint lines.
The corner points are: (0,30),(24,0),(28,10)
Calculate the profit at each corner:
At (0, 30): P= 10(0) + 15(30) = 450
At (24, 0): P= 10(24) + 15(0) = 240
At (28, 10): P= 10(28) + 15(10) = 370
Step 6: Determine the optimal solution. The maximum profit of 450isachievedatthepoint(0,30)whichmeansthecompanyshouldproduce30unitsofproductB
and 0 units of product A.
26
Question 29
Question
A company manufactures two types of products, Product A and Product B.
The company’s production process for Product A requires 3 hours of labor and
4 hours of machine time, while Product B requires 2 hours of labor and 5 hours
of machine time. The company has a total of 60 hours of labor and 80 hours of
machine time available per week. If the profit for each unit of Product A is
$
10
and for each unit of Product B is
$
8, how many units of each product should
the company produce to maximize their profit?
Solution
Step 1: Define the variables. Let xbe the number of units of Product A
produced and ybe the number of units of Product B produced.
Step 2: Write the objective function. The total profit, P, is given by:
P= 10x+ 8y
Step 3: Write the constraints based on the available labor and machine time.
The constraints are:
3x+ 2y≤60 (Labor constraint)
4x+ 5y≤80 (Machine time constraint)
Step 4: Non-negativity constraint. Since the number of units produced
cannot be negative, we have:
x≥0, y ≥0
Step 5: Graph the feasible region formed by the constraints. To find the
vertices of the feasible region, solve the system of inequalities:
(3x+ 2y= 60
4x+ 5y= 80
Solving, we find the points of intersection to be: (0,30), (8,12), (20,0).
Step 6: Evaluate the objective function at each vertex to determine the
maximum profit:
P(0,30) = 10(0) + 8(30) = 240
P(8,12) = 10(8) + 8(12) = 176
P(20,0) = 10(20) + 8(0) = 200
Step 7: Therefore, the number of units of each product the company should
produce to maximize profit is 8 units of Product A and 12 units of Product B,
resulting in a profit of
$
176.
27
Question 30
Question
A company produces two types of products, Xand Y, using two machines,
Machine 1 and Machine 2. Producing one unit of Xrequires 3 hours on Machine
1 and 2 hours on Machine 2, while producing one unit of Yrequires 2 hours
on Machine 1 and 1 hour on Machine 2. Each unit of Xyields a profit of
$
10,
while each unit of Yyields a profit of
$
8. Machine 1 is available for 20 hours
per day, and Machine 2 is available for 12 hours per day.
Formulate and solve a linear programming problem to determine how many
units of Xand Ythe company should produce each day to maximize their
profit.
Solution
Step 1: Define the decision variables: Let xbe the number of units of product
Xto produce each day, and ybe the number of units of product Yto produce
each day.
Step 2: Write the objective function: The objective is to maximize the profit.
The total profit Pcan be expressed as:
P= 10x+ 8y
Step 3: Write the constraints: - Machine 1 time constraint: 3 hours of
Machine 1 per unit of Xand 2 hours per unit of Ymust not exceed 20 hours
available each day:
3x+ 2y≤20
- Machine 2 time constraint: 2 hours of Machine 2 per unit of Xand 1 hour per
unit of Ymust not exceed 12 hours available each day:
2x+y≤12
- Non-negativity constraints:
x≥0, y ≥0
Step 4: Solve the linear programming problem using the simplex method or
graphically to find the optimal values of xand ythat maximize the profit.
28
