document.write( "Question 1166337: A company has $14,830 available per month for advertising. Newspaper ads cost $190 each and can't run more than 24 times per month. Radio ads cost $590 each and can't run more than 32 times per month at this price.\r
\n" ); document.write( "\n" ); document.write( "Each newspaper ad reaches 5700 potential customers, and each radio ad reaches 6700 potential customers. The company wants to maximize the number of ad exposures to potential customers.\r
\n" ); document.write( "\n" ); document.write( "Use x for number of Newspaper advertisements and y for number of Radio advertisements.
\n" ); document.write( "

Algebra.Com's Answer #852179 by ikleyn(52776)\"\" \"About 
You can put this solution on YOUR website!
.
\n" ); document.write( "A company has $14,830 available per month for advertising. Newspaper ads cost $190 each and can't run
\n" ); document.write( "more than 24 times per month. Radio ads cost $590 each and can't run more than 32 times per month at this price.
\n" ); document.write( "Each newspaper ad reaches 5700 potential customers, and each radio ad reaches 6700 potential customers.
\n" ); document.write( "The company wants to maximize the number of ad exposures to potential customers.
\n" ); document.write( "Determine the most profitable / (effective) way to do it.
\n" ); document.write( "~~~~~~~~~~~~~~~~~~~~~~~~\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\r\n" );
document.write( "To find the maximum number of ad exposures, let's formulate the problem in terms \r\n" );
document.write( "of objective function and constraints.  \r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "Let x be the number of newspaper ads and y be the number of radio ads. \r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "The objective function is \r\n" );
document.write( "\r\n" );
document.write( "    P = 5700*x + 6700*y.       (1)\r\n" );
document.write( "\r\n" );
document.write( "It is the number of possible expositions, and we want to maximize it.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "The constraints are: \r\n" );
document.write( "\r\n" );
document.write( "    190*x + 590*y ≤ 14830 (the budget),     (2)\r\n" );
document.write( "\r\n" );
document.write( "    x ≤ 24 (newspaper ad limit), y ≤ 32 (radio ad limit),     (3)\r\n" );
document.write( "\r\n" );
document.write( "    x ≥ 0, y ≥ 0 (non-negativity).     (4)\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "Now it is presented as a typical Linear Programming problem. But it can be easily solved MENTALLY\r\n" );
document.write( "using \"the most aggressive\" logical strategy/methodology.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "From expression (1) for the objective function, we see that the contribution of each single newspaper ad\r\n" );
document.write( "(in terms of the number of potential expositions, 5700) is comparable with (or distinct insignificantly from) \r\n" );
document.write( "the contribution of each single radio ad (6700).\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "But each newspaper ad is much cheaper ($190) than each radio ad ($590). So, it is clear that \r\n" );
document.write( "the most profitable strategy is  to make as many newspaper ads as possible (x=24), and then\r\n" );
document.write( "to spend the rest of the budget for the radio ads. \r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "Thus the most effective solution is to make 24 newspaper ads, spending 24*190 = 4560 dollars for it.\r\n" );
document.write( "\r\n" );
document.write( "The rest of the budget is then  $14830 - $4560 = $10270.\r\n" );
document.write( "\r\n" );
document.write( "This amount can be / (should be) spent for radio ads.\r\n" );
document.write( "\r\n" );
document.write( "It provides the number of radio ads  y = \"10270%2F590\" = 17.40678,\r\n" );
document.write( "and we should round this decimal number to the closest lesser integer number, which is y = 17.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "So, the answer to the problem's question is THIS:\r\n" );
document.write( "\r\n" );
document.write( "    24 newspaper ads and 17 radio ads provide the greatest possible number of expositions (~ potential customers),\r\n" );
document.write( "    which is then  5700*24 + 6700*17 = 250700.\r\n" );
document.write( "
\r
\n" ); document.write( "\n" ); document.write( "Solved.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "--------------------------------------\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "

Post-solution note

\r
\n" ); document.write( "\n" ); document.write( "In this concrete problem, the presented method has one important advantage comparing with the traditional form
\n" ); document.write( "geometric solution of Linear Programming problems.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Working in the frame of traditional Linear Programming geometric method, you will get the solution with non-integer decimals,
\n" ); document.write( "so, you will be forced to use other arguments to complete the traditional solution.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Working in the way, presented here in the solution above, you will get the answer in integer numbers without any complications.\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "In other words, this problem is for INTEGER Linear Programming - not for regular Linear Programming.
\n" ); document.write( "But integer Linear Programming problems require their special solution methodology
\n" ); document.write( "(which is not studied in the school Math) and requires special solvers.
\n" ); document.write( "Or, as it is done in my solution above - a special logical treatment.\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "
\n" );