Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
149 views

Math 1010 Project 2 For E-Portfolio

This document describes a linear programming problem to optimize production for a skateboard company. The company manufactures two types of skateboards requiring different amounts of labor. The objective is to maximize weekly profit given constraints on labor hours and non-negative production. The problem is modeled with variables, constraints, and an objective function. Graphing the feasible region shows the optimal solution occurs at a corner point, found to be 60 entry-level and 48 high-performance boards for a maximum weekly profit of $3,576.

Uploaded by

api-272560483
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
149 views

Math 1010 Project 2 For E-Portfolio

This document describes a linear programming problem to optimize production for a skateboard company. The company manufactures two types of skateboards requiring different amounts of labor. The objective is to maximize weekly profit given constraints on labor hours and non-negative production. The problem is modeled with variables, constraints, and an objective function. Graphing the feasible region shows the optimal solution occurs at a corner point, found to be 60 entry-level and 48 high-performance boards for a maximum weekly profit of $3,576.

Uploaded by

api-272560483
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Optimizing Production of Skateboards

Math 1010 Intermediate Algebra Group Project


Background Information:
Linear Programming is a technique used for optimization of a real-world situation. Examples of
optimization include maximizing the number of items that can be manufactured or minimizing
the cost of production. The equation that represents the quantity to be optimized is called the
objective function, since the objective of the process is to optimize the value. In this project the
objective is to maximize the number of people who will be reached by an advertising campaign.
The objective is subject to limitations or constraints that are represented by inequalities.
Limitations on the number of items that can be produced, the number of hours that workers are
available, and the amount of land a farmer has for crops are examples of constraints that can be
represented using inequalities. Broadcasting an infinite number of advertisements is not a
realistic goal. In this project one of the constraints will be based on an advertising budget.
Graphing the system of inequalities based on the constraints provides a visual representation of
the possible solutions to the problem. If the graph is a closed region, it can be shown that the
values that optimize the objective function will occur at one of the "corners" of the region.
The Problem:
In this project your group will solve the following situation:
A small skateboard company manufactures two types of skateboards- an entry-level model and a
high-performance model. Each type of board requires different amounts of labor to produce.
The entry-level model requires 2 hours for the cutting and laminating process and an additional 2
hours for the finishing process. Whereas the high-performance model requires 2.5 hours for the
cutting and laminating process and an additional 4 hours for the finishing process.
The cutting and laminating employees are only available for at most 240 hours per week, and the
finishing employees are available for at most 312 hours per week. The profit on the entry-level
model is $26 and the profit on the high-performance model is $42. Determine how many of each
type of board should be manufactured, per week, to maximize profit. Assume the company can
sell all the skateboards it produces. What is the maximum weekly profit?

Modeling the Problem:


Let X be the number of entry-level boards that are manufactured and Y be the number highperformance boards.
1. Write down a linear inequality for the total number of hours per week spent in the cutting
and laminating process.
2 x +2.5 y 240 hours

2. Write down a linear inequality for the total number of hours per week spent in the
finishing process.
2 x + 4 y 312 hours

3. There are two more constraints that must be met. These relate to the fact that there
cannot be a negative numbers of skateboards manufactured. Write the two inequalities
that model these constraints:
x 0, y 0

4. Next, write down the function representing the total profit for selling the skate boards.
This is the Objective Function for the problem.

P 26 x+ 42 y

You now have four linear inequalities and an objective function. These together describe the
situation. This combined set of inequalities and objective function make up what is known
mathematically as a linear programming problem. Write all of the inequalities and the
objective function together below. This is typically written as a list of constraints, with the
objective function last.
2 x +2.5 y 240 hours
2 x + 4 y 312 hours

x0

y0
P=26 x +42 y

5. To solve this problem, you will need to graph the intersection of all four inequalities

on one common XY plane. Using graphing technology cut-and-paste the graph into the
space below. Make sure you use the technology to shade the intersection of the system of
inequalities. When doing so, think about the appropriate scale on the X- and Y-axes to
generate a good display of the graph.

y0

2x+2.5y240

(0,78)

(60,48)
2x+4y312

x0
(0,0)

(120,0)

6. The shaded region in the above graph is called the feasible region. Any (X, Y) point in the region
corresponds to a possible number of entry-level boards and high-performance boards that will
meet all the requirements of the problem. However, the values that will maximize the profit will
occur at one of the vertices or corners of the region. Find the coordinates of these corners by
solving the appropriate system of linear equations. Be sure to show your work and label the
coordinates of the corner points on your graph.

2 x +2.5 y=240 2.5 y=2 x +240 y =0.8 x +96


2 x + 4 y=312 4 y=2 x+312 y=0.5 x+78

0.8 x +96=0.5 x+78 18=0.3 x x=60


y=0.5 ( 60 ) +78 y =48
when y=0, 0=0.8 x +96 96=0.8 x x=120
when x=0, y=0.5 ( 0 ) +78 y =78
coordinates of corner points : ( 0,0 ) , ( 0,78 ) , ( 120,0 ) , ( 60,48 )

7. To find the number of entry-level and high-performance skateboards that should be manufactured to
maximize the companys profit, evaluate the objective function P for each of the vertices you found.
Show your work.

P=26 x +42 y

for ( 0,0 ) : P=26 0+ 42 0 P=0

for (120,0 ) : P=26 120+ 42 0 P=3120

for ( 0,78 ) : P=26 0+ 42 78 P=3276

for ( 60,48 ) : P=26 60+ 42 48 P=3576

8. Write a sentence describing how many of each type of skateboard should be manufactured and
how much profit will be made.
The skateboard company needs to make 60 entry-level skateboards and 48 highperformance skateboards to maximize profit at $3,576 per week

9. Reflective Writing.

Give some other examples of real-life optimization problems that could be solved using
linear programming.(Hint: see the exercise set for section 4.5 in your text.) Describe why
it would be important to understand the relationship between the individual constraints

and the vertices of the graph of the feasible region. Did this project change the way you
think about how algebra can be applied to the real world? State what ideas changed and
why. If this project did not change the way you think, write how this project gave further
evidence to support your existing opinion about applying algebra. Be specific.
There are a number of real world problems that can be solved using linear
programming. Some examples include; minimizing transportation costs, maximizing test
scores, it can also be used to solve investing problems to ensure maximum interest among
many other real world applications. It is important to understand the relationship between
the individual constraints and the vertices of the graph of the feasible region because we
need to know our constraints to obtain a feasible region, which is a shaded area that
satisfies the constraints, then we need to find the vertices, the objective function at each
vertex gives us the maximum and minimum of that function. I think I always knew that
math was used in the real world but its neat to now understand how everyday problems
are being solved with algebra.

You might also like