MATH 125 - FINITE MATHEMATICS
- Optimization and Decision Making
Question Bank - Set 2
Liberty University
Question 1
Question
A company produces two types of products, type A and type B. Each product
requires a certain amount of raw material A and raw material B to produce.
The profit per unit for product A is
$
20 and for product B is
$
30. The company
has 500 units of raw material A and 800 units of raw material B available per
day. Product A requires 2 units of raw material A and 3 units of raw material B,
while product B requires 4 units of raw material A and 5 units of raw material
B. How many units of each product should the company produce in order to
maximize their profit?
Solution
Step 1: Let’s denote the number of units of product A to be produced as xand
the number of units of product B to be produced as y.
Step 2: We need to create an objective function to maximize profit. Since
the profit per unit for product A is
$
20 and for product B is
$
30, the total profit
can be expressed as:
P= 20x+ 30y
Step 3: Next, we set up the constraints based on the availability of raw
materials. The company has 500 units of raw material A and 800 units of raw
material B available per day. The constraints for raw material A and B are:
2x+ 4y≤500
3x+ 5y≤800
Step 4: We also need to consider the non-negativity constraints, where x≥0
and y≥0.
Step 5: The company wants to maximize profit, so we need to solve this
linear programming problem using these constraints.
Maximize P= 20x+ 30y
subject to
2x+ 4y≤500
3x+ 5y≤800
x≥0, y ≥0
Step 6: To find the optimal solution, we can graph the constraints and find
the feasible region where the profit is maximized. The vertices of the feasible
region represent the possible solutions.
Step 7: Calculating the vertices of the feasible region and evaluating the
profit at each vertex will give us the optimal solution.
Question 2
Question
A company manufactures two products, product A and product B. Product
A requires 3 hours of labor and 2 hours of machine time to produce, while
product B requires 2 hours of labor and 4 hours of machine time to produce.
The company has 240 hours of labor and 320 hours of machine time 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: Let’s denote the number of units of product A produced per week as x,
and the number of units of product B produced per week as y.
Step 2: We can write the constraints for the available labor and machine
time as follows:
3x+ 2y≤240 (labor constraint)
2x+ 4y≤320 (machine time constraint)
Step 3: The company’s objective is to maximize revenue, which can be
calculated as the total revenue from product A and product B. The total revenue
Ris given by:
R= 10x+ 15y
Step 4: To find the maximum revenue, we need to solve the following linear
programming problem:
Maximize R= 10x+ 15y
2
subject to the constraints:
3x+ 2y≤240
2x+ 4y≤320
x, y ≥0
Step 5: Now, we can graph the feasible region determined by the constraints
and find the corner points.
Step 6: The corner points of the feasible region are:
Corner 1: (0,80)
Corner 2: (40,50)
Corner 3: (80,40)
Corner 4: (80,0)
Step 7: Calculate the revenue at each corner point:
Corner 1: R= 15(80) = 1200
Corner 2: R= 10(40) + 15(50) = 850
Corner 3: R= 10(80) + 15(40) = 1200
Corner 4: R= 10(80) = 800
Step 8: The maximum revenue of
$
1200 can be achieved when producing 80
units of product A and 40 units of product B.
Question 3
Question
A company manufactures two types of products, Product A and Product B.
The profit per unit for Product A is 10andforP roductBis15. The company has
a total of 100 hours of production time available per week. Product A requires
2 hours of production time per unit, while Product B requires 3 hours. How
many units of each product should the company produce to maximize its weekly
profit?
Solution
Step 1: Define the decision variables. Let xbe the number of units of Product
A to produce and ybe the number of units of Product B to produce.
Step 2: Write the objective function. The objective is to maximize the profit,
which is given by 10x+ 15y.
Step 3: Write the constraints: - The total production time constraint:
2x+ 3y≤100 (total production time available per week) - Non-negativity
constraints: x≥0, y≥0
Step 4: Graph the feasible region by plotting the inequalities 2x+ 3y≤100,
x≥0, and y≥0. The feasible region will be the area bounded by these lines.
3
Step 5: Find the corner points of the feasible region where the maximum
profit can occur.
Step 6: Evaluate the objective function at each corner point to determine
the maximum profit.
Step 7: The optimal solution will be the values of xand ythat give the
maximum profit.
Question 4
Question
A company produces two products, Product A and Product B. Each unit of
Product A requires 3 units of labor and 4 units of materials to produce, while
each unit of Product B requires 2 units of labor and 5 units of materials to pro-
duce. The company has 240 units of labor and 300 units of materials available.
If the profit for each unit of Product A is
$
8 and the profit for each unit of
Product B is
$
10, how many units of each product should the company produce
to maximize profit?
Solution
Step 1: Define the variables. Let xrepresent the number of units of Product A
produced and yrepresent the number of units of Product B produced.
Step 2: Write the objective function. The total profit, P, can be represented
as:
P= 8x+ 10y
Step 3: Write the constraint equations based on the available labor and
materials. - The labor constraint: 3x+ 2y≤240 - The materials constraint:
4x+ 5y≤300
Step 4: Plot the feasible region. To find the feasible region, plot the inequal-
ities 3x+ 2y= 240 and 4x+ 5y= 300 on the coordinate plane and shade the
region where both inequalities are satisfied.
Step 5: Find the vertices of the feasible region. The vertices are the points
of intersection of the lines forming the boundaries of the feasible region.
Step 6: Calculate the profit at each vertex. Substitute the coordinates of
each vertex into the objective function P= 8x+ 10yto find the profit at each
vertex.
Step 7: Determine the maximum profit. Compare the profits calculated at
each vertex to identify the maximum profit and the corresponding values of
xand y. This point represents the optimal production levels for maximizing
profit.
4
Question 5
Question
A company manufactures two types of smartphones: Model A and Model B.
It takes 3 hours to assemble Model A and 5 hours to assemble Model B. The
company can allocate up to 40 hours a week for assembling smartphones. Model
A generates a profit of
$
200 each, while Model B generates a profit of
$
300 each.
If the company’s goal is to maximize profit, how many of each model should
they produce weekly?
Solution
Step 1: Define the decision variables. Let xbe the number of Model A smart-
phones produced weekly, and let ybe the number of Model B smartphones
produced weekly.
Step 2: Write the objective function. The objective is to maximize profit,
which can be represented as: P(x, y) = 200x+ 300y
Step 3: Write the constraint equations. The constraint on the total hours
available for assembling smartphones is: 3x+ 5y≤40
Step 4: Solve the optimization problem. To maximize profit, we need to solve
the following linear programming problem: Maximize P(x, y) = 200x+ 300y
Subject to: 3x+ 5y≤40 x≥0, y ≥0
Step 5: Plot the feasible region. To find the feasible region, we need to graph
the constraint equation 3x+ 5y= 40. The feasible region will be the area below
or on the line 3x+ 5y= 40 and in the first quadrant.
Step 6: Find the corner points of the feasible region. The corner points of
the feasible region are the intersection points of the boundary lines: 3x+5y= 40
with the axes.
Step 7: Evaluate the objective function at each corner point. - At the point
(0, 8): P(0,8) = 200(0) + 300(8) = 2400 - At the point 40
3,0:P40
3,0=
200 40
3+ 300(0) = 2666.6
Step 8: Determine the solution. To maximize profit, the company should
produce 8 Model A smartphones and 0 Model B smartphones weekly. This will
result in a weekly profit of
$
2400.
Question 6
Question
A company manufactures two types of products, Aand B. The profit per unit
for product Ais 3 and for product Bis 5. It takes 2 hours to manufacture
product Aand 3 hours to manufacture product B. The company has a total of
120 hours of manufacturing time available per week.
If the company wants to maximize its profit, how many units of each product
should it manufacture per week?
5
Solution
Let’s denote the number of units of product Aand Bmanufactured per week
as xand y, respectively.
We need to maximize the total profit P= 3x+ 5ysubject to the constraints:
1. Manufacturing time constraint: 2x+ 3y≤120 2. Non-negativity constraint:
x≥0, y ≥0
To solve this problem, we will set up the following linear programming model:
Maximize P= 3x+ 5y
Subject to 2x+ 3y≤120
x≥0, y ≥0
The feasible region for this linear programming problem is a closed convex
polygon.
Step 1: Identify the corner points of the feasible region by solving the
system of linear inequalities:
2x+ 3y= 120
x= 0
y= 0
By solving the above system of equations, we get the corner points as (0,40),
(60,0), and (0,0).
Step 2: Calculate the objective function value at each corner point: 1.
Point (0,40): P= 3(0) + 5(40) = 200 2. Point (60,0): P= 3(60) + 5(0) = 180
3. Point (0,0): P= 3(0) + 5(0) = 0
Thus, the maximum profit of 200 is achieved when the company manufac-
tures 0 units of product Aand 40 units of product Bper week.
Question 7
Question
A company manufactures two types of products, Xand Y. It costs 300 dollars to
produce one unit of product Xand 500dollarstoproduceoneunitofproductY.T hesellingpriceof productXis600dollarsperunit, andthesellingpriceofproductYis800dollarsperunit.T hecompany′smonthlyfixedcostsare5000dollars.T hedemandf orproductXisatmost20unitspermonth, andthedemandforproductYisatmost30unitspermonth.T hecompanycanproduceatmost30unitsof productsintotalpermonth.Howmanyunitsofeachproductshouldthecompanyproduceinordertomaximizetheirprofit?
Solution
Step 1: Define the variables. Let xbe the number of units of product Xto
produce, and ybe the number of units of product Yto produce.
Step 2: Write the objective function. The profit from product Xis 600x−
300x= 300x, and the profit from product Yis 800y−500y= 300y. Therefore,
the total profit function is
P(x, y) = 300x+ 300y.
Step 3: Write the constraints. The constraints are:
6
Cost constraint: 300x+ 500y+ 5000 ≤P(x, y)
Demand constraint for product X:x≤20
Demand constraint for product Y:y≤30
Production capacity constraint: x+y≤30
Step 4: Set up the optimization problem. Maximize P(x, y) = 300x+ 300y
subject to the constraints above.
Step 5: Solve the optimization problem. The corner points of the feasible
region are:
(0,0)
(20,0)
(0,30)
(10,20)
Calculate the profit at each corner point:
(0,0): P(0,0) = 0
(20,0): P(20,0) = 6000
(0,30): P(0,30) = 9000
(10,20): P(10,20) = 9000
Therefore, the maximum profit of 9000 dollars occurs when the company
produces 10 units of product Xand 20 units of product Y.
Question 8
Question
A company produces two types of products, Product A and Product B. The
company has 400 hours of labor available each week. Product A requires 2
hours of labor to produce each unit, while Product B requires 3 hours of labor.
The company makes a profit of
$
20 for each unit of Product A sold and
$
30 for
each unit of Product B sold. Due to limited resources, the company can only
produce a total of 200 units of products each week.
Let xbe the number of units of Product A and ybe the number of units
of Product B produced. Formulate an optimization problem to maximize the
company’s weekly profit.
7
Solution
Step 1: Define the objective function and constraints:
Let’s denote the profit from selling one unit of Product A as PA= $20 and
the profit from selling one unit of Product B as PB= $30. The objective is
to maximize the total profit (Z) of the company. We can express the objective
function as:
Z= 20x+ 30y
The company has two constraints: 1. Labor constraint: The total labor
hours required by Product A and Product B must not exceed 400 hours available
each week:
2x+ 3y≤400
2. Production constraint: The company can produce a total of 200 units of
products each week:
x+y≤200
Step 2: Graph the feasible region:
To find the feasible region, we need to graph the two constraints. We’ll plot
the lines 2x+ 3y= 400 and x+y= 200 on a graph.
Step 3: Identify the corner points of the feasible region:
From the graph, we can see that the feasible region is a bounded area. We
need to find the corner points of this region.
Step 4: Calculate the objective function at each corner point:
Now, we evaluate the objective function Z= 20x+ 30yat each corner point
of the feasible region.
Step 5: Determine the maximum profit:
Compare the values of the objective function at each corner point to deter-
mine the maximum profit achievable by the company and at what values of x
and yit occurs.
Question 9
Question
A company manufactures two types of products, Xand Y. Product Xrequires 4
hours of machine time and 2 hours of labor to produce, while product Yrequires
3 hours of machine time and 5 hours of labor. The company has a maximum of
60 hours of machine time and 100 hours of labor available each week. Product
Xgenerates a profit of
$
50 each, while product Ygenerates a profit of
$
40 each.
How many units of each product should the company produce to maximize its
profit?
8
Solution
Let xbe the number of units of product Xto produce, and ybe the number of
units of product Yto produce.
Step 1: Define the objective function and constraints
The objective is to maximize the profit. The profit function is given by:
Profit = 50x+ 40y
The constraints are the available machine time and labor:
4x+ 3y≤60 (Machine time constraint)
2x+ 5y≤100 (Labor constraint)
And of course, the non-negativity constraint:
x, y ≥0
Step 2: Set up the feasible region
Graph the inequalities to find the feasible region.
Step 3: Find the corner points of the feasible region
Solve the system of equations to find the corner points of the feasible region.
Step 4: Test the corner points in the objective function
Substitute the corner points into the profit function to find the maximum
profit.
Step 5: Determine the optimal solution
Identify the values of xand ythat result in the maximum profit.
Question 10
Question
A farmer wants to enclose a rectangular field using a fixed amount of fencing.
If the farmer has 3200 feet of fencing available and wants to maximize the area
of the field, what should the dimensions of the field be?
Solution
Let’s denote the length of the rectangular field as land the width as w. The
total amount of fencing used will be equal to the perimeter of the rectangle,
which is given by 2l+ 2w.
Given that the farmer has 3200 feet of fencing available, we have the equa-
tion:
2l+ 2w= 3200
Solving this equation for one variable, we can express win terms of l,w=
1600 −l.
9
The area of the rectangular field is given by A=lw. Substituting w=
1600 −linto the area formula, we get:
A=l(1600 −l) = 1600l−l2
To find the dimensions of the field that maximize the area, we need to find
the critical points by taking the derivative of the area function with respects to
land setting it equal to zero:
dA
dl =d
dl (1600l−l2) = 1600 −2l
Step 1: Set dA
dl = 0 and solve for l:
1600 −2l= 0
2l= 1600
l= 800
So, l= 800 feet. To find the width, we can use our expression w= 1600 −l:
w= 1600 −800
w= 800
Therefore, the dimensions of the field that maximizes the area are length
l= 800 feet and width w= 800 feet.
Question 11
Question
A company manufactures two products, Product A and Product B. Product A
yields a profit of
$
10 per unit and takes 2 hours to manufacture, while Product
B yields a profit of
$
15 per unit and takes 3 hours to manufacture. The company
has a total of 240 hours of manufacturing time available. How many units of
each product should the company produce to maximize profit?
Solution
Step 1: Define the decision variables. Let xrepresent the number of units of
Product A to produce, and let yrepresent the number of units of Product B to
produce.
Step 2: Write the objective function. The total profit, P, is given by P=
10x+ 15y.
Step 3: Write the constraint. The constraint for the available manufacturing
hours is 2x+ 3y≤240.
10
Step 4: Determine the feasible region. To graph the constraint, first plot the
line 2x+3y= 240. To find the intercepts, set x= 0 to get 3y= 240 =⇒y= 80,
and set y= 0 to get 2x= 240 =⇒x= 120. Plot these points on the graph
and draw the line connecting them. Shade the region below this line (since we
want 2x+ 3y≤240).
Step 5: Determine the corner points of the feasible region. To find the
corner points, we need to find the intersections of the constraint lines. The
corner points are (0,80), (120,0), and (80,40).
Step 6: Calculate the objective function at each corner point. - For (0,80):
P= 10(0) + 15(80) = 1200 - For (120,0): P= 10(120) + 15(0) = 1200 - For
(80,40): P= 10(80) + 15(40) = 1600
Step 7: Determine the optimal solution. The maximum profit of
$
1600 is
achieved when producing 80 units of Product A and 40 units of Product B.
Question 12
Question
A company manufactures two types of products: Product A and Product B.
The company has a limited budget and production capacity each month. It
is estimated that each unit of Product A requires
$
5 in materials and 2 hours
of labor, while each unit of Product B requires
$
8 in materials and 3 hours of
labor. The company can sell Product A for
$
12 per unit and Product B for
$
15 per unit. If the company’s budget for materials is
$
2000 per month and
the labor hours are limited to 800 per month, 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 ybe the number of units of Product B produced.
Step 2: Write the objective function. The objective is to maximize the
profit. The profit is given by the revenue minus the cost. The revenue is
12x+ 15y, and the cost is 5x+ 8y. Therefore, the profit function is P(x, y) =
12x+ 15y−(5x+ 8y), which simplifies to P(x, y)=7x+ 7y.
Step 3: Write the constraints. The constraints are based on the available
budget for materials and labor. For materials: 5x+ 8y≤2000, representing
the budget constraint. For labor: 2x+ 3y≤800, representing the labor hour
constraint. And x≥0, y≥0, since the number of units cannot be negative.
Step 4: Draw the feasible region. To graph the feasible region, we first need
to find the intercepts of the constraints. For the materials constraint: When
x= 0, 8y= 2000 ⇒y= 250. When y= 0, 5x= 2000 ⇒x= 400. For the
labor constraint: When x= 0, 3y= 800 ⇒y=800
3≈266.67. When y= 0,
2x= 800 ⇒x= 400.
11
The feasible region is bounded by the lines x= 0, y= 0, 5x+ 8y= 2000,
and 2x+ 3y= 800.
Step 5: Find the corner points of the feasible region. The corner points are
the intersections of the lines forming the feasible region. Solving the system of
equations, we find the corner points: A(0,0), B(400,0), C(267,266), D(0,250).
Step 6: Evaluate the profit function at each corner point. Calculate the profit
at each corner point: P(0,0) = 7(0)+7(0) = 0 P(400,0) = 7(400)+7(0) = 2800
P(267,266) = 7(267) + 7(266) = 3739 P(0,250) = 7(0) + 7(250) = 1750
Step 7: Determine the maximum profit. The maximum profit is achieved
at the corner point C(267,266) with a profit of
$
3739. Therefore, the company
should produce 267 units of Product A and 266 units of Product B to maximize
its profit.
Question 13
Question
A company produces two products, Product A and Product B. To make each
unit of Product A requires 3 hours of labor and 2 hours of machine time. To
make each unit of Product B requires 2 hours of labor and 4 hours of machine
time. Each unit of Product A can be sold for
$
50 and each unit of Product B
can be sold for
$
60. The company has a maximum of 240 hours of labor and
200 hours of machine time available. How many units of each product should
the company produce to maximize revenue?
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 revenue,
which is given by R= 50x+ 60y.
Step 3: Write the constraints based on available labor and machine time. We
have: - Labor constraint: 3x+2y≤240 - Machine time constraint: 2x+4y≤200
Step 4: Non-negativity constraint: We also have x≥0 and y≥0 since we
cannot produce negative units of a product.
Step 5: Plot the constraints on a graph and shade the feasible region. The
feasible region is the area where all constraints are satisfied.
Step 6: Calculate corner points of the feasible region: 1. (0,0) 2. (0,50) 3.
(40,40) 4. (80,20)
Step 7: Evaluate the objective function at each corner point: 1. (0,0):
R= 50(0) + 60(0) = $0 2. (0,50): R= 50(0) + 60(50) = $3000 3. (40,40):
R= 50(40) + 60(40) = $4000 4. (80,20): R= 50(80) + 60(20) = $5200
Step 8: Determine the maximum revenue and the corresponding production
quantities: The maximum revenue of
$
5200 occurs at the corner point (80,20).
12
Therefore, the company should produce 80 units of Product A and 20 units of
Product B to maximize revenue.
Question 14
Question
A company produces two types of products, Product A and Product B. It costs
$
6 to produce one unit of Product A and
$
8 to produce one unit of Product
B. The company can sell Product A for
$
10 per unit and Product B for
$
12
per unit. The company has a limit of
$
3000 for production cost per day and
a limit of 400 units of Product A and 500 units of Product B to produce per
day. How many units of each product should the company produce to maximize
their profit?
Solution
Let xbe the number of units of Product A produced per day, and ybe the
number of units of Product B produced per day. The objective is to maximize
the profit, P, which is given by
P= 10x+ 12y.
Subject to the following constraints:
6x+ 8y≤3000,
x≤400,
y≤500.
The company needs to maximize the profit function subject to these con-
straints. To solve this optimization problem, we use the method of Lagrange
multipliers.
Step 1: Set up the Lagrangian function L:
L(x, y, λ) = 10x+ 12y−λ(6x+ 8y−3000) −µ(x−400) −ν(y−500).
Step 2: Compute the partial derivatives of the Lagrangian function:
∂L
∂x = 10 −6λ−µ= 0,
∂L
∂y = 12 −8λ−ν= 0,
∂L
∂λ =−6x−8y+ 3000 = 0,
∂L
∂µ =−x+ 400 = 0,
13
∂L
∂ν =−y+ 500 = 0.
Step 3: Solve the system of equations to find the optimal values of x,y,λ,
µ, and ν.
Solving the system of equations, we find x= 320, y= 400, λ=1
3,µ=−1
2,
ν=−1
2.
Therefore, the company should produce 320 units of Product A and 400
units of Product B to maximize their profit.
Question 15
Question
A manufacturer produces two types of laptops: basic laptops and advanced
laptops. Each basic laptop earns a profit of
$
200, while each advanced laptop
earns a profit of
$
400. To produce a basic laptop, the manufacturer requires 2
hours of assembly time and 1 hour of testing time. To produce an advanced
laptop, the manufacturer requires 3 hours of assembly time and 2 hours of testing
time. The total assembly time available is 60 hours, and the total testing time
available is 40 hours. How many of each type of laptop should the manufacturer
produce to maximize profit?
Solution
Let xbe the number of basic laptops produced and ybe the number of advanced
laptops produced.
Step 1: Write the objective function The objective is to maximize the
profit. The total profit is given by:
P= 200x+ 400y
Step 2: Write the constraints The constraints are based on the available
assembly and testing time:
2x+ 3y≤60 (Assembly time constraint)
1x+ 2y≤40 (Testing time constraint)
x, y ≥0 (Non-negativity constraint)
Step 3: Set up the feasible region To find the feasible region, we graph
the inequalities on the xy-plane.
Step 4: Find the corner points of the feasible region The corner
points of the feasible region are the intersections of the boundary lines. These
are found to be:
A(0,0)
B(20,0)
14
C(10,15)
D(0,20)
Step 5: Evaluate the objective function at each corner point
PA= 200(0) + 400(0) = 0
PB= 200(20) + 400(0) = 4000
PC= 200(10) + 400(15) = 8000
PD= 200(0) + 400(20) = 8000
Step 6: Determine the maximum profit The maximum profit of
$
8000
is attained when producing 10 basic laptops and 15 advanced laptops.
Question 16
Question
A manufacturing company produces two types of products, Xand Y, which
are sold for
$
20 and
$
30 per unit, respectively. To produce one unit of product
Xrequires 3 hours of labor and 2 hours of machine time, while producing one
unit of product Yrequires 2 hours of labor and 4 hours of machine time. The
company has 60 hours of labor and 32 hours of machine time available each week.
How many units of each product should be produced to maximize revenue?
Solution
Step 1: Define the variables. Let xrepresent the number of units of product X
and yrepresent the number of units of product Yproduced.
Step 2: Write the objective function. The objective is to maximize revenue,
which is given by R= 20x+ 30y.
Step 3: Write the constraints: - Labor constraint: 3x+ 2y≤60 - Machine
time constraint: 2x+ 4y≤32 - Non-negativity constraint: x≥0, y≥0
Step 4: Plot the constraints on a graph to find the feasible region. The
feasible region is the area where all constraints are satisfied.
Step 5: Find the corner points of the feasible region by solving the system of
inequalities formed by the constraints. The corner points are the intersections
of the constraint lines.
Step 6: Evaluate the objective function at each corner point to determine
the maximum revenue.
Step 7: Make the final conclusion on the optimal production quantities to
maximize revenue.
15
Question 17
Question
A company produces two types of smartphones: Model A and Model B. Each
Model A smartphone sells for
$
500, while each Model B smartphone sells for
$
700. The company can produce up to 3000 smartphones per week. It takes
4 hours to produce a Model A smartphone and 5 hours to produce a Model B
smartphone. The company has 1800 hours of production time available each
week. How many of each type of smartphone should the company produce to
maximize revenue?
Solution
Step 1: Define the decision variables. Let xbe the number of Model A smart-
phones produced, and ybe the number of Model B smartphones produced.
Step 2: Write the objective function. The revenue function to be maximized
is given by:
R(x, y) = 500x+ 700y
Step 3: Write the constraint equations. The constraints are:
x≥0
y≥0
4x+ 5y≤1800
x+y≤3000
Step 4: Solve the system of equations by graphing the feasible region defined
by the constraints and identifying the corner points. The corner points are: (0,
0), (0, 3000), (450, 2550), and (750, 1500).
Step 5: Calculate the revenue at each corner point: - Point (0, 0): R(0,0) =
500(0) + 700(0) = $0 - Point (0, 3000): R(0,3000) = 500(0) + 700(3000) =
$2,100,000 - Point (450, 2550): R(450,2550) = 500(450)+700(2550) = $2,100,000
- Point (750, 1500): R(750,1500) = 500(750) + 700(1500) = $2,100,000
Step 6: Compare the revenue at each corner point to determine the maximum
value. Thus, the maximum revenue of
$
2,100,000 can be achieved by producing
0 Model A smartphones and 3000 Model B smartphones, or by producing 450
Model A smartphones and 2550 Model B smartphones, or by producing 750
Model A smartphones and 1500 Model B smartphones.
Question 18
Question
A company produces and sells two types of products: Product A and Product
B. Each unit of Product A requires 2 hours of labor and yields a profit of
$
50,
16
while each unit of Product B requires 3 hours of labor and yields a profit of
$
60.
The company has 200 hours of labor available each week. How many units of
each product should the company produce and sell in order to maximize their
weekly profit?
Solution
Step 1: Let’s denote the number of units of Product A produced and sold as x
and the number of units of Product B produced and sold as y. The objective
function to maximize profit is P= 50x+ 60y.
Step 2: We need to establish the constraints for this optimization problem.
The first constraint is the labor constraint: 2x+ 3y≤200 (since the company
has 200 hours of labor available each week).
Step 3: We also have the non-negativity constraints: x≥0 and y≥0.
Step 4: We need to find the critical points. To do this, we set up the
system of equations by combining the objective function and the constraint:
(2x+ 3y= 200
P= 50x+ 60y.
Step 5: Let’s solve the system of equations. We can first solve for xin terms
of yfrom the labor constraint: 2x+ 3y= 200 =⇒x=200−3y
2.
Step 6: Substitute x=200−3y
2into the profit equation P= 50x+ 60yto get
the profit function in terms of y:P(y) = 50 200−3y
2+ 60y.
Step 7: Simplify the profit function: P(y) = 100 −75y+ 60y= 100 −15y.
Step 8: To maximize profit, we need to find the derivative of P(y) and set
it equal to 0: dP
dy =−15 = 0.
Step 9: Since the derivative is a constant value, there are no critical points.
So, we evaluate the profit at the endpoints of the feasible region, which are y= 0
and y= 200/3.
Step 10: Calculate the profits at these endpoints: P(0) = 100 and P(200/3) =
100 −15(200/3) = 100 −100 = 0.
Step 11: Compare the profits at the endpoints. The company should produce
and sell only Product A to maximize their weekly profit. Therefore, the company
should produce and sell 100 units of Product A each week.
Question 19
Question
A company manufactures two types of products, A and B. Product A requires
3 hours of labor and 4 hours of machine time, while product B requires 4 hours
of labor and 2 hours of machine time. Each unit of product A yields a profit
of 50, whileeachunitof productByieldsaprofitof 40. If the company has a max-
imum of 240 hours of labor and 160 hours of machine time available per week,
how many units of each product should they produce to maximize their profit?
17
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.
The total profit can be represented as:
P= 50x+ 40y
Step 3: Write the constraints.
The constraints are based on the available labor and machine time:
(3x+ 4y≤240 (Labor constraint)
4x+ 2y≤160 (Machine time constraint)
Step 4: Plot the feasible region.
Solving the labor constraint and machine time constraint, we get the following
feasible region:
xy
(0,0)
Step 5: Find corner points of the feasible region. By solving the two linear
equations, we find the corner points:
A(0, 0), B(40, 0), C(30, 60), D(0, 60)
Step 6: Evaluate the objective function at each corner point.
Corner Point (x, y) Profit (P)
A(0,0) 0
B(40,0) 2000
C(30,60) 3600
D(0,60) 2400
Step 7: Determine the optimal solution.
The maximum profit of 3600isobtainedatpointC(30,60), whichmeansthecompanyshouldproduce30unitsofproductAand60unitsof productBtomaximizeitsprofit.
Question 20
Question
A company manufactures two types of products, A and B. Each unit of product
A requires 3 hours of labor and 5 units of material, while each unit of product
B requires 4 hours of labor and 6 units of material. Each unit of product A sold
yields a profit of
$
50, while each unit of product B sold yields a profit of
$
60.
The company can use up to 300 hours of labor and 400 units of material per
day. What is the maximum daily profit the company can make?
18
Solution
Let xbe the number of units of product A produced and sold per day, and let
ybe the number of units of product B produced and sold per day.
Step 1: Write the objective function. The objective is to maximize the
daily profit, which can be expressed as
P= 50x+ 60y
Step 2: Write the constraints. The constraints come from the available
labor and material:
3x+ 4y≤300 (Labor constraint)
5x+ 6y≤400 (Material constraint)
Step 3: Solve the system of inequalities. We first graph the feasible region
formed by the constraints. Solving each constraint for y, we get:
y≤ − 3
4x+ 75 (Labor constraint)
y≤ − 5
6x+200
6(Material constraint)
Step 4: Find the intersection points. Solving the system of equations, we
find the intersection points of the lines y=−3
4x+ 75 and y=−5
6x+200
6. This
gives us the points (60,15), (120,0), and (0,75).
Step 5: Test the corner points. We evaluate the objective function at the
corner points of the feasible region: (0, 75), (60, 15), and (120, 0). Calculating
the profit for each point, we find:
P(0,75) = 75 ×50 = 3750
P(60,15) = 60 ×15 ×60 = 5400
P(120,0) = 120 ×60 = 7200
Step 6: Determine the maximum. Since the maximum profit occurs at
the point (120,0), the company can make a maximum daily profit of
$
7200 by
producing and selling 120 units of product A and 0 units of product B.
Question 21
Question
A manufacturer produces two types of laptops, type A and type B. It takes 2
hours to produce one unit of type A and 3 hours to produce one unit of type
B. The manufacturer’s labor force is limited to 100 hours per week. The profit
for each unit of type A is
$
200 and for each unit of type B is
$
250. If the
manufacturer wants to maximize their weekly profit, how many units of each
type should they produce?
19
Solution
Step 1: Define the variables. Let xbe the number of units of type A laptops
produced per week and ybe the number of units of type B laptops produced
per week.
Step 2: Write the objective function. The objective is to maximize the total
profit, given by P(x, y) = 200x+ 250y.
Step 3: Write the constraints. The labor constraint is 2x+ 3y≤100 (total
labor hours cannot exceed 100 hours). Also, x≥0 and y≥0 since the number
of units produced cannot be negative.
Step 4: Find the feasible region by graphing the constraints. The feasible
region is bounded by the x-axis, y-axis, and the line 2x+ 3y= 100.
Step 5: Find the corner points of the feasible region. The corner points are
(0, 0), (0, 33.33), and (50, 0).
Step 6: Evaluate the objective function at each corner point. For (0, 0):
P(0,0) = 200(0)+250(0) = 0 For (0, 33.33): P(0,33.33) = 200(0)+250(33.33) =
$8332.50 For (50, 0): P(50,0) = 200(50) + 250(0) = $10000
Step 7: Determine the maximize profit. The maximum profit of
$
10000 is
achieved when 50 units of type A laptops and 0 units of type B laptops are
produced.
Question 22
Question
A company wants to produce two types of products, A and B. The company can
produce up to 500 units of product A per day and up to 800 units of product B
per day. Each unit of product A requires 3 hours of labor and generates a profit
of
$
10, while each unit of product B requires 5 hours of labor and generates
a profit of
$
15. The company has a total of 2000 hours of labor available per
day. How many units of each product should the company produce per day to
maximize profit?
Solution
Let’s denote the number of units of product A produced per day as xand the
number of units of product B produced per day as y.
Step 1: Identify the objective function and constraints The objective
is to maximize profit, which is given by P= 10x+ 15y. The constraints are:
- Labor constraint: 3x+ 5y≤2000 - Production limits: 0 ≤x≤500 and
0≤y≤800
Step 2: Graph the feasible region To graph the feasible region for the
given constraints, we plot the lines 3x+ 5y= 2000, x= 0, x= 500, y= 0, and
y= 800. The feasible region is the polygon formed by these lines.
Step 3: Find the vertices of the feasible region The vertices of the
feasible region are the points of intersection of the lines forming the boundaries
20
of the region. Solving the equations leads to the following vertices: A: (0, 0),
B: (0, 400), C: (400, 320), D: (500, 160), E: (500, 0)
Step 4: Evaluate the objective function at each vertex Now we
calculate the profit at each of the vertices: A: P(0,0) = 0 B: P(0,400) =
15(400) = 6000 C: P(400,320) = 10(400) + 15(320) = 7600 D: P(500,160) =
10(500) + 15(160) = 8000 E: P(500,0) = 10(500) = 5000
Step 5: Determine the optimal solution The maximum profit of
$
8000
is achieved at point D, where the company should produce 500 units of product
A and 160 units of product B per day to maximize profit.
Question 23
Question
A company produces two types of products, A and B, using three machines:
M1, M2, and M3. The production time for each unit of product A on machines
M1, M2, and M3 is 2, 3, and 4 hours respectively. For product B, the production
time on machines M1, M2, and M3 is 3, 2, and 5 hours respectively. Machine
M1 is available for 80 hours, machine M2 for 60 hours, and machine M3 for
100 hours. The profit for each unit of product A is
$
20 and for product B is
$
30. How many units of each product should the company produce to maximize
profit?
Solution
Step 1: Define the decision variables. Let xbe the number of units of product
A to produce, and ybe the number of units of product B to produce.
Step 2: Write the objective function. The total profit to maximize is given
by Z= 20x+ 30y.
Step 3: Write the constraints based on the production time available on each
machine: - 2x+ 3y≤80 (Machine M1 constraint) - 3x+ 2y≤60 (Machine M2
constraint) - 4x+ 5y≤100 (Machine M3 constraint)
Step 4: Write the non-negativity constraints: - x≥0 - y≥0
Step 5: Set up the linear programming model: Maximize Z= 20x+ 30y
subject to the constraints:
2x+ 3y≤80
3x+ 2y≤60
4x+ 5y≤100
x≥0
y≥0
Step 6: Solve the linear programming model using graphical or simplex
method to find the optimal values of xand y.
21
Question 24
Question
A manufacturing company produces two types of smartphones: model A and
model B. Each model requires a certain number of labor hours and materials to
produce. Model A requires 4 labor hours and 2 units of material, while model B
requires 6 labor hours and 3 units of material. The company has 30 labor hours
and 15 units of material available per day. Let xbe the number of model A
smartphones produced and ybe the number of model B smartphones produced.
If the profit from selling model A is 200perunitandtheprofitfromsellingmodelBis300
per unit, how many of each model should the company produce daily to maxi-
mize profit?
Solution
Step 1: Define the objective function. Let P(x, y) represent the profit function.
The profit from selling model A is 200perunitandtheprofitfromsellingmodelBis300
per unit. So, the objective function is:
P(x, y) = 200x+ 300y
Step 2: Identify the constraints. The constraints in this problem are the
labor hours and material available:
(4x+ 6y≤30 (Labor hours constraint)
2x+ 3y≤15 (Material constraint)
Step 3: Graph the feasible region. To find the feasible region, plot the lines
representing the constraints and shade the feasible region where they intersect.
Step 4: Find the corner points of the feasible region. The corner points of
the feasible region are the intersections of the lines representing the constraints.
Step 5: Evaluate the objective function at each corner point. Calculate
P(x, y) for each corner point.
Step 6: Determine the maximum profit. Identify the corner point that yields
the maximum profit by comparing the values of P(x, y) at each corner point.
Step 7: Conclusion. The company should produce a certain number of model
A smartphones and a certain number of model B smartphones daily to maximize
profit.
Question 25
Question
A company manufactures two types of products, A and B. Each unit of product
A requires 3 hours of labor and 1 hour of machine time, while each unit of
product B requires 2 hours of labor and 2 hours of machine time. The company
22
has 100 hours of labor and 80 hours of machine time available per week. If
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
profit?
Solution
Step 1: Let’s define our decision variables. Let xbe the number of units of
product A produced per week, and ybe the number of units of product B
produced per week.
Step 2: Write the constraints based on the labor hours available. The labor
constraint can be formulated as: 3x+ 2y≤100.
Step 3: Write the constraints based on the machine hours available. The
machine constraint can be formulated as: x+ 2y≤80.
Step 4: Write the non-negativity constraint. Since the number of units
produced cannot be negative, we have x≥0 and y≥0.
Step 5: Set up the objective function. The objective is to maximize profit,
which can be expressed as Z= 30x+ 40y.
Step 6: Combine all the constraints and the objective function to form the
linear programming problem: Maximize Z= 30x+40ysubject to: 3x+2y≤100,
x+ 2y≤80, x≥0, y≥0.
Step 7: Solve the linear programming problem using graphical or simplex
method to find the optimal values of xand ythat maximize profit.
This question involves formulating a linear programming problem and opti-
mizing it to maximize profit, making it a challenging problem in Optimization
and Decision Making.
Question 26
Question
A company produces two types of products: Product A and Product B. Product
A sells for
$
10 per unit and requires 4 hours of labor to produce. Product B
sells for
$
15 per unit and requires 6 hours of labor to produce. The company
has a total of 40 hours of labor available each day. How many units of each
product should the company produce in order to maximize its daily revenue?
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 revenue generated can be calculated by multiplying the number of
23
units produced by their respective selling prices:
Revenue = 10x+ 15y
Step 3: Write the constraint equations.
The total labor available is limited to 40 hours per day, so we have the constraint
equation:
4x+ 6y≤40
Step 4: Find the feasible region.
To find the feasible region, we need to graph the inequality 4x+ 6y≤40. When
x= 0, 6y≤40 which gives y≤40
6=20
3≈6.67. When y= 0, 4x≤40 which
gives x≤10. Therefore, the feasible region is a polygon with vertices at (0,0),
(0,6.67), and (10,0).
Step 5: Find the critical points.
The critical points occur at the vertices of the feasible region: - (0,0) - (0,6.67)
- (10,0)
Step 6: Evaluate the objective function at each critical point.
For (0,0):
Revenue = 10(0) + 15(0) = $0
For (0,6.67):
Revenue = 10(0) + 15(6.67) = $100.05
For (10,0):
Revenue = 10(10) + 15(0) = $100
Step 7: Determine the optimal solution.
The maximum revenue is achieved when the company produces 10 units of
Product A and 0 units of Product B, yielding a daily revenue of
$
100.
Question 27
Question
A company manufactures 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, while each unit of Product B requires 3 hours of labor and 3 hours
of machine time. The company has 400 hours of labor and 300 hours of
machine time available each week. If the profit per unit of Product A is
50andtheprofitperunitof P roductBis60, how many units of each product should
the company produce to maximize its weekly profit?
Solution
Step 1: Define the decision variables. Let xbe the number of units of Product
A to produce and ybe the number of units of Product B to produce.
24
Step 2: Formulate the objective function. The objective is to maximize the
weekly profit, given by Z= 50x+ 60y.
Step 3: Formulate the constraints. The constraints are based on the available
labor and machine time:
4x+ 3y≤400 (Labor constraint)
2x+ 3y≤300 (Machine time constraint)
Step 4: Plot the feasible region determined by the constraints. To do this,
we first find the intersection points of the two lines formed by the constraints:
4x+ 3y= 400 ⇒y=−4
3x+400
3
2x+ 3y= 300 ⇒y=−2
3x+ 100
Solving the system of equations, we find the intersection point to be (120,40).
Step 5: Test the corner points of the feasible region in the objective function.
The corner points are: (0,0), (0,100), (60,80), (120,40). Calculating the profit
at each corner point:
Z(0,0) = 0
Z(0,100) = 6000
Z(60,80) = 7400
Z(120,40) = 8000
Step 6: Determine the optimal solution. The company should produce 120
units of Product A and 40 units of Product B to maximize its weekly profit to
8000.
Question 28
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 hours of machine time
to produce, while each unit of Product B requires 2 hours of labor and 1 hour
of machine time to produce. The total available labor hours are 360 hours and
the total available machine hours are 240 hours. The profit from each unit of
Product A is
$
30 and the profit from each unit of Product B is
$
20. How many
units of each product should the company produce in order to maximize profit?
Solution
Let xbe the number of units of Product A produced and ybe the number of
units of Product B produced.
25
Step 1: Define the objective function. The objective is to maximize
profit. The total profit can be expressed as:
P= 30x+ 20y
Step 2: Write the constraints. The constraints are the total labor hours
and machine hours used:
Labor hours:3x+ 2y≤360
Machine hours:2x+y≤240
Non-negativity constraints:
x≥0, y ≥0
Step 3: Graph the feasible region. To graph the feasible region, we first
plot the lines representing the constraints:
3x+ 2y= 360
2x+y= 240
x= 0, y= 0
From the graph, we find the feasible region where the constraints are satisfied.
Step 4: Find the corner points of the feasible region. The corner
points of the feasible region are the intersection points of the constraint lines.
We find the coordinates of the corner points by solving the systems of equations.
Step 5: Evaluate the objective function at each corner point. Eval-
uate the objective function P= 30x+ 20yat each corner point to find the
maximum profit.
Step 6: Determine the optimal solution. The maximum profit value
will occur at one of the corner points. The solution with the highest profit is the
optimal solution, indicating the number of units of each product the company
should produce to maximize profit.
Question 29
Question
A company produces two types of products, Xand Y, using two machines, A
and B. Each unit of product Xrequires 4 hours on machine Aand 2 hours on
machine B, while each unit of product Yrequires 3 hours on machine Aand 3
hours on machine B. Machine Acan be used up to 60 hours per week, while
machine Bcan be used up to 40 hours per week. The profit per unit of product
Xis
$
30 and the profit per unit of product Yis
$
40. How many units of each
product should the company produce in order to maximize the weekly profit?
26
Solution
Step 1: Let xbe the number of units of product Xproduced, and ybe the
number of units of product Yproduced.
Step 2: The objective function is to maximize the profit, which can be
expressed as P= 30x+ 40y.
Step 3: The constraints are: - Product Xuses 4 hours on machine Aand
product Yuses 3 hours on machine A, so the constraint for machine Ais 4x+
3y≤60. - Product Xuses 2 hours on machine Band product Yuses 3 hours
on machine B, so the constraint for machine Bis 2x+ 3y≤40. - Since the
number of products cannot be negative, x≥0 and y≥0.
Step 4: Now we will solve the linear programming problem using the simplex
method. The following tableaux summarizes the problem:
Iteration x y Machine A Machine B Profit Pivot Column
Initial 0 0 4 3 0
x1 0 4 3 30 x
y0 1 2 3 40 y
Step 5: From the initial tableau, the pivot is in row 2 and column 2. Divide
row 2 by 3:
Iteration x y Machine A Machine B Profit Pivot Column
Initial 0 0 4 3 0
x1 0 4 3 30 x
y0 1 2/3 1 40/3y
Step 6: Perform the next iteration, and continue until the optimal solution is
reached. The optimal solution will provide the values of xand ythat maximize
the weekly profit.
Question 30
Question
A company manufactures two types of products, Aand B. It costs the company
$
5 to produce each unit of Aand
$
8 to produce each unit of B. The company
can sell each unit of Afor
$
12 and each unit of Bfor
$
15. The company has a
maximum production capacity of 200 units. How many units of each product
should the company produce in order to maximize its profit?
27
Solution
Let xbe the number of units of product Aand ybe the number of units of
product Bproduced.
Step 1: Write the objective function The profit function is given by:
P(x, y) = 12x+ 15y−5x−8y
which simplifies to:
P(x, y)=7x+ 7y
Step 2: Write the constraint The constraint on the production capacity
is:
x+y≤200
Step 3: Set up the optimization problem The company wants to max-
imize profit subject to the constraint:
Maximize P(x, y)=7x+ 7y
subject to
x+y≤200
Step 4: Find the feasible region Plotting the constraint x+y≤200 on
the xy-plane gives us a feasible region bounded by the line x+y= 200 and the
axes.
Step 5: Find critical points The critical points occur at the vertices of
the feasible region: (0, 0), (0, 200), (200, 0)
Step 6: Evaluate the objective function at the critical points Cal-
culating P(x, y) at these critical points: - (0,0) : P(0,0) = 7(0) + 7(0) = 0 -
(0,200) : P(0,200) = 7(0) + 7(200) = 1400 - (200,0) : P(200,0) = 7(200) +
7(0) = 1400
Step 7: Conclusion Therefore, to maximize profit, the company should
produce 200 units of product Band no units of product Ato achieve a maximum
profit of
$
1400.
28
Question 5
Question
A company manufactures two types of smartphones: Model A and Model B.
It takes 3 hours to assemble Model A and 5 hours to assemble Model B. The
company can allocate up to 40 hours a week for assembling smartphones. Model
A generates a profit of
$
200 each, while Model B generates a profit of
$
300 each.
If the company’s goal is to maximize profit, how many of each model should
they produce weekly?
Solution
Step 1: Define the decision variables. Let xbe the number of Model A smart-
phones produced weekly, and let ybe the number of Model B smartphones
produced weekly.
Step 2: Write the objective function. The objective is to maximize profit,
which can be represented as: P(x, y) = 200x+ 300y
Step 3: Write the constraint equations. The constraint on the total hours
available for assembling smartphones is: 3x+ 5y≤40
Step 4: Solve the optimization problem. To maximize profit, we need to solve
the following linear programming problem: Maximize P(x, y) = 200x+ 300y
Subject to: 3x+ 5y≤40 x≥0, y ≥0
Step 5: Plot the feasible region. To find the feasible region, we need to graph
the constraint equation 3x+ 5y= 40. The feasible region will be the area below
or on the line 3x+ 5y= 40 and in the first quadrant.
Step 6: Find the corner points of the feasible region. The corner points of
the feasible region are the intersection points of the boundary lines: 3x+5y= 40
with the axes.
Step 7: Evaluate the objective function at each corner point. - At the point
(0, 8): P(0,8) = 200(0) + 300(8) = 2400 - At the point 40
3,0:P40
3,0=
200 40
3+ 300(0) = 2666.6
Step 8: Determine the solution. To maximize profit, the company should
produce 8 Model A smartphones and 0 Model B smartphones weekly. This will
result in a weekly profit of
$
2400.
Question 6
Question
A company manufactures two types of products, Aand B. The profit per unit
for product Ais 3 and for product Bis 5. It takes 2 hours to manufacture
product Aand 3 hours to manufacture product B. The company has a total of
120 hours of manufacturing time available per week.
If the company wants to maximize its profit, how many units of each product
should it manufacture per week?
5
Solution
Let’s denote the number of units of product Aand Bmanufactured per week
as xand y, respectively.
We need to maximize the total profit P= 3x+ 5ysubject to the constraints:
1. Manufacturing time constraint: 2x+ 3y≤120 2. Non-negativity constraint:
x≥0, y ≥0
To solve this problem, we will set up the following linear programming model:
Maximize P= 3x+ 5y
Subject to 2x+ 3y≤120
x≥0, y ≥0
The feasible region for this linear programming problem is a closed convex
polygon.
Step 1: Identify the corner points of the feasible region by solving the
system of linear inequalities:
2x+ 3y= 120
x= 0
y= 0
By solving the above system of equations, we get the corner points as (0,40),
(60,0), and (0,0).
Step 2: Calculate the objective function value at each corner point: 1.
Point (0,40): P= 3(0) + 5(40) = 200 2. Point (60,0): P= 3(60) + 5(0) = 180
3. Point (0,0): P= 3(0) + 5(0) = 0
Thus, the maximum profit of 200 is achieved when the company manufac-
tures 0 units of product Aand 40 units of product Bper week.
Question 7
Question
A company manufactures two types of products, Xand Y. It costs 300 dollars to
produce one unit of product Xand 500dollarstoproduceoneunitofproductY.T hesellingpriceof productXis600dollarsperunit, andthesellingpriceofproductYis800dollarsperunit.T hecompany′smonthlyfixedcostsare5000dollars.T hedemandf orproductXisatmost20unitspermonth, andthedemandforproductYisatmost30unitspermonth.T hecompanycanproduceatmost30unitsof productsintotalpermonth.Howmanyunitsofeachproductshouldthecompanyproduceinordertomaximizetheirprofit?
Solution
Step 1: Define the variables. Let xbe the number of units of product Xto
produce, and ybe the number of units of product Yto produce.
Step 2: Write the objective function. The profit from product Xis 600x−
300x= 300x, and the profit from product Yis 800y−500y= 300y. Therefore,
the total profit function is
P(x, y) = 300x+ 300y.
Step 3: Write the constraints. The constraints are:
6
Cost constraint: 300x+ 500y+ 5000 ≤P(x, y)
Demand constraint for product X:x≤20
Demand constraint for product Y:y≤30
Production capacity constraint: x+y≤30
Step 4: Set up the optimization problem. Maximize P(x, y) = 300x+ 300y
subject to the constraints above.
Step 5: Solve the optimization problem. The corner points of the feasible
region are:
(0,0)
(20,0)
(0,30)
(10,20)
Calculate the profit at each corner point:
(0,0): P(0,0) = 0
(20,0): P(20,0) = 6000
(0,30): P(0,30) = 9000
(10,20): P(10,20) = 9000
Therefore, the maximum profit of 9000 dollars occurs when the company
produces 10 units of product Xand 20 units of product Y.
Question 8
Question
A company produces two types of products, Product A and Product B. The
company has 400 hours of labor available each week. Product A requires 2
hours of labor to produce each unit, while Product B requires 3 hours of labor.
The company makes a profit of
$
20 for each unit of Product A sold and
$
30 for
each unit of Product B sold. Due to limited resources, the company can only
produce a total of 200 units of products each week.
Let xbe the number of units of Product A and ybe the number of units
of Product B produced. Formulate an optimization problem to maximize the
company’s weekly profit.
7
Solution
Step 1: Define the objective function and constraints:
Let’s denote the profit from selling one unit of Product A as PA= $20 and
the profit from selling one unit of Product B as PB= $30. The objective is
to maximize the total profit (Z) of the company. We can express the objective
function as:
Z= 20x+ 30y
The company has two constraints: 1. Labor constraint: The total labor
hours required by Product A and Product B must not exceed 400 hours available
each week:
2x+ 3y≤400
2. Production constraint: The company can produce a total of 200 units of
products each week:
x+y≤200
Step 2: Graph the feasible region:
To find the feasible region, we need to graph the two constraints. We’ll plot
the lines 2x+ 3y= 400 and x+y= 200 on a graph.
Step 3: Identify the corner points of the feasible region:
From the graph, we can see that the feasible region is a bounded area. We
need to find the corner points of this region.
Step 4: Calculate the objective function at each corner point:
Now, we evaluate the objective function Z= 20x+ 30yat each corner point
of the feasible region.
Step 5: Determine the maximum profit:
Compare the values of the objective function at each corner point to deter-
mine the maximum profit achievable by the company and at what values of x
and yit occurs.
Question 9
Question
A company manufactures two types of products, Xand Y. Product Xrequires 4
hours of machine time and 2 hours of labor to produce, while product Yrequires
3 hours of machine time and 5 hours of labor. The company has a maximum of
60 hours of machine time and 100 hours of labor available each week. Product
Xgenerates a profit of
$
50 each, while product Ygenerates a profit of
$
40 each.
How many units of each product should the company produce to maximize its
profit?
8
Solution
Let xbe the number of units of product Xto produce, and ybe the number of
units of product Yto produce.
Step 1: Define the objective function and constraints
The objective is to maximize the profit. The profit function is given by:
Profit = 50x+ 40y
The constraints are the available machine time and labor:
4x+ 3y≤60 (Machine time constraint)
2x+ 5y≤100 (Labor constraint)
And of course, the non-negativity constraint:
x, y ≥0
Step 2: Set up the feasible region
Graph the inequalities to find the feasible region.
Step 3: Find the corner points of the feasible region
Solve the system of equations to find the corner points of the feasible region.
Step 4: Test the corner points in the objective function
Substitute the corner points into the profit function to find the maximum
profit.
Step 5: Determine the optimal solution
Identify the values of xand ythat result in the maximum profit.
Question 10
Question
A farmer wants to enclose a rectangular field using a fixed amount of fencing.
If the farmer has 3200 feet of fencing available and wants to maximize the area
of the field, what should the dimensions of the field be?
Solution
Let’s denote the length of the rectangular field as land the width as w. The
total amount of fencing used will be equal to the perimeter of the rectangle,
which is given by 2l+ 2w.
Given that the farmer has 3200 feet of fencing available, we have the equa-
tion:
2l+ 2w= 3200
Solving this equation for one variable, we can express win terms of l,w=
1600 −l.
9
The area of the rectangular field is given by A=lw. Substituting w=
1600 −linto the area formula, we get:
A=l(1600 −l) = 1600l−l2
To find the dimensions of the field that maximize the area, we need to find
the critical points by taking the derivative of the area function with respects to
land setting it equal to zero:
dA
dl =d
dl (1600l−l2) = 1600 −2l
Step 1: Set dA
dl = 0 and solve for l:
1600 −2l= 0
2l= 1600
l= 800
So, l= 800 feet. To find the width, we can use our expression w= 1600 −l:
w= 1600 −800
w= 800
Therefore, the dimensions of the field that maximizes the area are length
l= 800 feet and width w= 800 feet.
Question 11
Question
A company manufactures two products, Product A and Product B. Product A
yields a profit of
$
10 per unit and takes 2 hours to manufacture, while Product
B yields a profit of
$
15 per unit and takes 3 hours to manufacture. The company
has a total of 240 hours of manufacturing time available. How many units of
each product should the company produce to maximize profit?
Solution
Step 1: Define the decision variables. Let xrepresent the number of units of
Product A to produce, and let yrepresent the number of units of Product B to
produce.
Step 2: Write the objective function. The total profit, P, is given by P=
10x+ 15y.
Step 3: Write the constraint. The constraint for the available manufacturing
hours is 2x+ 3y≤240.
10
Step 4: Determine the feasible region. To graph the constraint, first plot the
line 2x+3y= 240. To find the intercepts, set x= 0 to get 3y= 240 =⇒y= 80,
and set y= 0 to get 2x= 240 =⇒x= 120. Plot these points on the graph
and draw the line connecting them. Shade the region below this line (since we
want 2x+ 3y≤240).
Step 5: Determine the corner points of the feasible region. To find the
corner points, we need to find the intersections of the constraint lines. The
corner points are (0,80), (120,0), and (80,40).
Step 6: Calculate the objective function at each corner point. - For (0,80):
P= 10(0) + 15(80) = 1200 - For (120,0): P= 10(120) + 15(0) = 1200 - For
(80,40): P= 10(80) + 15(40) = 1600
Step 7: Determine the optimal solution. The maximum profit of
$
1600 is
achieved when producing 80 units of Product A and 40 units of Product B.
Question 12
Question
A company manufactures two types of products: Product A and Product B.
The company has a limited budget and production capacity each month. It
is estimated that each unit of Product A requires
$
5 in materials and 2 hours
of labor, while each unit of Product B requires
$
8 in materials and 3 hours of
labor. The company can sell Product A for
$
12 per unit and Product B for
$
15 per unit. If the company’s budget for materials is
$
2000 per month and
the labor hours are limited to 800 per month, 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 ybe the number of units of Product B produced.
Step 2: Write the objective function. The objective is to maximize the
profit. The profit is given by the revenue minus the cost. The revenue is
12x+ 15y, and the cost is 5x+ 8y. Therefore, the profit function is P(x, y) =
12x+ 15y−(5x+ 8y), which simplifies to P(x, y)=7x+ 7y.
Step 3: Write the constraints. The constraints are based on the available
budget for materials and labor. For materials: 5x+ 8y≤2000, representing
the budget constraint. For labor: 2x+ 3y≤800, representing the labor hour
constraint. And x≥0, y≥0, since the number of units cannot be negative.
Step 4: Draw the feasible region. To graph the feasible region, we first need
to find the intercepts of the constraints. For the materials constraint: When
x= 0, 8y= 2000 ⇒y= 250. When y= 0, 5x= 2000 ⇒x= 400. For the
labor constraint: When x= 0, 3y= 800 ⇒y=800
3≈266.67. When y= 0,
2x= 800 ⇒x= 400.
11
The feasible region is bounded by the lines x= 0, y= 0, 5x+ 8y= 2000,
and 2x+ 3y= 800.
Step 5: Find the corner points of the feasible region. The corner points are
the intersections of the lines forming the feasible region. Solving the system of
equations, we find the corner points: A(0,0), B(400,0), C(267,266), D(0,250).
Step 6: Evaluate the profit function at each corner point. Calculate the profit
at each corner point: P(0,0) = 7(0)+7(0) = 0 P(400,0) = 7(400)+7(0) = 2800
P(267,266) = 7(267) + 7(266) = 3739 P(0,250) = 7(0) + 7(250) = 1750
Step 7: Determine the maximum profit. The maximum profit is achieved
at the corner point C(267,266) with a profit of
$
3739. Therefore, the company
should produce 267 units of Product A and 266 units of Product B to maximize
its profit.
Question 13
Question
A company produces two products, Product A and Product B. To make each
unit of Product A requires 3 hours of labor and 2 hours of machine time. To
make each unit of Product B requires 2 hours of labor and 4 hours of machine
time. Each unit of Product A can be sold for
$
50 and each unit of Product B
can be sold for
$
60. The company has a maximum of 240 hours of labor and
200 hours of machine time available. How many units of each product should
the company produce to maximize revenue?
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 revenue,
which is given by R= 50x+ 60y.
Step 3: Write the constraints based on available labor and machine time. We
have: - Labor constraint: 3x+2y≤240 - Machine time constraint: 2x+4y≤200
Step 4: Non-negativity constraint: We also have x≥0 and y≥0 since we
cannot produce negative units of a product.
Step 5: Plot the constraints on a graph and shade the feasible region. The
feasible region is the area where all constraints are satisfied.
Step 6: Calculate corner points of the feasible region: 1. (0,0) 2. (0,50) 3.
(40,40) 4. (80,20)
Step 7: Evaluate the objective function at each corner point: 1. (0,0):
R= 50(0) + 60(0) = $0 2. (0,50): R= 50(0) + 60(50) = $3000 3. (40,40):
R= 50(40) + 60(40) = $4000 4. (80,20): R= 50(80) + 60(20) = $5200
Step 8: Determine the maximum revenue and the corresponding production
quantities: The maximum revenue of
$
5200 occurs at the corner point (80,20).
12
Therefore, the company should produce 80 units of Product A and 20 units of
Product B to maximize revenue.
Question 14
Question
A company produces two types of products, Product A and Product B. It costs
$
6 to produce one unit of Product A and
$
8 to produce one unit of Product
B. The company can sell Product A for
$
10 per unit and Product B for
$
12
per unit. The company has a limit of
$
3000 for production cost per day and
a limit of 400 units of Product A and 500 units of Product B to produce per
day. How many units of each product should the company produce to maximize
their profit?
Solution
Let xbe the number of units of Product A produced per day, and ybe the
number of units of Product B produced per day. The objective is to maximize
the profit, P, which is given by
P= 10x+ 12y.
Subject to the following constraints:
6x+ 8y≤3000,
x≤400,
y≤500.
The company needs to maximize the profit function subject to these con-
straints. To solve this optimization problem, we use the method of Lagrange
multipliers.
Step 1: Set up the Lagrangian function L:
L(x, y, λ) = 10x+ 12y−λ(6x+ 8y−3000) −µ(x−400) −ν(y−500).
Step 2: Compute the partial derivatives of the Lagrangian function:
∂L
∂x = 10 −6λ−µ= 0,
∂L
∂y = 12 −8λ−ν= 0,
∂L
∂λ =−6x−8y+ 3000 = 0,
∂L
∂µ =−x+ 400 = 0,
13
∂L
∂ν =−y+ 500 = 0.
Step 3: Solve the system of equations to find the optimal values of x,y,λ,
µ, and ν.
Solving the system of equations, we find x= 320, y= 400, λ=1
3,µ=−1
2,
ν=−1
2.
Therefore, the company should produce 320 units of Product A and 400
units of Product B to maximize their profit.
Question 15
Question
A manufacturer produces two types of laptops: basic laptops and advanced
laptops. Each basic laptop earns a profit of
$
200, while each advanced laptop
earns a profit of
$
400. To produce a basic laptop, the manufacturer requires 2
hours of assembly time and 1 hour of testing time. To produce an advanced
laptop, the manufacturer requires 3 hours of assembly time and 2 hours of testing
time. The total assembly time available is 60 hours, and the total testing time
available is 40 hours. How many of each type of laptop should the manufacturer
produce to maximize profit?
Solution
Let xbe the number of basic laptops produced and ybe the number of advanced
laptops produced.
Step 1: Write the objective function The objective is to maximize the
profit. The total profit is given by:
P= 200x+ 400y
Step 2: Write the constraints The constraints are based on the available
assembly and testing time:
2x+ 3y≤60 (Assembly time constraint)
1x+ 2y≤40 (Testing time constraint)
x, y ≥0 (Non-negativity constraint)
Step 3: Set up the feasible region To find the feasible region, we graph
the inequalities on the xy-plane.
Step 4: Find the corner points of the feasible region The corner
points of the feasible region are the intersections of the boundary lines. These
are found to be:
A(0,0)
B(20,0)
14
C(10,15)
D(0,20)
Step 5: Evaluate the objective function at each corner point
PA= 200(0) + 400(0) = 0
PB= 200(20) + 400(0) = 4000
PC= 200(10) + 400(15) = 8000
PD= 200(0) + 400(20) = 8000
Step 6: Determine the maximum profit The maximum profit of
$
8000
is attained when producing 10 basic laptops and 15 advanced laptops.
Question 16
Question
A manufacturing company produces two types of products, Xand Y, which
are sold for
$
20 and
$
30 per unit, respectively. To produce one unit of product
Xrequires 3 hours of labor and 2 hours of machine time, while producing one
unit of product Yrequires 2 hours of labor and 4 hours of machine time. The
company has 60 hours of labor and 32 hours of machine time available each week.
How many units of each product should be produced to maximize revenue?
Solution
Step 1: Define the variables. Let xrepresent the number of units of product X
and yrepresent the number of units of product Yproduced.
Step 2: Write the objective function. The objective is to maximize revenue,
which is given by R= 20x+ 30y.
Step 3: Write the constraints: - Labor constraint: 3x+ 2y≤60 - Machine
time constraint: 2x+ 4y≤32 - Non-negativity constraint: x≥0, y≥0
Step 4: Plot the constraints on a graph to find the feasible region. The
feasible region is the area where all constraints are satisfied.
Step 5: Find the corner points of the feasible region by solving the system of
inequalities formed by the constraints. The corner points are the intersections
of the constraint lines.
Step 6: Evaluate the objective function at each corner point to determine
the maximum revenue.
Step 7: Make the final conclusion on the optimal production quantities to
maximize revenue.
15
Question 17
Question
A company produces two types of smartphones: Model A and Model B. Each
Model A smartphone sells for
$
500, while each Model B smartphone sells for
$
700. The company can produce up to 3000 smartphones per week. It takes
4 hours to produce a Model A smartphone and 5 hours to produce a Model B
smartphone. The company has 1800 hours of production time available each
week. How many of each type of smartphone should the company produce to
maximize revenue?
Solution
Step 1: Define the decision variables. Let xbe the number of Model A smart-
phones produced, and ybe the number of Model B smartphones produced.
Step 2: Write the objective function. The revenue function to be maximized
is given by:
R(x, y) = 500x+ 700y
Step 3: Write the constraint equations. The constraints are:
x≥0
y≥0
4x+ 5y≤1800
x+y≤3000
Step 4: Solve the system of equations by graphing the feasible region defined
by the constraints and identifying the corner points. The corner points are: (0,
0), (0, 3000), (450, 2550), and (750, 1500).
Step 5: Calculate the revenue at each corner point: - Point (0, 0): R(0,0) =
500(0) + 700(0) = $0 - Point (0, 3000): R(0,3000) = 500(0) + 700(3000) =
$2,100,000 - Point (450, 2550): R(450,2550) = 500(450)+700(2550) = $2,100,000
- Point (750, 1500): R(750,1500) = 500(750) + 700(1500) = $2,100,000
Step 6: Compare the revenue at each corner point to determine the maximum
value. Thus, the maximum revenue of
$
2,100,000 can be achieved by producing
0 Model A smartphones and 3000 Model B smartphones, or by producing 450
Model A smartphones and 2550 Model B smartphones, or by producing 750
Model A smartphones and 1500 Model B smartphones.
Question 18
Question
A company produces and sells two types of products: Product A and Product
B. Each unit of Product A requires 2 hours of labor and yields a profit of
$
50,
16
while each unit of Product B requires 3 hours of labor and yields a profit of
$
60.
The company has 200 hours of labor available each week. How many units of
each product should the company produce and sell in order to maximize their
weekly profit?
Solution
Step 1: Let’s denote the number of units of Product A produced and sold as x
and the number of units of Product B produced and sold as y. The objective
function to maximize profit is P= 50x+ 60y.
Step 2: We need to establish the constraints for this optimization problem.
The first constraint is the labor constraint: 2x+ 3y≤200 (since the company
has 200 hours of labor available each week).
Step 3: We also have the non-negativity constraints: x≥0 and y≥0.
Step 4: We need to find the critical points. To do this, we set up the
system of equations by combining the objective function and the constraint:
(2x+ 3y= 200
P= 50x+ 60y.
Step 5: Let’s solve the system of equations. We can first solve for xin terms
of yfrom the labor constraint: 2x+ 3y= 200 =⇒x=200−3y
2.
Step 6: Substitute x=200−3y
2into the profit equation P= 50x+ 60yto get
the profit function in terms of y:P(y) = 50 200−3y
2+ 60y.
Step 7: Simplify the profit function: P(y) = 100 −75y+ 60y= 100 −15y.
Step 8: To maximize profit, we need to find the derivative of P(y) and set
it equal to 0: dP
dy =−15 = 0.
Step 9: Since the derivative is a constant value, there are no critical points.
So, we evaluate the profit at the endpoints of the feasible region, which are y= 0
and y= 200/3.
Step 10: Calculate the profits at these endpoints: P(0) = 100 and P(200/3) =
100 −15(200/3) = 100 −100 = 0.
Step 11: Compare the profits at the endpoints. The company should produce
and sell only Product A to maximize their weekly profit. Therefore, the company
should produce and sell 100 units of Product A each week.
Question 19
Question
A company manufactures two types of products, A and B. Product A requires
3 hours of labor and 4 hours of machine time, while product B requires 4 hours
of labor and 2 hours of machine time. Each unit of product A yields a profit
of 50, whileeachunitof productByieldsaprofitof 40. If the company has a max-
imum of 240 hours of labor and 160 hours of machine time available per week,
how many units of each product should they produce to maximize their profit?
17
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.
The total profit can be represented as:
P= 50x+ 40y
Step 3: Write the constraints.
The constraints are based on the available labor and machine time:
(3x+ 4y≤240 (Labor constraint)
4x+ 2y≤160 (Machine time constraint)
Step 4: Plot the feasible region.
Solving the labor constraint and machine time constraint, we get the following
feasible region:
xy
(0,0)
Step 5: Find corner points of the feasible region. By solving the two linear
equations, we find the corner points:
A(0, 0), B(40, 0), C(30, 60), D(0, 60)
Step 6: Evaluate the objective function at each corner point.
Corner Point (x, y) Profit (P)
A(0,0) 0
B(40,0) 2000
C(30,60) 3600
D(0,60) 2400
Step 7: Determine the optimal solution.
The maximum profit of 3600isobtainedatpointC(30,60), whichmeansthecompanyshouldproduce30unitsofproductAand60unitsof productBtomaximizeitsprofit.
Question 20
Question
A company manufactures two types of products, A and B. Each unit of product
A requires 3 hours of labor and 5 units of material, while each unit of product
B requires 4 hours of labor and 6 units of material. Each unit of product A sold
yields a profit of
$
50, while each unit of product B sold yields a profit of
$
60.
The company can use up to 300 hours of labor and 400 units of material per
day. What is the maximum daily profit the company can make?
18
Solution
Let xbe the number of units of product A produced and sold per day, and let
ybe the number of units of product B produced and sold per day.
Step 1: Write the objective function. The objective is to maximize the
daily profit, which can be expressed as
P= 50x+ 60y
Step 2: Write the constraints. The constraints come from the available
labor and material:
3x+ 4y≤300 (Labor constraint)
5x+ 6y≤400 (Material constraint)
Step 3: Solve the system of inequalities. We first graph the feasible region
formed by the constraints. Solving each constraint for y, we get:
y≤ − 3
4x+ 75 (Labor constraint)
y≤ − 5
6x+200
6(Material constraint)
Step 4: Find the intersection points. Solving the system of equations, we
find the intersection points of the lines y=−3
4x+ 75 and y=−5
6x+200
6. This
gives us the points (60,15), (120,0), and (0,75).
Step 5: Test the corner points. We evaluate the objective function at the
corner points of the feasible region: (0, 75), (60, 15), and (120, 0). Calculating
the profit for each point, we find:
P(0,75) = 75 ×50 = 3750
P(60,15) = 60 ×15 ×60 = 5400
P(120,0) = 120 ×60 = 7200
Step 6: Determine the maximum. Since the maximum profit occurs at
the point (120,0), the company can make a maximum daily profit of
$
7200 by
producing and selling 120 units of product A and 0 units of product B.
Question 21
Question
A manufacturer produces two types of laptops, type A and type B. It takes 2
hours to produce one unit of type A and 3 hours to produce one unit of type
B. The manufacturer’s labor force is limited to 100 hours per week. The profit
for each unit of type A is
$
200 and for each unit of type B is
$
250. If the
manufacturer wants to maximize their weekly profit, how many units of each
type should they produce?
19
Solution
Step 1: Define the variables. Let xbe the number of units of type A laptops
produced per week and ybe the number of units of type B laptops produced
per week.
Step 2: Write the objective function. The objective is to maximize the total
profit, given by P(x, y) = 200x+ 250y.
Step 3: Write the constraints. The labor constraint is 2x+ 3y≤100 (total
labor hours cannot exceed 100 hours). Also, x≥0 and y≥0 since the number
of units produced cannot be negative.
Step 4: Find the feasible region by graphing the constraints. The feasible
region is bounded by the x-axis, y-axis, and the line 2x+ 3y= 100.
Step 5: Find the corner points of the feasible region. The corner points are
(0, 0), (0, 33.33), and (50, 0).
Step 6: Evaluate the objective function at each corner point. For (0, 0):
P(0,0) = 200(0)+250(0) = 0 For (0, 33.33): P(0,33.33) = 200(0)+250(33.33) =
$8332.50 For (50, 0): P(50,0) = 200(50) + 250(0) = $10000
Step 7: Determine the maximize profit. The maximum profit of
$
10000 is
achieved when 50 units of type A laptops and 0 units of type B laptops are
produced.
Question 22
Question
A company wants to produce two types of products, A and B. The company can
produce up to 500 units of product A per day and up to 800 units of product B
per day. Each unit of product A requires 3 hours of labor and generates a profit
of
$
10, while each unit of product B requires 5 hours of labor and generates
a profit of
$
15. The company has a total of 2000 hours of labor available per
day. How many units of each product should the company produce per day to
maximize profit?
Solution
Let’s denote the number of units of product A produced per day as xand the
number of units of product B produced per day as y.
Step 1: Identify the objective function and constraints The objective
is to maximize profit, which is given by P= 10x+ 15y. The constraints are:
- Labor constraint: 3x+ 5y≤2000 - Production limits: 0 ≤x≤500 and
0≤y≤800
Step 2: Graph the feasible region To graph the feasible region for the
given constraints, we plot the lines 3x+ 5y= 2000, x= 0, x= 500, y= 0, and
y= 800. The feasible region is the polygon formed by these lines.
Step 3: Find the vertices of the feasible region The vertices of the
feasible region are the points of intersection of the lines forming the boundaries
20
of the region. Solving the equations leads to the following vertices: A: (0, 0),
B: (0, 400), C: (400, 320), D: (500, 160), E: (500, 0)
Step 4: Evaluate the objective function at each vertex Now we
calculate the profit at each of the vertices: A: P(0,0) = 0 B: P(0,400) =
15(400) = 6000 C: P(400,320) = 10(400) + 15(320) = 7600 D: P(500,160) =
10(500) + 15(160) = 8000 E: P(500,0) = 10(500) = 5000
Step 5: Determine the optimal solution The maximum profit of
$
8000
is achieved at point D, where the company should produce 500 units of product
A and 160 units of product B per day to maximize profit.
Question 23
Question
A company produces two types of products, A and B, using three machines:
M1, M2, and M3. The production time for each unit of product A on machines
M1, M2, and M3 is 2, 3, and 4 hours respectively. For product B, the production
time on machines M1, M2, and M3 is 3, 2, and 5 hours respectively. Machine
M1 is available for 80 hours, machine M2 for 60 hours, and machine M3 for
100 hours. The profit for each unit of product A is
$
20 and for product B is
$
30. How many units of each product should the company produce to maximize
profit?
Solution
Step 1: Define the decision variables. Let xbe the number of units of product
A to produce, and ybe the number of units of product B to produce.
Step 2: Write the objective function. The total profit to maximize is given
by Z= 20x+ 30y.
Step 3: Write the constraints based on the production time available on each
machine: - 2x+ 3y≤80 (Machine M1 constraint) - 3x+ 2y≤60 (Machine M2
constraint) - 4x+ 5y≤100 (Machine M3 constraint)
Step 4: Write the non-negativity constraints: - x≥0 - y≥0
Step 5: Set up the linear programming model: Maximize Z= 20x+ 30y
subject to the constraints:
2x+ 3y≤80
3x+ 2y≤60
4x+ 5y≤100
x≥0
y≥0
Step 6: Solve the linear programming model using graphical or simplex
method to find the optimal values of xand y.
21
Question 24
Question
A manufacturing company produces two types of smartphones: model A and
model B. Each model requires a certain number of labor hours and materials to
produce. Model A requires 4 labor hours and 2 units of material, while model B
requires 6 labor hours and 3 units of material. The company has 30 labor hours
and 15 units of material available per day. Let xbe the number of model A
smartphones produced and ybe the number of model B smartphones produced.
If the profit from selling model A is 200perunitandtheprofitfromsellingmodelBis300
per unit, how many of each model should the company produce daily to maxi-
mize profit?
Solution
Step 1: Define the objective function. Let P(x, y) represent the profit function.
The profit from selling model A is 200perunitandtheprofitfromsellingmodelBis300
per unit. So, the objective function is:
P(x, y) = 200x+ 300y
Step 2: Identify the constraints. The constraints in this problem are the
labor hours and material available:
(4x+ 6y≤30 (Labor hours constraint)
2x+ 3y≤15 (Material constraint)
Step 3: Graph the feasible region. To find the feasible region, plot the lines
representing the constraints and shade the feasible region where they intersect.
Step 4: Find the corner points of the feasible region. The corner points of
the feasible region are the intersections of the lines representing the constraints.
Step 5: Evaluate the objective function at each corner point. Calculate
P(x, y) for each corner point.
Step 6: Determine the maximum profit. Identify the corner point that yields
the maximum profit by comparing the values of P(x, y) at each corner point.
Step 7: Conclusion. The company should produce a certain number of model
A smartphones and a certain number of model B smartphones daily to maximize
profit.
Question 25
Question
A company manufactures two types of products, A and B. Each unit of product
A requires 3 hours of labor and 1 hour of machine time, while each unit of
product B requires 2 hours of labor and 2 hours of machine time. The company
22
has 100 hours of labor and 80 hours of machine time available per week. If
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
profit?
Solution
Step 1: Let’s define our decision variables. Let xbe the number of units of
product A produced per week, and ybe the number of units of product B
produced per week.
Step 2: Write the constraints based on the labor hours available. The labor
constraint can be formulated as: 3x+ 2y≤100.
Step 3: Write the constraints based on the machine hours available. The
machine constraint can be formulated as: x+ 2y≤80.
Step 4: Write the non-negativity constraint. Since the number of units
produced cannot be negative, we have x≥0 and y≥0.
Step 5: Set up the objective function. The objective is to maximize profit,
which can be expressed as Z= 30x+ 40y.
Step 6: Combine all the constraints and the objective function to form the
linear programming problem: Maximize Z= 30x+40ysubject to: 3x+2y≤100,
x+ 2y≤80, x≥0, y≥0.
Step 7: Solve the linear programming problem using graphical or simplex
method to find the optimal values of xand ythat maximize profit.
This question involves formulating a linear programming problem and opti-
mizing it to maximize profit, making it a challenging problem in Optimization
and Decision Making.
Question 26
Question
A company produces two types of products: Product A and Product B. Product
A sells for
$
10 per unit and requires 4 hours of labor to produce. Product B
sells for
$
15 per unit and requires 6 hours of labor to produce. The company
has a total of 40 hours of labor available each day. How many units of each
product should the company produce in order to maximize its daily revenue?
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 revenue generated can be calculated by multiplying the number of
23
units produced by their respective selling prices:
Revenue = 10x+ 15y
Step 3: Write the constraint equations.
The total labor available is limited to 40 hours per day, so we have the constraint
equation:
4x+ 6y≤40
Step 4: Find the feasible region.
To find the feasible region, we need to graph the inequality 4x+ 6y≤40. When
x= 0, 6y≤40 which gives y≤40
6=20
3≈6.67. When y= 0, 4x≤40 which
gives x≤10. Therefore, the feasible region is a polygon with vertices at (0,0),
(0,6.67), and (10,0).
Step 5: Find the critical points.
The critical points occur at the vertices of the feasible region: - (0,0) - (0,6.67)
- (10,0)
Step 6: Evaluate the objective function at each critical point.
For (0,0):
Revenue = 10(0) + 15(0) = $0
For (0,6.67):
Revenue = 10(0) + 15(6.67) = $100.05
For (10,0):
Revenue = 10(10) + 15(0) = $100
Step 7: Determine the optimal solution.
The maximum revenue is achieved when the company produces 10 units of
Product A and 0 units of Product B, yielding a daily revenue of
$
100.
Question 27
Question
A company manufactures 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, while each unit of Product B requires 3 hours of labor and 3 hours
of machine time. The company has 400 hours of labor and 300 hours of
machine time available each week. If the profit per unit of Product A is
50andtheprofitperunitof P roductBis60, how many units of each product should
the company produce to maximize its weekly profit?
Solution
Step 1: Define the decision variables. Let xbe the number of units of Product
A to produce and ybe the number of units of Product B to produce.
24
Step 2: Formulate the objective function. The objective is to maximize the
weekly profit, given by Z= 50x+ 60y.
Step 3: Formulate the constraints. The constraints are based on the available
labor and machine time:
4x+ 3y≤400 (Labor constraint)
2x+ 3y≤300 (Machine time constraint)
Step 4: Plot the feasible region determined by the constraints. To do this,
we first find the intersection points of the two lines formed by the constraints:
4x+ 3y= 400 ⇒y=−4
3x+400
3
2x+ 3y= 300 ⇒y=−2
3x+ 100
Solving the system of equations, we find the intersection point to be (120,40).
Step 5: Test the corner points of the feasible region in the objective function.
The corner points are: (0,0), (0,100), (60,80), (120,40). Calculating the profit
at each corner point:
Z(0,0) = 0
Z(0,100) = 6000
Z(60,80) = 7400
Z(120,40) = 8000
Step 6: Determine the optimal solution. The company should produce 120
units of Product A and 40 units of Product B to maximize its weekly profit to
8000.
Question 28
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 hours of machine time
to produce, while each unit of Product B requires 2 hours of labor and 1 hour
of machine time to produce. The total available labor hours are 360 hours and
the total available machine hours are 240 hours. The profit from each unit of
Product A is
$
30 and the profit from each unit of Product B is
$
20. How many
units of each product should the company produce in order to maximize profit?
Solution
Let xbe the number of units of Product A produced and ybe the number of
units of Product B produced.
25
Step 1: Define the objective function. The objective is to maximize
profit. The total profit can be expressed as:
P= 30x+ 20y
Step 2: Write the constraints. The constraints are the total labor hours
and machine hours used:
Labor hours:3x+ 2y≤360
Machine hours:2x+y≤240
Non-negativity constraints:
x≥0, y ≥0
Step 3: Graph the feasible region. To graph the feasible region, we first
plot the lines representing the constraints:
3x+ 2y= 360
2x+y= 240
x= 0, y= 0
From the graph, we find the feasible region where the constraints are satisfied.
Step 4: Find the corner points of the feasible region. The corner
points of the feasible region are the intersection points of the constraint lines.
We find the coordinates of the corner points by solving the systems of equations.
Step 5: Evaluate the objective function at each corner point. Eval-
uate the objective function P= 30x+ 20yat each corner point to find the
maximum profit.
Step 6: Determine the optimal solution. The maximum profit value
will occur at one of the corner points. The solution with the highest profit is the
optimal solution, indicating the number of units of each product the company
should produce to maximize profit.
Question 29
Question
A company produces two types of products, Xand Y, using two machines, A
and B. Each unit of product Xrequires 4 hours on machine Aand 2 hours on
machine B, while each unit of product Yrequires 3 hours on machine Aand 3
hours on machine B. Machine Acan be used up to 60 hours per week, while
machine Bcan be used up to 40 hours per week. The profit per unit of product
Xis
$
30 and the profit per unit of product Yis
$
40. How many units of each
product should the company produce in order to maximize the weekly profit?
26
Solution
Step 1: Let xbe the number of units of product Xproduced, and ybe the
number of units of product Yproduced.
Step 2: The objective function is to maximize the profit, which can be
expressed as P= 30x+ 40y.
Step 3: The constraints are: - Product Xuses 4 hours on machine Aand
product Yuses 3 hours on machine A, so the constraint for machine Ais 4x+
3y≤60. - Product Xuses 2 hours on machine Band product Yuses 3 hours
on machine B, so the constraint for machine Bis 2x+ 3y≤40. - Since the
number of products cannot be negative, x≥0 and y≥0.
Step 4: Now we will solve the linear programming problem using the simplex
method. The following tableaux summarizes the problem:
Iteration x y Machine A Machine B Profit Pivot Column
Initial 0 0 4 3 0
x1 0 4 3 30 x
y0 1 2 3 40 y
Step 5: From the initial tableau, the pivot is in row 2 and column 2. Divide
row 2 by 3:
Iteration x y Machine A Machine B Profit Pivot Column
Initial 0 0 4 3 0
x1 0 4 3 30 x
y0 1 2/3 1 40/3y
Step 6: Perform the next iteration, and continue until the optimal solution is
reached. The optimal solution will provide the values of xand ythat maximize
the weekly profit.
Question 30
Question
A company manufactures two types of products, Aand B. It costs the company
$
5 to produce each unit of Aand
$
8 to produce each unit of B. The company
can sell each unit of Afor
$
12 and each unit of Bfor
$
15. The company has a
maximum production capacity of 200 units. How many units of each product
should the company produce in order to maximize its profit?
27
Solution
Let xbe the number of units of product Aand ybe the number of units of
product Bproduced.
Step 1: Write the objective function The profit function is given by:
P(x, y) = 12x+ 15y−5x−8y
which simplifies to:
P(x, y)=7x+ 7y
Step 2: Write the constraint The constraint on the production capacity
is:
x+y≤200
Step 3: Set up the optimization problem The company wants to max-
imize profit subject to the constraint:
Maximize P(x, y)=7x+ 7y
subject to
x+y≤200
Step 4: Find the feasible region Plotting the constraint x+y≤200 on
the xy-plane gives us a feasible region bounded by the line x+y= 200 and the
axes.
Step 5: Find critical points The critical points occur at the vertices of
the feasible region: (0, 0), (0, 200), (200, 0)
Step 6: Evaluate the objective function at the critical points Cal-
culating P(x, y) at these critical points: - (0,0) : P(0,0) = 7(0) + 7(0) = 0 -
(0,200) : P(0,200) = 7(0) + 7(200) = 1400 - (200,0) : P(200,0) = 7(200) +
7(0) = 1400
Step 7: Conclusion Therefore, to maximize profit, the company should
produce 200 units of product Band no units of product Ato achieve a maximum
profit of
$
1400.
28
