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

Linear Programming Examples Assignment 1

This document provides 3 examples of using linear programming to solve optimization problems. The first example involves maximizing profits from producing scientific and graphing calculators given constraints. The second example maximizes storage volume when buying filing cabinets under budget and space constraints. The third example maximizes fundraising profits from making toques and mitts with constraints on materials, production capacity, and demand. All examples demonstrate setting up the optimization equation and constraints to determine the optimal solution.

Uploaded by

Henry
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
253 views

Linear Programming Examples Assignment 1

This document provides 3 examples of using linear programming to solve optimization problems. The first example involves maximizing profits from producing scientific and graphing calculators given constraints. The second example maximizes storage volume when buying filing cabinets under budget and space constraints. The third example maximizes fundraising profits from making toques and mitts with constraints on materials, production capacity, and demand. All examples demonstrate setting up the optimization equation and constraints to determine the optimal solution.

Uploaded by

Henry
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Henry Man

Section 25
Business 104
Sidd
SID: 861100759
Example #1:
A company that makes calculators also produces graphing calculators and
scientific calculators. When making projections for the long term, indicate a
demand expectation of at least eighty graphing calculators and a hundred
scientific calculators daily. Due to the production capacitys limitations, no
more than 170 graphing calculators and 200 scientific calculators can be
created each day. For a shipping contract to be satisfied, at least a total of
200 calculators need to be delivered daily.
If each of the graphing calculators produces a $5 profit but each scientific
calculator results in a loss of $2, how many of each type need to be made
every day for net profits to be maximized?
My variables will need to stand for the optimal number of calculators, since
this is what the question asks for:
x= produced number of scientific calculators
y= produced number of graphing calculators
I will have 2 constraints since they cant produce calculators in negative
numbers:
x>0

and
y>0
This exercise also gives maximums: y < 170 and x < 200. Also, in these
cases, I cant ignore these other constraints, since I already have that
y > 80 and x > 100. The minimum requirement for shipping also gives me
200, x + y, so in other words x + 200 < y. The optimization equation of 2x
+ 5y = R will be my Revenue Relation. So the system is entirely:
R = 2x + 5y, subject to:
y > x + 200
80 < y < 170
100 < x < 200
You should obtain the maximum value of R = 650 at (x, y) = (100, 170)
when you test the corner points at:
(100, 100)
(120, 80
(200, 80)
(200, 170)
and
(100, 170)
Explanation: The application of linear programming within this
example is to find the amount of each type of calculator in order
for them to maximize profits. They begin by setting a variable for
the 2 types of calculator and then finding their constraints.
Afterwards they have their maximization equation and begin
solving for the points for the constraints to find the most optimal
solution. Then after the optimal solution is found, it is used to find

the maximization value. This value allows the company to maximize


their net profits.
Example problem obtained from https://blog.udemy.com/linearprogramming-problems/
Example #2:
Say you need to buy some new filing cabinets. You know that it is $10 per
unit to buy Cabinet X, which holds 8 cubic feet of files and requires floor
space of 6 square feet. On the other hand, it is $20 for every unit of Cabinet
Y which requires floor space of 8 square feet and holds about 5 cubic feet of
files. For this purchase, you have been given $140 but dont really have to
spend all of it. The space in the office only has room for a maximum of
seventy-two square feet of furniture. To maximize the volume of files you can
store, how many of what model do you need to buy?
The variables will then be:
x= cabinet x purchased pieces
y= cabinet y purchased pieces
Where: x > 0 and y > 0
Because I need to consider the space allowed in the office and yet attempt to
maximize volume of storage, the optimization equation will be the volume
and the constraints will be floor space:
Volume:
v = 8x + 12y
Space:
6x + 8y < 72, or y < (3/4) x + 9
Cost:
10x + 20y < 140, or y < (1/2) x + 7
You should obtain a maximal volume of 100 cubic feet by buying eight of
model X and three of model Y when you test the corner points at:
(12, 0)
(0, 7)
and
(8, 3)

Explanation: In this example, there is applications of linear


programming by first identifying the problem and creating variables
for the units. Since they want to figure out how to maximize the
volume of the files you can store, you would need to set up a
maximization equation. After that, they create constraints with nonzero constraints to figure out the optimal solution to the problem.
Using the optimal solution, they are able to find the amount needed
of each model to maximize the volume of files needed.
Example problem obtained from https://blog.udemy.com/linearprogramming-problems/
Example #3:
Your school is planning to make toques and mitts to sell at the winter festival as a
fundraiser. The schools sewing classes divide into two groups one group can make
toques, the other group knows how to make mitts. The sewing teachers are also willing
to help out. Considering the number of people available and time constraints due to
classes, only 150 toques and 120 pairs of mitts can be made each week. Enough
material is delivered to the school every Monday morning to make a total of 200 items
per week. Because the material is being donated by community members, each toque
sold makes a profit of $2 and each pair of mitts sold makes a profit of $5.
In order to make the most money from the fundraiser, how many of each item should be
made each week?
x = the number of toques made weekly
y = the number of pairs of mitts made weekly

x 150
and
y 120

The students can only make up to 150 toques and up to


120 pairs of mitts each week. This is one restriction.

x + y 200

The total number of mitts and toques made each week


cannot exceed 200. This is the material restriction.

We may also want to consider that x 0 and y 0. This means that we cannot make -3
toques.
Our final equation comes from the goal of the problem. We want to maximize the total
profit from the toques and mitts. This can be represented by $2x + $5y = P, where P is
the total profit, since there are no costs in production.
We can see that our feasible region (the green area) has vertices of (0, 120), (150, 0),
(150, 50), and (80, 120). By substituting these values for x and y in our revenue
equation, we can find the optimal solution.

R = 2x + 5y
R = 2(80) + 5(120)
R = $760
After considering all of the options, we can conclude that this is our maximum revenue.
Therefore, the sewing students (and teachers) must make 80 toques and 120 pairs of
mitts each week in order to make the most money. We can check that these solutions
satisfy all of our restrictions:
80 + 120 200. This is true. We know that we will have enough material to make 80
toques and 120 pairs of mitts each week. We can also see that our values
for x and y are less than 150 and 120, respectively.
Explanation: This example is clearly a maximizing revenue problem because
they are using linear programming to find the amount of each items needed in
order to make the most money for their fundraiser. They have x and y for the
variables of each items and then create constraints afterwards to find their
optimal solution. Using the optimal solution they can test if it will give them
the maximum profit by plugging it into their maximization equation 2x + 5y.
Therefore using linear programming allows them to gain the most possible
profits based on the options given to them on how many of each items must
be made weekly.

Example problem obtained from


http://mathcentral.uregina.ca/beyond/articles/LinearProgramming/linearprogram.ht
ml

You might also like