Problem

Set up the initial simplex tableau that could be used to solve the following problem by the simplex method. The Fancy Fashions, an independent, local boutique, has $\$ 9000$ available each month for advertising. Newspaper ads cost $\$ 500$ each, and no more than 30 can run per month. Internet banner ads cost $\$ 20$ each, and no more than 60 can run per month. TV ads cost $\$ 2000$ each, with a maximum of 15 available each month. Approximately 5000 women will see each newspaper ad, 3000 will see each Internet banner, and 11,000 will see each TV ad. How much of each type of advertising should be used if the store wants to maximize its ad exposure?
Let $x_{1}=$ the number of newspaper ads. Let $x_{2}=$ the number of Internet banner ads. Let $x_{3}=$ the number of TV ads. Complete the initial simplex tableau below.

Answer

Expert–verified
Hide Steps
Answer

Set up the initial simplex tableau: The initial simplex tableau is as follows: \[\begin{array}{cccccccc} & x_{1} & x_{2} & x_{3} & s_{1} & s_{2} & s_{3} & s_{4} & \text{RHS} \\ z & -5000 & -3000 & -11000 & 0 & 0 & 0 & 0 & 0 \\ s_{1} & 500 & 20 & 2000 & 1 & 0 & 0 & 0 & 9000 \\ s_{2} & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 30 \\ s_{3} & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 60 \\ s_{4} & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 15 \\ \end{array}\]

Steps

Step 1 :Define the variables: Let \(x_{1}\) be the number of newspaper ads, \(x_{2}\) be the number of Internet banner ads, and \(x_{3}\) be the number of TV ads.

Step 2 :Set up the objective function: The objective function is \(5000x_{1} + 3000x_{2} + 11000x_{3}\), which we want to maximize.

Step 3 :Set up the constraints: The constraints are \(500x_{1} + 20x_{2} + 2000x_{3} \leq 9000\) (budget constraint), \(x_{1} \leq 30\) (newspaper ad constraint), \(x_{2} \leq 60\) (Internet banner ad constraint), and \(x_{3} \leq 15\) (TV ad constraint).

Step 4 :Set up the initial simplex tableau: The initial simplex tableau is as follows: \[\begin{array}{cccccccc} & x_{1} & x_{2} & x_{3} & s_{1} & s_{2} & s_{3} & s_{4} & \text{RHS} \\ z & -5000 & -3000 & -11000 & 0 & 0 & 0 & 0 & 0 \\ s_{1} & 500 & 20 & 2000 & 1 & 0 & 0 & 0 & 9000 \\ s_{2} & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 30 \\ s_{3} & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 60 \\ s_{4} & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 15 \\ \end{array}\]

link_gpt