Math 1010 Linear Programming Project-Form B
Math 1010 Linear Programming Project-Form B
Math 1010 Linear Programming Project-Form B
Frederick Litchard
Course: MATH-1010
Section 408-Sp15
1750x +2500y
6. On your own paper perform the computations necessary to construct the graph. When
you have completed the computations, scan them and insert them after this page in to
page(s) of this document. If you need more than one page to complete your calculations,
use only one side of a clean sheet of paper for each page and insert each page you create
into its own document page.
7. After you have completed step 6, list the points necessary to construct the graph. Three of
these points will be the vertices of the feasible region. Using the equation editor, enter the
three vertices here.
( 20, 40 ) ,
y
90 8.
80
To solve this problem, you will need to graph the intersection of all five inequalities on
one common XY plane.
Optimization to maximize the viewing of a combination of radio and TV adds
70
60
(8,52)
50
(24,48)
40
(20,40)
30
x + y 60
linear inequality for the total number of desired ads.
20
y 2x
twice as many radio ads as TV ads
10
-10
-5
-10
10
15
20
25
30
35
40
45
50
55
60
65
70
9. To find which number of radio and TV ads will maximize the number of people who are exposed to
the business advertisements, evaluate the objective function P for each of the vertices you found.
Show your work. Do these calculations by hand and insert them on this page. These calculations
should be relatively simple and take up little space. You will need to crop your scan so that it fits in
the space below
10. Write a complete sentence describing how many of each type of advertisement should be
purchased and what is the maximum number of people who will be exposed to the ad.
The purchase of 24 radio ads at the price of $1750 each, plus 48 TV ads at the price of $2500
each would maximize the advertising budget by reaching approximately 162,000 people.