9.3 THE SIMPLEX METHOD: MAXIMIZATION
9.3 THE SIMPLEX METHOD: MAXIMIZATION
9.3 THE SIMPLEX METHOD: MAXIMIZATION
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
TABLE 9.2<br />
Television Newspaper Radio<br />
Cost per advertisement $ 2,000 $ 600<br />
$ 300<br />
Audience per advertisement 100,000 40,000 18,000<br />
The local newspaper limits the number of weekly advertisements from a single company to<br />
ten. Moreover, in order to balance the advertising among the three types of media, no more<br />
than half of the total number of advertisements should occur on the radio, and at least 10%<br />
should occur on television. The weekly advertising budget is $18,200. How many advertisements<br />
should be run in each of the three types of media to maximize the total audience?<br />
Solution To begin, we let x1 , x2 , and x3 represent the number of advertisements in television, newspaper,<br />
and radio, respectively. The objective function (to be maximized) is therefore<br />
z 100,000x 1 40,000x 2 18,000x 3<br />
Objective function<br />
where x1 0, x2 0, and x3 0. The constraints for this problem are as follows.<br />
2000x 1 600x 2 300x 3 18,200<br />
2000x 1 600x 2 300x 3 10<br />
2000x 1 600x 2 300x 3 0.5x 1 x 2 x 3 <br />
2000x 1 600x 2 300x 3 0.1x 1 x 2 x 3 <br />
A more manageable form of this system of constraints is as follows.<br />
20x1 6x2 3x3 182<br />
20x1 6x2 3x3 110<br />
x1 6x2 3x3 180<br />
9x1 6x2 3x3 180 } Constraints<br />
Thus, the initial simplex tableau is as follows.<br />
100,000<br />
↑<br />
Entering<br />
Basic<br />
x 1 x 2 x 3 s 1 s 2 s 3 s 4 b Variables<br />
20 6 3 1 0 0 0 182 s 1 ← Departing<br />
0 1 0 0 1 0 0 10 s2 1 1 1 0 0 1 0 0 s3 9 1 1 0 0 0 1 0 s4 40,000<br />
SECTION <strong>9.3</strong> <strong>THE</strong> <strong>SIMPLEX</strong> <strong>METHOD</strong>: <strong>MAXIMIZATION</strong> 505<br />
18,000<br />
0 0 0 0 0