• June 6th 2009, 12:15 PM
NonMathEmatical
Hi all,

can someone help me with the following problem?

• June 6th 2009, 01:33 PM
CaptainBlack
Quote:

Originally Posted by NonMathEmatical
Hi all,

can someone help me with the following problem?

Start by introducing variables for the number of minutes of morning (M), afternoon (A) and prime (P) time adverising.

Now translate the conditions in the question into constraints in terms of M, A, and P.

Now express the objective in terms of M, A and P.

When you have done that we can discuss finding the optimum.

CB
• June 7th 2009, 12:05 AM
aidan
Quote:

Originally Posted by NonMathEmatical
Hi all,

can someone help me with the following problem?

This is one of the word problems that confuse me.
Are the 100,000 afternoon viewers different each day or is it the same group each day?

Does "maximize exposure" mean the greatest number of viewers or the greatest number of different viewers.

If possible $\frac{102000}{3000} = 34$ minutes of advertising time.
34 * 100000 = 3,400,000
Are you reaching 3.4 million viewers or are you getting the message to 100 thousand viewers 34 times?

You tell a group/audience something 100 times.
Does that have the same result as telling 100 groups/audience something one time?

It just seems that the you have the same group for each time slot each day,
so you'd want to hit each time slot with the same number of exposures.
• June 7th 2009, 01:04 AM
CaptainBlack
Quote:

Originally Posted by aidan
This is one of the word problems that confuse me.
Are the 100,000 afternoon viewers different each day or is it the same group each day?

It does not matter, they are already multiply counted, advertising only cares about viewer minutes, so one viewer watching the same pitch for 1000 minutes and 1000 viewers watching each for 1 minute is all the same to the advertiser.

(Don't think too much about the details of the problem and how realistic they are, this is a word problem and no great knowledge of the apparent domain is required of the problem setter. That is the background to the problem presented here is all rubbish, its purpose is to get you to formulate a LP problem from all the background noise).

RonL
• June 7th 2009, 01:05 AM
CaptainBlack
Quote:

Originally Posted by aidan
This is one of the word problems that confuse me.
Are the 100,000 afternoon viewers different each day or is it the same group each day?

Does "maximize exposure" mean the greatest number of viewers or the greatest number of different viewers.

It just means maximise the viewer minutes (that is the sum of the viewers times minutes for each of the slots)

CB
• June 7th 2009, 02:08 AM
NonMathEmatical
Thank you CaptainBlack but believe me I didn’t get even the tips above. I didn’t study math from 6 years and even the simplest calculations make me sick. Those and one more (posted on the forum) problem is my last homework. I know that the people directly asking for the solution are not highly appreciated but for me dealing with nuclear reactors seem easier in front of mathematics :)

aidan what to say, I even can’t solve it (Lipssealed)
• June 7th 2009, 02:41 AM
CaptainBlack
Quote:

Originally Posted by NonMathEmatical
Thank you CaptainBlack but believe me I didn’t get even the tips above. I didn’t study math from 6 years and even the simplest calculations make me sick. Those and one more (posted on the forum) problem is my last homework. I know that the people directly asking for the solution are not highly appreciated but for me dealing with nuclear reactors seem easier in front of mathematics :)

aidan what to say, I even can’t solve it (Lipssealed)

If you can't deal with this sort of maths you are not safe to be let lose with a nuclear reactor

CB
• June 7th 2009, 02:54 AM
NonMathEmatical
And this is true :)
• June 7th 2009, 12:45 PM
NonMathEmatical
O.K, so I ended up with an linear programing problem. If there is anyone who is willing to help me please contact me with an PM as I am not comfortable to post my genial writings here (Rofl)
• June 8th 2009, 11:18 AM
NonMathEmatical