MATH 125 - FINITE MATHEMATICS Optimization and Decision Making Set 3

MATH 125 - FINITE MATHEMATICS

- Optimization and Decision Making

Question Bank - Set 3

Liberty University

Question 1

Question

A company produces two types of products: Product A and Product B. Each

unit of Product A requires 2 hours of labor and 3 hours of material to produce,

while each unit of Product B requires 3 hours of labor and 2 hours of material

to produce. The company has 500 hours of labor and 600 hours of material

available. Product A sells for

30 per unit and Product B sells for

25 per unit.

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 to

produce and ybe the number of units of Product B to produce.

Step 2: Write the objective function. The objective is to maximize revenue.

The total revenue Ris given by:

R= 30x+ 25y

Step 3: Write the constraints. The constraints are based on the available

labor and material:

2x+ 3y≤500

3x+ 2y≤600

Step 4: Set up the optimization problem. The problem can be formulated

as: Maximize 30x+ 25ysubject to:

2x+ 3y≤500

3x+ 2y≤600

and x, y ≥0

Step 5: Solve the optimization problem. Solving the linear programming

problem, we find the critical points at the intersections of the constraint lines

and at the corners of the feasible region.

The corner points are: 1. (0, 200) 2. (100, 133.33) 3. (150, 0) 4. (166.67, 0)

5. (0, 200)

Step 6: Calculate the total revenue at each corner point. Substitute the

values of xand yinto the revenue function R= 30x+ 25yat each corner point.

The total revenue at each corner point is: 1. (0, 200): R =

5000 2. (100,

133.33): R =

6576.67 3. (150, 0): R =

4500 4. (166.67, 0): R =

4166.75 5.

(0, 200): R =

5000

Step 7: Conclusion To maximize revenue, the company should produce 100

units of Product A and 133.33 units of Product B. The maximum revenue

achievable is

6576.67.

Question 2

Question

A company manufactures and sells two types of products, Xand Y. Each unit

of Xrequires 2 hours of labor and 3 hours of machine time, while each unit of

Yrequires 4 hours of labor and 3 hours of machine time. The company has 50

hours of labor and 60 hours of machine time available each week. The profit

from each unit of Xis

30 and the profit from each unit of Yis

40. How many

units of each product should the company produce in order to maximize profit?

Solution

Step 1: Assign variables. Let xbe the number of units of product Xproduced

and sold, and let ybe the number of units of product Yproduced and sold.

Step 2: Write the constraints based on the available labor and machine time:

(2x+ 4y≤50 (Labor constraint)

3x+ 3y≤60 (Machine time constraint)

Step 3: Write the objective function. The total profit Pcan be represented

as:

P= 30x+ 40y

Step 4: Graph the constraints on a coordinate plane and find the feasible

region.

Step 5: Solve the system of inequalities to find the vertices of the feasible

region. The vertices are the points of intersection of the lines representing the

constraints.

Step 6: Calculate the profit at each vertex by plugging the coordinates into

the profit function P= 30x+ 40y.

Step 7: Compare the profits at each vertex to determine which one maximizes

profit.

Step 8: Write the conclusion stating how many units of each product should

be produced to maximize profit.

Question 3

Question

A farmer has a rectangular field with a fixed area of 1000 square meters. She

wants to fence off three sides of the field, using the existing barn as the fourth

side. What dimensions should the farmer choose in order to minimize the

amount of fencing used?

Solution

Let xbe the width and ybe the length of the rectangular field. Since the area

is fixed at 1000 square meters, we have the equation xy = 1000. The amount of

fencing used is given by the perimeter, which is P=x+ 2y.

Step 1: Write the perimeter in terms of a single variable by substituting

y=1000

xinto P=x+ 2y.

P=x+ 2 1000

x

Step 2: To minimize the amount of fencing used, differentiate Pwith respect

to xand set it equal to zero.

dx = 1 −2000

x2= 0

x2= 2000

x=√2000 = 20√5 meters

Step 3: Find the corresponding value of yusing xy = 1000.

y=1000

x=1000

20√5= 10√5 meters

Step 4: Therefore, to minimize the amount of fencing used, the farmer

should choose dimensions of 20√5 meters by 10√5 meters for the width and

length of the rectangular field, respectively.

Question 4

Question

A company produces two types of products: Product A and Product B. Product

A sells for

10 per unit and Product B sells for

20 per unit. It costs the company

5 to produce one unit of Product A and

10 to produce one unit of Product B.

The company has a production capacity of 500 units per day. If the company

wants to maximize its profit, how many units of each product should it produce?

Solution

Step 1: Define the variables. Let xbe the number of units of Product A

produced and ybe the number of units of Product B produced.

Step 2: Write the objective function. The profit, P, for the company can be

represented as:

P= 10x+ 20y−(5x+ 10y)

P= 5x+ 10y

Step 3: Write the constraint equation. The production capacity constraint

is given by:

x+y≤500

Step 4: Set up the constraints.

x+y≤500

x≥0, y ≥0

Step 5: Plot the constraints and find the feasible region. Let’s graph the line

x+y= 500. The feasible region will be the area below this line and bounded

by the non-negativity constraints.

Step 6: Calculate the corner points of the feasible region. The corner points

of the feasible region are where the constraints intersect. The corner points of

the feasible region are: 1. (0,0) 2. (0,500) 3. (500,0)

Step 7: Evaluate the objective function at each corner point. For (0,0):

P= 5(0) + 10(0) = 0 For (0,500): P= 5(0) + 10(500) = 5000 For (500,0):

P= 5(500) + 10(0) = 2500

Step 8: Determine the maximum profit. The maximum profit is

5000 when

the company produces 500 units of Product B and 0 units of Product A.

Question 5

Question

A company manufactures two products, A and B. Product A generates a profit of

10 per unit and requires 5 hours of production time, while product B generates

a profit of

15 per unit and requires 7 hours of production time. The company

has a total of 50 hours of production time available each day. How many units

of each product should the company produce in order to maximize profit?

Solution

Step 1: Define the variables. Let xrepresent the number of units of product A to

be produced and yrepresent the number of units of product B to be produced.

Step 2: Write the objective function to maximize profit. The total profit P

can be calculated as

P= 10x+ 15y

Step 3: Write the constraint equation for the production time. The total

production time used by product A and product B must not exceed the total

available production time of 50 hours. Therefore, the constraint equation is

5x+ 7y≤50

Step 4: Determine the feasible region. We need to determine the feasible

region by graphing the inequality constraint. The feasible region will be the

area below the line 5x+ 7y= 50.

Step 5: Find the vertices of the feasible region. The vertices are the points

of intersection of the boundary lines. The vertices of the feasible region will be

the corners of the shaded region after graphing the inequality constraint.

Step 6: Substitute the coordinates of each vertex into the objective function

P= 10x+ 15yto find the profit at each vertex.

Step 7: Identify the vertex that results in the maximum profit. This vertex

represents the optimal solution to the problem.

Step 8: State the optimal solution in the context of the problem. The

company should produce a certain number of units of each product to maximize

profit.

Question 6

Question

A company can choose between two suppliers for its raw materials. Supplier

A offers a rate of

500 per unit with a minimum order quantity of 200 units.

Supplier B offers a rate of

550 per unit with no minimum order quantity. The

company estimates that its annual demand for the raw material is between

200 and 300 units. Determine the range of quantities for which it is more

cost-effective for the company to order from Supplier A, assuming it wants to

minimize its total cost.

Solution

Step 1: Let’s first establish the cost function for each supplier. - For Supplier

A: Cost =

500Q, where Q is the quantity ordered. - For Supplier B: Cost =

550Q, where Q is the quantity ordered.

Step 2: We need to determine the break-even point between the two suppli-

ers. This occurs when the cost from Supplier A equals the cost from Supplier

B. - Set the two cost functions equal to each other:

500Q =

550Q - Solve for

500Q =

550Q -

50Q = 0 Q = 0

Step 3: The break-even point occurs at Q = 0, but since the company must

order at least 200 units from Supplier A, we know that any quantity below 200

will not be cost-effective to order from Supplier A. Now, we need to determine

the highest quantity for which it is still cost-effective to order from Supplier

A. - Substitute Q = 200 into the cost functions for both suppliers. - Cost for

Supplier A:

500(200) =

100,000 - Cost for Supplier B:

550(200) =

110,000

Step 4: Since ordering 200 units from Supplier A costs less than ordering

from Supplier B, the company should order at least 200 units from Supplier

A. Next, we need to determine the maximum quantity for which ordering from

Supplier A remains cost-effective. - Substitute Q = 300 into the cost functions

for both suppliers. - Cost for Supplier A:

500(300) =

150,000 - Cost for

Supplier B:

550(300) =

165,000

Step 5: Since ordering 300 units from Supplier A costs less than ordering

from Supplier B, the company should order at most 300 units from Supplier

A. Therefore, the range of quantities for which it is more cost-effective for the

company to order from Supplier A is between 200 and 300 units.

Question 7

Question

A company manufactures two types of products, Aand B. The production of

Arequires 4 hours of labor and 2 hours of machine time, while the production

of Brequires 3 hours of labor and 3 hours of machine time. The profit per unit

of product Ais

50 and for product Bis

60. The company has a maximum of

120 hours of labor and 90 hours of machine time available per week. 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

Aproduced, and ybe the number of units of product Bproduced.

Step 2: Write the objective function. The total profit Zcan be expressed

as:

Z= 50x+ 60y

Step 3: Write the constraints based on the available labor and machine time.

The constraints are:

4x+ 3y≤120

(labor constraint)

2x+ 3y≤90

(machine time constraint)

Step 4: Write the non-negativity constraint for the decision variables:

x≥0, y ≥0

Step 5: Set up the linear programming model:

Maximize: Z= 50x+ 60y

Subject to: 4x+ 3y≤120

2x+ 3y≤90

x≥0, y ≥0

Step 6: Solve the linear programming model using the graphical method or

any optimization software to find the optimal values of xand ythat maximize

the profit.

Question 8

Question

A company manufactures two types of products, A and B. The profit generated

from each unit of product A is

5, while the profit from each unit of product

B is

8. Each unit of product A requires 2 hours for processing while each

unit of product B requires 3 hours. The company has 120 hours of processing

time available each week. How many units of each product should the company

manufacture in order to maximize its profit?

Solution

Step 1: Define the variables.

Let xbe the number of units of product A to manufacture, and let ybe the

number of units of product B to manufacture.

Step 2: Write the objective function.

The total profit generated can be represented by the objective function:

P(x, y)=5x+ 8y

Step 3: Write the constraint equation.

The constraint is based on the available processing time:

2x+ 3y≤120

Step 4: Determine the feasible region.

Plot the constraint on a graph and shade the region where 2x+ 3y≤120. This

region represents the feasible area where the company can operate given the

constraint.

Step 5: Find the corner points.

The corner points of the feasible region are the intersection points of the con-

straint lines. Calculate the coordinates of these points.

Step 6: Evaluate the objective function at each corner point.

Calculate P(x, y) for each corner point using the objective function P(x, y) =

5x+ 8y.

Step 7: Identify the maximum value.

Determine which corner point yields the maximum profit. This will be the

optimal solution for the company’s manufacturing strategy.

Question 9

Question

A company manufactures two types of products, Aand B, which have the

following production costs: - Product Acosts

10 per unit in raw materials and

5 in labor per unit. - Product Bcosts

15 per unit in raw materials and

7 in

labor per unit.

The company has a maximum budget of

5000 for raw materials and

3000

for labor. Product Asells for

30 per unit and product Bsells for

40 per unit.

How many units of each product should the company produce to maximize

profit?

Solution

Step 1: Define the variables. Let xbe the number of units of product Apro-

duced, and let ybe the number of units of product Bproduced.

Step 2: Write the objective function. The profit function P(x, y) can be

expressed as:

P(x, y) = 30x+ 40y−(10x+ 5y)−(15y+ 7y)

Step 3: Write the constraints. The constraints based on the budget for raw

materials and labor are:

10x+ 15y≤5000

5x+ 7y≤3000

Step 4: Set up the optimization problem. We want to maximize the profit

function P(x, y) subject to the constraints:

P(x, y) = 30x+ 40y−10x−5y−15y−7y

10x+ 15y≤5000

5x+ 7y≤3000

Step 5: Solve the linear programming problem. To solve this problem, we

can use the simplex method or a graph to find the feasible region and the optimal

solution.

Question 10

Question

A company produces two types of products, Product A and Product B. The

company has a total of 800 hours of production time available per week. Each

unit of Product A requires 2 hours of production time and yields a profit of

50,

while each unit of Product B requires 3 hours of production time and yields

a profit of

60. Determine the optimal number of units of each product the

company should produce per week to maximize profit.

Solution

Step 1: Define the variables.

Let xrepresent the number of units of Product A produced per week, and let y

represent the number of units of Product B produced per week.

Step 2: Write the objective function.

The objective is to maximize profit, which is given by Profit = 50x+ 60y.

Step 3: Write the constraint equation.

The constraint is the total production time available per week, which is 800

hours. The production time constraint can be written as: 2x+ 3y≤800.

Step 4: Plot the feasible region.

To graph the constraint, we first graph the line 2x+ 3y= 800 and shade the

region below the line.

Step 5: Determine the corner points of the feasible region.

The corner points of the feasible region are the intersections of the boundary

lines. The corner points are found by solving the system of equations formed

by the boundary lines.

Step 6: Evaluate the objective function at each corner point.

Using the objective function Profit = 50x+ 60y, calculate the profit at each

corner point.

Step 7: Identify the optimal solution.

The optimal solution is the corner point that yields the maximum profit.

Step 8: Interpret the solution.

Interpret the optimal solution in the context of the problem to determine the

number of units of each product the company should produce to maximize profit.

Question 11

Question

A company manufactures two types of products, Xand Y. The profit per unit

of product Xis 3 units and the profit per unit of product Yis 5 units. Each

unit of product Xrequires 2 hours on machine Aand 3 hours on machine B,

while each unit of product Yrequires 1 hour on machine Aand 2 hours on

machine B. Machine Acan only be used for 20 hours per day while machine B

can only be used for 15 hours per day. How many units of each product should

the company produce in order to maximize their profit?

Solution

Step 1: Let’s define the variables: - Let xbe the number of units of product X

to produce. - Let ybe the number of units of product Yto produce.

Step 2: Write the objective function. The total profit Pcan be expressed

as: P= 3x+ 5y.

Step 3: Write the constraints based on the time available on each machine:

- Machine Aconstraint: 2x+y≤20 (available hours on machine A). - Machine

Bconstraint: 3x+ 2y≤15 (available hours on machine B).

Step 4: Write the non-negativity constraint: x≥0 and y≥0.

Step 5: Convert the problem into standard form to identify the feasible

region and critical points: - Convert the inequalities into equalities: 2x+y= 20

and 3x+2y= 15. - Solve these two equations simultaneously to find the critical

point.

Step 6: Solve the system of equations: We find x= 5 and y= 10.

Step 7: Substitute the critical point and corner points into the objective

function: P(5,10) = 3(5) + 5(10) = 15 + 50 = 65. Check the profit at the corner

points to see if the maximum profit occurs at this critical point.

Step 8: Evaluate the profit at the corner points (0,0), (0,7.5), and (10,0):

P(0,0) = 0; P(0,7.5) = 0 + 5(7.5) = 37.5; P(10,0) = 3(10) + 0 = 30.

Step 9: Conclusion The maximum profit of 65 units is achieved when the

company produces 5 units of product Xand 10 units of product Y.

Question 12

Question

A company manufactures two types of products, product A and product B.

The profit margin per unit for product A is

5 and for product B is

8. Each

unit of product A requires 2 hours of labor and 1 hour of machine time, while

each unit of product B requires 3 hours of labor and 2 hours of machine time.

The company has a total of 100 hours of labor and 60 hours of machine time

available. How many units of each product should the company manufacture to

maximize profit?

Solution

Let’s denote the number of units of product A as xand the number of units of

product B as y. We want to maximize the total profit P, which can be expressed

as P= 5x+ 8y.

We also have the following constraints:











2x+ 3y≤100 (Labor constraint)

x+ 2y≤60 (Machine time constraint)

x≥0, y ≥0 (Non-negativity constraint)

To optimize the profit, we need to solve this linear programming problem

using the simplex method or graphical method.

The optimal solution for this problem is x= 20 units of product A and

y= 20 units of product B, with a maximum profit of

200.

Therefore, the company should manufacture 20 units of product A and 20

units of product B to maximize profit.

Question 13

Question

A company manufactures two types of products: Product A and Product B.

Product A requires 2 hours of labor and 3 hours of machine time, while Product

B requires 1 hour of labor and 4 hours of machine time. The company has 60

hours of labor and 80 hours of machine time available each day. Product A is

sold for

10 each, and Product B is sold for

12 each. How many units of each

product should the company produce to maximize its daily revenue?

Solution

Step 1: Let’s start by defining our variables. Let xbe the number of units of

Product A and ybe the number of units of Product B produced. Our objective

is to maximize the revenue.

Step 2: The total labor constraint is given by 2x+y≤60 (total labor

available is 60 hours).

Step 3: The total machine time constraint is 3x+ 4y≤80 (total machine

time available is 80 hours).

Step 4: Since we cannot produce negative units of a product, x≥0 and

y≥0.

Step 5: The total revenue Ris given by R= 10x+ 12y.

Step 6: We need to find the critical points of the feasible region, which is

the intersection of the constraints 2x+y≤60, 3x+ 4y≤80, x≥0, and y≥0.

Step 7: The critical points are where the boundaries of the feasible region

intersect. Solving for the intersections of the lines, we find the critical points at

(0,0), (20,0), (16,12), and (0,60).

Step 8: Now, we evaluate the objective function Rat each critical point:

- At (0,0), R= 10(0) + 12(0) = 0. - At (20,0), R= 10(20) + 12(0) = 200.

- At (16,12), R= 10(16) + 12(12) = 256 + 144 = 400. - At (0,60), R=

10(0) + 12(60) = 720.

Step 9: Therefore, the company should produce 16 units of Product A and

12 units of Product B to maximize its daily revenue, which amounts to

400.

Question 14

Question

A company manufactures and sells two types of products: Product A and Prod-

uct B. To produce one unit of Product A, it requires 3 hours of labor and 2 hours

of machine time, while to produce one unit of Product B, it requires 2 hours of

labor and 3 hours of machine time. The company has 300 hours of labor and

240 hours of machine time available each week. If the profit from selling one

unit of Product A is

50 and the profit from selling one unit of Product B is

60, how many units of each product should the company produce per week to

maximize profit?

Solution

Step 1: Define the 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 available labor and machine time:

- Labor constraint: 3x+ 2y≤300 - Machine time constraint: 2x+ 3y≤240

Step 3: Write the objective function to be maximized:

Maximize Z= 50x+ 60y

Step 4: Set up the linear programming model in standard form:

Maximize Z= 50x+ 60y

subject to 









3x+ 2y≤300

2x+ 3y≤240

x≥0

y≥0

Step 5: Solve the system of inequalities by graphing or substitution methods

to find the feasible region. The vertices of the feasible region are the points of

intersection of the lines formed by the constraints.

Step 6: Calculate the value of the objective function at each vertex of the

feasible region: - At vertex (0, 0): Z= 50(0) + 60(0) = 0 - At vertex (80, 0):

Z= 50(80) + 60(0) = 4000 - At vertex (60, 60): Z= 50(60) + 60(60) = 6600 -

At vertex (0, 100): Z= 50(0) + 60(100) = 6000

Step 7: Identify the vertex that maximizes the objective function. In this

case, the maximum profit of

6600 occurs when the company produces 60 units

of Product A and 60 units of Product B per week.

Question 15

Question

A company manufactures two types of 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. Each

unit of product A yields a profit of

30, and each unit of product B yields a

profit of

40. The company has 240 hours of labor and 320 hours of machine

time available each week. How many units of each product should the company

produce to maximize profit?

Solution

Let xrepresent the number of units of product A to produce, and yrepresent

the number of units of product B to produce.

Step 1: Write the objective function The objective is to maximize

profit. The profit function, P, is given by:

P= 30x+ 40y

Step 2: Write the constraint equations The constraints are the labor

and machine time available.



Labor constraint: 3x+ 2y≤240



Machine time constraint: 2x+ 4y≤320

Step 3: Plot the feasible region To plot the feasible region, we need to

graph the inequalities from the constraint equations and shade the region that

satisfies all constraints.

Step 4: Find the vertices of the feasible region The vertices of the

feasible region are the intersection points of the lines formed by the constraint

equations.

Step 5: Calculate the objective function at each vertex Calculate

the profit function Pat each vertex to determine the maximum profit.

Step 6: Interpret the result The solution will consist of the optimal

numbers of units for both products that will maximize the profit.

Question 16

Question

A company produces 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 4 hours of

machine time to produce. The company has 150 hours of labor and 160 hours

of machine time available each week. Profit from each unit of Product A is

and profit from each unit of Product B is

30. Determine how many units of

each product should be produced in order to maximize the total profit.

Solution

Step 1: Let’s denote the number of units of Product A produced as xand the

number of units of Product B produced as y. Let’s set up the constraints based

on the available resources: - Labor constraint: 3x+ 2y≤150 (3 hours of labor

per unit of A and 2 hours of labor per unit of B) - Machine time constraint:

2x+ 4y≤160 (2 hours of machine time per unit of A and 4 hours of machine

time per unit of B)

Step 2: We also need to consider the non-negativity constraints: x≥0 and

y≥0

Step 3: The objective function we want to maximize is the total profit, which

can be represented as Z= 20x+ 30y.

Step 4: We can solve this problem graphically by plotting the feasible region

defined by the constraints and then finding the maximum value of the objective

function within this region.

Step 5: The feasible region is the shaded area in the graph where all con-

straints are satisfied.

Step 6: We then evaluate the objective function at the corner points of

the feasible region to find the maximum total profit: - At the intersection of

3x+ 2y= 150 and 2x+ 4y= 160, we have (40,30) with a profit of

1600. - At

the intersection of 3x+ 2y= 150 and x= 0, we have (0,75) with a profit of

2250. - At the intersection of 2x+ 4y= 160 and y= 0, we have (80,0) with a

profit of

1600.

Step 7: Therefore, to maximize the total profit, the company should produce

75 units of Product A and no units of Product B, resulting in a total profit of

2250.

Question 17

Question

A manufacturing company produces two types of products: chairs and tables.

The profit on each chair is

30 and the profit on each table is

50. Each chair

requires 3 hours of labor and each table requires 5 hours of labor. The company

has 240 hours of labor available each week. How many chairs and tables should

the company produce to maximize profit?

Solution

Step 1: Define the variables. Let xbe the number of chairs produced and ybe

the number of tables produced.

Step 2: Write the objective function. The total profit can be represented as

P= 30x+ 50y.

Step 3: Write the constraint equation. The constraint on labor hours can

be represented as 3x+ 5y≤240.

Step 4: Set up the optimization problem. We want to maximize the objective

function P= 30x+ 50ysubject to the constraint 3x+ 5y≤240.

Step 5: Solve the constraint equation for either variable. Let’s solve for yin

terms of x.

3x+ 5y= 240

5y= 240 −3x

y= 48 −3

Step 6: Substitute the expression for yinto the objective function.

P= 30x+ 50 48 −3

5x

Step 7: Expand and simplify the equation.

P= 30x+ 2400 −30x

Step 8: The profit function simplifies to P= 2400. This means that the

profit is constant and does not depend on the number of chairs and tables

produced.

Step 9: Since the profit is constant and does not depend on the production

quantity, the company can simply set their production at any level that satisfies

the labor constraints.

Question 18

Question

A company manufactures two products, Aand B, using three machines. Ma-

chine 1 is available for 40 hours, machine 2 for 30 hours, and machine 3 for 60

hours, during a production period. The production of one unit of product A

requires 2 hours on machine 1 and 3 hours on machine 3, while the production

of one unit of product Brequires 4 hours on machine 2 and 2 hours on machine

3. The profit for each unit of product Ais

10, and the profit for each unit of

product Bis

15. How many units of each product should the company produce

in order to maximize profit?

Solution

Step 1: Let xbe the number of units of product Ato be produced, and ybe

the number of units of product Bto be produced.

Step 2: Write objective function to maximize profit. The total profit is given

by P= 10x+ 15y.

Step 3: Write constraints based on machine availability. We have the fol-

lowing constraints:

2x≤40 (Machine 1 constraint)

4y≤30 (Machine 2 constraint)

3x+ 2y≤60 (Machine 3 constraint)

Step 4: Write non-negativity constraints. Since the number of units cannot

be negative, we have x, y ≥0.

Step 5: Set up the linear programming model:

Maximize: P= 10x+ 15y

Subject to:

2x≤40

4y≤30

3x+ 2y≤60

x, y ≥0

Step 6: Solve the linear programming model using graphical or simplex

method to find the optimal values of xand y.

Question 19

Question

A company produces two products, Xand Y, which require certain amounts

of labor and materials to produce. Product Xrequires 3 hours of labor and 4

pounds of materials per unit, while Product Yrequires 5 hours of labor and 2

pounds of materials per unit. Each unit of Product Xcan be sold for

8, and

each unit of Product Ycan be sold for

7. If the company has a total of 500

hours of labor and 400 pounds of materials available, 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

produced and yrepresent the number of units of Product Yproduced.

Step 2: Write the constraints based on the available labor and materials:

- The total labor constraint: 3x+ 5y≤500 - The total materials constraint:

4x+ 2y≤400

Step 3: Write the objective function to maximize revenue. The revenue

function is given by R(x, y)=8x+ 7y.

Step 4: To solve this linear programming problem, we need to find the critical

points of the feasible region determined by the constraints.

Step 5: Graph the feasibility region determined by the constraints 3x+5y≤

500, 4x+ 2y≤400, x≥0, and y≥0.

Step 6: Identify the corner points of the feasibility region.

Step 7: Calculate the value of the objective function at each corner point:

(0,0), (0,200), (120,80), (166.67,0).

Step 8: Determine which corner point maximizes the objective function.

Since we are looking to maximize revenue, choose the corner point with the

highest revenue.

Step 9: Therefore, the company should produce 120 units of Product Xand

80 units of Product Yto maximize revenue.

Question 20

Question

A company produces two types of products, X and Y. Each unit of product X

requires 3 hours of labor and 2 hours of machine time. Each unit of product Y

requires 2 hours of labor and 4 hours of machine time. Product X sells for

per unit and product Y sells for

60 per unit. The company has 300 hours of

labor and 200 hours of machine time available. How many units of each product

should the company produce to maximize profit?

Solution

Step 1: Define the variables. Let xbe the number of units of product X produced

and ybe the number of units of product Y produced.

Step 2: Write the objective function. The profit for the company is given by

P= 40x+ 60y.

Step 3: Write the constraint equations. The constraints are:











3x+ 2y≤300

2x+ 4y≤200

x≥0, y ≥0

Step 4: Plot the feasible region by graphing the constraint equations. The

feasible region is bounded by the lines 3x+ 2y= 300, 2x+ 4y= 200, and the

axes.

Step 5: Find the vertices of the feasible region. The vertices of the feasible

region are the points of intersection of the lines forming the boundary of the

feasible region.

Step 6: Evaluate the objective function at each vertex. Calculate Pfor each

vertex to determine the maximum profit.

Step 7: Find the maximum profit and the corresponding values of xand y.

The maximum profit and the corresponding values of xand yare obtained from

the vertex that gives the highest profit.

Question 21

Question

A company manufactures two types of products, Xand Y. Each unit of product

Xrequires 2 hours of labor and 1 hour of machine time, while each unit of

product Yrequires 1 hour of labor and 3 hours of machine time. The company

has 100 hours of labor and 90 hours of machine time available for production.

The profit on each unit of Xis

30 and the profit on each unit of Yis

40. 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 X

to produce, and let yrepresent the number of units of product Yto produce.

Step 2: Write the objective function. The total profit Pis given by:

P= 30x+ 40y

Step 3: Write the constraints. The constraints are based on the available

labor and machine time: 









2x+y≤100

x+ 3y≤90

x, y ≥0

Step 4: Graph the feasible region. To find the feasible region, graph the

inequalities 2x+y≤100 and x+ 3y≤90.

Step 5: Find the corner points of the feasible region. The corner points of

the feasible region can be found by solving the equations of the lines where they

intersect. The corner points are: (0,30),(45,15),and (50,0).

Step 6: Evaluate the objective function at each corner point. Evaluate the

profit function Pat each corner point:

P(0,30) = 30(0) + 40(30) = 1200

P(45,15) = 30(45) + 40(15) = 1950

P(50,0) = 30(50) + 40(0) = 1500

Step 7: Determine the maximum profit. The maximum profit is

1950 when

the company produces 45 units of product Xand 15 units of product Y.

Question 22

Question

A company manufacturing two types of products, Xand Y, has a daily produc-

tion capacity of 100 units for both products combined. Each unit of product X

sells for

50, while each unit of product Ysells for

40. The production of each

unit of product Xrequires 2 labor hours, while the production of each unit of

product Yrequires 1 labor hour. The company’s total daily labor capacity is

180 hours. How many units of each product should the company produce to

maximize its daily revenue?

Solution

Step 1: Define the variables. Let xrepresent the number of units of product

Xproduced per day, and let yrepresent the number of units of product Y

produced per day.

Step 2: Write the constraints. The constraints for this problem are: - Pro-

duction constraint: x+y≤100 - Labor constraint: 2x+y≤180

Step 3: Define the objective function. The objective is to maximize the daily

revenue, which is given by R= 50x+ 40y.

Step 4: Plot the feasible region. To find the feasible region, graph the

inequalities x+y≤100 and 2x+y≤180. The feasible region is the area where

both inequalities are satisfied.

Step 5: Identify the corner points of the feasible region. The corner points

of the feasible region are where the lines intersect.

Step 6: Evaluate the objective function at each corner point. Calculate the

revenue at each corner point (x, y): - At (0,100): R= 50(0)+40(100) = $4000 -

At (40,140): R= 50(40)+40(140) = $9200 - At (90,90): R= 50(90)+40(90) =

$8100

Step 7: Determine the maximum revenue. The maximum revenue occurs at

the point (40,140), with a revenue of

9200.

Step 8: Conclusion. The company should produce 40 units of product X

and 140 units of product Yper day to maximize its daily revenue.

Question 23

Question

A toy company manufactures two types of toy cars: type A and type B. Each

type A car requires 2 hours of labor and 3 hours of painting, while each type

B car requires 3 hours of labor and 2 hours of painting. The company has a

total of 400 hours of labor and 300 hours of painting available each week. If the

profit from selling a type A car is

50 and the profit from selling a type B car

40, how many of each type of toy car should the company manufacture each

week to maximize profit?

Solution

Step 1: Define the variables. Let xbe the number of type A cars to be manu-

factured each week, and let ybe the number of type B cars to be manufactured

each week.

Step 2: Write the constraints based on the available labor and painting

hours: - For labor: 2x+ 3y≤400 (labor constraint) - For painting: 3x+ 2y≤

300 (painting constraint) - Also, x≥0 and y≥0 since the company cannot

manufacture a negative number of cars.

Step 3: Write the objective function to maximize profit. The total profit P

is given by P= 50x+ 40y.

Step 4: Graph the feasible region determined by the constraints. Find the

intersection points of the lines: - At the intersection of labor and painting

constraints: (120,40) - At the x-intercept of the labor constraint: (200,0) - At

the y-intercept of the painting constraint: (0,150)

Step 5: Calculate the profit at each corner point: - At (0,0): P= 0 - At

(200,0): P= 50(200) + 40(0) = 10000 - At (120,40): P= 50(120) + 40(40) =

6800 - At (0,150): P= 50(0) + 40(150) = 6000

Step 6: Determine which corner point gives the maximum profit. Since the

maximum profit occurs at (200,0) with x= 200 and y= 0, the company should

manufacture 200 type A cars and 0 type B cars each week to maximize profit.

Question 24

Question

A manufacturing company produces two types of products: Product A and

Product B. Each unit of Product A requires 3 hours of labor and 2 hours of

machining, while each unit of Product B requires 4 hours of labor and 3 hours

of machining. The company has 240 hours of labor and 180 hours of machining

available per week. If the profit per unit of Product A is

50 and the profit per

unit of Product B is

60, how many units of each product should the company

produce to maximize its profit?

Solution

Step 1: Define the decision variables. Let xbe the number of units of Product

A produced and ybe the number of units of Product B produced.

Step 2: Write the constraints based on available labor and machining hours:

3x+ 4y≤240 (Labor constraint)

2x+ 3y≤180 (Machining constraint)

Step 3: Write the objective function to maximize profit:

Maximize Z= 50x+ 60y

Step 4: Formulate the linear programming problem:

Maximize Z= 50x+ 60y

subject to











3x+ 4y≤240

2x+ 3y≤180

x≥0, y ≥0

Step 5: Solve the linear programming problem using graphical or simplex

method to find the optimal values of xand y.

Note: The solution to the linear programming problem will provide the

optimal number of units of Product A and Product B that the company should

produce to maximize its profit.

Question 25

Question

A company produces two types of products, Xand Y, using two machines, A

and B. Machine Acan produce 4 units of product Xor 2 units of product Yin

an hour. Machine Bcan produce 3 units of product Xor 2 units of product Y

in an hour. The profit per unit of product Xis

50 and for product Yis

40.

The company wants to maximize its profit. How many units of each product

should the company produce per hour?

Solution

Step 1: Let’s denote the number of units of product Xproduced per hour as x

and the number of units of product Yproduced per hour as y. Therefore, we

need to maximize the profit function P(x, y) = 50x+ 40y.

Step 2: The constraints are given by the production capacities of machines

Aand B: - 4x+ 2y≤Capacity of Machine A- 3x+ 2y≤Capacity of Machine

Step 3: Let’s calculate the production capacities of machines Aand B: -

Capacity of Machine A: 4x+ 2y- Capacity of Machine B: 3x+ 2y

Step 4: Now, we need to determine the feasible region by graphing the

inequalities obtained from the constraints.

Step 5: Solve the system of inequalities to find the vertices of the feasible

region. Then, evaluate the profit function at each vertex to find the maximum

profit.

Step 6: Once we have the maximum profit, we can determine the number

of units of each product the company should produce per hour to achieve this

maximum profit.

Question 26

Question

A company produces two types of products, Xand Y. The profit per unit of

product Xis

10, while the profit per unit of product Yis

15. The company

has limited resources: they can produce at most 300 units of product Xand 400

units of product Yper week. Additionally, they require twice as much time to

produce one unit of product Ycompared to one unit of product X. How many

units of each product should the company produce to maximize their weekly

profit?

Solution

Step 1: Define the variables. Let xbe the number of units of product X

produced per week, and let ybe the number of units of product Yproduced

per week.

Step 2: Write the objective function. The company’s objective is to maxi-

mize their profit, which can be expressed as follows:

Maximize Z= 10x+ 15y

Step 3: Write the constraints. The constraints are: - Production of product

X:x≤300 - Production of product Y:y≤400 - Time constraint: 2x≤y

Step 4: Formulate the linear programming problem. The problem can be

formulated as:

Maximize Z= 10x+ 15y

subject to the constraints:

x≤300

y≤400

2x≤y

x≥0, y ≥0

Step 5: Solve the linear programming problem. The feasible region is

formed by the intersection of the constraint lines. The corner points are: (0,0),

(150,300), and (200,400).

Calculating the profit at each corner point: - (0,0): Z= 10(0)+15(0) = $0 -

(150,300): Z= 10(150)+15(300) = $6000 - (200,400): Z= 10(200)+15(400) =

$8000

Therefore, the company should produce 150 units of product Xand 300

units of product Yto maximize their weekly profit, which will be

8000.

Question 27

Question

A company produces two types of products, X and Y. The production of each

unit of X requires 3 hours of labor and 4 hours of machine time, while the

production of each unit of Y requires 5 hours of labor and 6 hours of machine

time. The company has 300 hours of labor and 400 hours of machine time

available per week. The profit for each unit of X is

50 and for each unit of Y

60. How many units of each type of product should the company produce

to maximize its profit?

Solution

Let xbe the number of units of product X produced, and ybe the number of

units of product Y produced.

Step 1: Define the objective function The goal is to maximize profit,

which is given by P= 50x+ 60y.

Step 2: Write the constraints The constraints are: 1. Labor constraint:

3x+ 5y≤300 (maximum of 300 hours available). 2. Machine time constraint:

4x+ 6y≤400 (maximum of 400 hours available). 3. Non-negativity constraint:

x, y ≥0 (cannot produce negative units).

Step 3: Set up the optimization problem Maximize P= 50x+ 60y

subject to:

3x+ 5y≤300,

4x+ 6y≤400,

x, y ≥0.

Step 4: Solve the optimization problem First, we graph the feasible

region and find the corner points:



Corner point 1: (0, 50)



Corner point 2: (60, 0)



Corner point 3: (80, 40)

Next, we evaluate the objective function at each corner point: 1. At (0, 50):

P= 50(0) + 60(50) = 3000 2. At (60, 0): P= 50(60) + 60(0) = 3000 3. At (80,

40): P= 50(80) + 60(40) = 6400

Step 5: Conclusion To maximize its profit, the company should produce

80 units of product X and 40 units of product Y per week, yielding a profit of

6400.

Question 28

Question

A company manufactures two types of desks: type A and type B. To produce

one type A desk requires 4 hours of labor and 2 hours of painting, while to

produce one type B desk requires 3 hours of labor and 3 hours of painting. The

company has a total of 80 hours of labor and 60 hours of painting available per

week. If the profit from one type A desk is

200 and the profit from one type

B desk is

150, how many desks of each type should the company manufacture

to maximize their profit?

Solution

Step 1: Define the variables. Let’s denote the number of type A desks produced

by xand the number of type B desks produced by y.

Step 2: Write the objective function. We want to maximize the profit, so

the objective function is P= 200x+ 150y.

Step 3: Write the constraints. The constraints are based on the available

labor and painting hours: - 4x+ 3y≤80 (labor constraint) - 2x+ 3y≤60

(painting constraint) We also have the non-negativity constraints: - x≥0 -

y≥0

Step 4: Set up the linear programming model: Maximize P= 200x+ 150y

Subject to: - 4x+ 3y≤80 - 2x+ 3y≤60 - x≥0 - y≥0

Step 5: Solve the linear program graphically or using a calculator/software

to find the optimal solution. The solution should be the values of xand ythat

maximize the profit function while satisfying all constraints.

Question 29

Question

A company manufactures two types of products, type A and type B. Each unit

of type A requires 4 hours of labor and 2 hours of machine time, while each unit

of type B requires 6 hours of labor and 3 hours of machine time. The company

has a total of 40 hours of labor and 20 hours of machine time available each

week. Type A products are sold for

50 each and type B products are sold

for

60 each. How many units of each type should the company produce to

maximize its revenue?

Solution

Step 1: Define the variables. Let xbe the number of units of type A products

produced and ybe the number of units of type B products produced.

Step 2: Write the constraints based on available labor and machine time.

4x+ 6y≤40 (Labor constraint)

2x+ 3y≤20 (Machine time constraint)

Step 3: Write the objective function to be maximized, which represents the

total revenue. The total revenue Ris given by:

R= 50x+ 60y

Step 4: Convert the problem into standard form by converting the inequal-

ities into equations.

4x+ 6y= 40

2x+ 3y= 20

Step 5: Solve the system of equations to find the critical points. Multiply

the second equation by 2 and subtract it from the first equation:

4x+ 6y= 40

−4x−6y=−40

This simplifies to 0 = 0, indicating that the system has infinitely many solutions.

Step 6: Determine the corner points. The corner points are the intersections

of the lines formed by the constraints:

4x+ 6y= 40 (Labor constraint)

2x+ 3y= 20 (Machine time constraint)

Solving these equations, we find the corner points: (0,20

3), (10,0), and (8,4

3).

Step 7: Evaluate the objective function at each corner point. Substitute the

values of xand yinto the revenue function R= 50x+ 60y:

(0,20

3) : R= 0 + 60 20

3= 400

(10,0) : R= 50(10) + 0 = 500

(8,4

3) : R= 50(8) + 60 4

3= 480

Step 8: Compare the revenues at each corner point to identify the maximum

revenue. The company should produce 10 units of type A products and 0 units

of type B products to maximize its revenue, resulting in a revenue of

500.

Question 30

Question

A company produces two types of products, Product A and Product B. The

profit from each unit of Product A is

8, while the profit from each unit of

Product B is

12. Each unit of Product A requires 2 hours of labor and 1

hour of machine time, while each unit of Product B requires 1 hour of labor

and 3 hours of machine time. The company has a total of 100 hours of labor

available and 90 hours of machine time available each day. How many units of

each product should the company produce to maximize its daily 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 total daily profit, which can be expressed

as:

P= 8x+ 12y

Step 3: Write the constraints.

The constraints are based on the available labor and machine time:

2x+y≤100

x+ 3y≤90

Step 4: Non-negativity constraint.

Since we cannot produce a negative number of products, we also have the

constraints:

x≥0

y≥0

Step 5: Set up the linear programming problem.

The problem can be formulated as:

Maximize P= 8x+ 12y

subject to

2x+y≤100

x+ 3y≤90

x≥0

y≥0

Step 6: Solve the linear programming problem.

By graphing the constraints and finding the feasible region, we can deter-

mine the optimal solution. The corner points of the feasible region are the

intersections of the constraint lines.

Step 7: Calculate the corner points.

The corner points of the feasible region are:

(0,30),(0,0),(45,10),(50,0)

Question 4

Question

A company produces two types of products: Product A and Product B. Product

A sells for

10 per unit and Product B sells for

20 per unit. It costs the company

5 to produce one unit of Product A and

10 to produce one unit of Product B.

The company has a production capacity of 500 units per day. If the company

wants to maximize its profit, how many units of each product should it produce?

Solution

Step 1: Define the variables. Let xbe the number of units of Product A

produced and ybe the number of units of Product B produced.

Step 2: Write the objective function. The profit, P, for the company can be

represented as:

P= 10x+ 20y−(5x+ 10y)

P= 5x+ 10y

Step 3: Write the constraint equation. The production capacity constraint

is given by:

x+y≤500

Step 4: Set up the constraints.

x+y≤500

x≥0, y ≥0

Step 5: Plot the constraints and find the feasible region. Let’s graph the line

x+y= 500. The feasible region will be the area below this line and bounded

by the non-negativity constraints.

Step 6: Calculate the corner points of the feasible region. The corner points

of the feasible region are where the constraints intersect. The corner points of

the feasible region are: 1. (0,0) 2. (0,500) 3. (500,0)

Step 7: Evaluate the objective function at each corner point. For (0,0):

P= 5(0) + 10(0) = 0 For (0,500): P= 5(0) + 10(500) = 5000 For (500,0):

P= 5(500) + 10(0) = 2500

Step 8: Determine the maximum profit. The maximum profit is

5000 when

the company produces 500 units of Product B and 0 units of Product A.

Question 5

Question

A company manufactures two products, A and B. Product A generates a profit of

10 per unit and requires 5 hours of production time, while product B generates

a profit of

15 per unit and requires 7 hours of production time. The company

has a total of 50 hours of production time available each day. How many units

of each product should the company produce in order to maximize profit?

Solution

Step 1: Define the variables. Let xrepresent the number of units of product A to

be produced and yrepresent the number of units of product B to be produced.

Step 2: Write the objective function to maximize profit. The total profit P

can be calculated as

P= 10x+ 15y

Step 3: Write the constraint equation for the production time. The total

production time used by product A and product B must not exceed the total

available production time of 50 hours. Therefore, the constraint equation is

5x+ 7y≤50

Step 4: Determine the feasible region. We need to determine the feasible

region by graphing the inequality constraint. The feasible region will be the

area below the line 5x+ 7y= 50.

Step 5: Find the vertices of the feasible region. The vertices are the points

of intersection of the boundary lines. The vertices of the feasible region will be

the corners of the shaded region after graphing the inequality constraint.

Step 6: Substitute the coordinates of each vertex into the objective function

P= 10x+ 15yto find the profit at each vertex.

Step 7: Identify the vertex that results in the maximum profit. This vertex

represents the optimal solution to the problem.

Step 8: State the optimal solution in the context of the problem. The

company should produce a certain number of units of each product to maximize

profit.

Question 6

Question

A company can choose between two suppliers for its raw materials. Supplier

A offers a rate of

500 per unit with a minimum order quantity of 200 units.

Supplier B offers a rate of

550 per unit with no minimum order quantity. The

company estimates that its annual demand for the raw material is between

200 and 300 units. Determine the range of quantities for which it is more

cost-effective for the company to order from Supplier A, assuming it wants to

minimize its total cost.

Solution

Step 1: Let’s first establish the cost function for each supplier. - For Supplier

A: Cost =

500Q, where Q is the quantity ordered. - For Supplier B: Cost =

550Q, where Q is the quantity ordered.

Step 2: We need to determine the break-even point between the two suppli-

ers. This occurs when the cost from Supplier A equals the cost from Supplier

B. - Set the two cost functions equal to each other:

500Q =

550Q - Solve for

500Q =

550Q -

50Q = 0 Q = 0

Step 3: The break-even point occurs at Q = 0, but since the company must

order at least 200 units from Supplier A, we know that any quantity below 200

will not be cost-effective to order from Supplier A. Now, we need to determine

the highest quantity for which it is still cost-effective to order from Supplier

A. - Substitute Q = 200 into the cost functions for both suppliers. - Cost for

Supplier A:

500(200) =

100,000 - Cost for Supplier B:

550(200) =

110,000

Step 4: Since ordering 200 units from Supplier A costs less than ordering

from Supplier B, the company should order at least 200 units from Supplier

A. Next, we need to determine the maximum quantity for which ordering from

Supplier A remains cost-effective. - Substitute Q = 300 into the cost functions

for both suppliers. - Cost for Supplier A:

500(300) =

150,000 - Cost for

Supplier B:

550(300) =

165,000

Step 5: Since ordering 300 units from Supplier A costs less than ordering

from Supplier B, the company should order at most 300 units from Supplier

A. Therefore, the range of quantities for which it is more cost-effective for the

company to order from Supplier A is between 200 and 300 units.

Question 7

Question

A company manufactures two types of products, Aand B. The production of

Arequires 4 hours of labor and 2 hours of machine time, while the production

of Brequires 3 hours of labor and 3 hours of machine time. The profit per unit

of product Ais

50 and for product Bis

60. The company has a maximum of

120 hours of labor and 90 hours of machine time available per week. 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

Aproduced, and ybe the number of units of product Bproduced.

Step 2: Write the objective function. The total profit Zcan be expressed

as:

Z= 50x+ 60y

Step 3: Write the constraints based on the available labor and machine time.

The constraints are:

4x+ 3y≤120

(labor constraint)

2x+ 3y≤90

(machine time constraint)

Step 4: Write the non-negativity constraint for the decision variables:

x≥0, y ≥0

Step 5: Set up the linear programming model:

Maximize: Z= 50x+ 60y

Subject to: 4x+ 3y≤120

2x+ 3y≤90

x≥0, y ≥0

Step 6: Solve the linear programming model using the graphical method or

any optimization software to find the optimal values of xand ythat maximize

the profit.

Question 8

Question

A company manufactures two types of products, A and B. The profit generated

from each unit of product A is

5, while the profit from each unit of product

B is

8. Each unit of product A requires 2 hours for processing while each

unit of product B requires 3 hours. The company has 120 hours of processing

time available each week. How many units of each product should the company

manufacture in order to maximize its profit?

Solution

Step 1: Define the variables.

Let xbe the number of units of product A to manufacture, and let ybe the

number of units of product B to manufacture.

Step 2: Write the objective function.

The total profit generated can be represented by the objective function:

P(x, y)=5x+ 8y

Step 3: Write the constraint equation.

The constraint is based on the available processing time:

2x+ 3y≤120

Step 4: Determine the feasible region.

Plot the constraint on a graph and shade the region where 2x+ 3y≤120. This

region represents the feasible area where the company can operate given the

constraint.

Step 5: Find the corner points.

The corner points of the feasible region are the intersection points of the con-

straint lines. Calculate the coordinates of these points.

Step 6: Evaluate the objective function at each corner point.

Calculate P(x, y) for each corner point using the objective function P(x, y) =

5x+ 8y.

Step 7: Identify the maximum value.

Determine which corner point yields the maximum profit. This will be the

optimal solution for the company’s manufacturing strategy.

Question 9

Question

A company manufactures two types of products, Aand B, which have the

following production costs: - Product Acosts

10 per unit in raw materials and

5 in labor per unit. - Product Bcosts

15 per unit in raw materials and

7 in

labor per unit.

The company has a maximum budget of

5000 for raw materials and

3000

for labor. Product Asells for

30 per unit and product Bsells for

40 per unit.

How many units of each product should the company produce to maximize

profit?

Solution

Step 1: Define the variables. Let xbe the number of units of product Apro-

duced, and let ybe the number of units of product Bproduced.

Step 2: Write the objective function. The profit function P(x, y) can be

expressed as:

P(x, y) = 30x+ 40y−(10x+ 5y)−(15y+ 7y)

Step 3: Write the constraints. The constraints based on the budget for raw

materials and labor are:

10x+ 15y≤5000

5x+ 7y≤3000

Step 4: Set up the optimization problem. We want to maximize the profit

function P(x, y) subject to the constraints:

P(x, y) = 30x+ 40y−10x−5y−15y−7y

10x+ 15y≤5000

5x+ 7y≤3000

Step 5: Solve the linear programming problem. To solve this problem, we

can use the simplex method or a graph to find the feasible region and the optimal

solution.

Question 10

Question

A company produces two types of products, Product A and Product B. The

company has a total of 800 hours of production time available per week. Each

unit of Product A requires 2 hours of production time and yields a profit of

50,

while each unit of Product B requires 3 hours of production time and yields

a profit of

60. Determine the optimal number of units of each product the

company should produce per week to maximize profit.

Solution

Step 1: Define the variables.

Let xrepresent the number of units of Product A produced per week, and let y

represent the number of units of Product B produced per week.

Step 2: Write the objective function.

The objective is to maximize profit, which is given by Profit = 50x+ 60y.

Step 3: Write the constraint equation.

The constraint is the total production time available per week, which is 800

hours. The production time constraint can be written as: 2x+ 3y≤800.

Step 4: Plot the feasible region.

To graph the constraint, we first graph the line 2x+ 3y= 800 and shade the

region below the line.

Step 5: Determine the corner points of the feasible region.

The corner points of the feasible region are the intersections of the boundary

lines. The corner points are found by solving the system of equations formed

by the boundary lines.

Step 6: Evaluate the objective function at each corner point.

Using the objective function Profit = 50x+ 60y, calculate the profit at each

corner point.

Step 7: Identify the optimal solution.

The optimal solution is the corner point that yields the maximum profit.

Step 8: Interpret the solution.

Interpret the optimal solution in the context of the problem to determine the

number of units of each product the company should produce to maximize profit.