Question

An ad campaign for a new snack chip will be conducted in a limited geographical area and can use TV time, radio time, and newspaper ads. Information about each medium is shown below. Medium Cost Per Ad # Reached Exposure Quality TV 600 10000 30 Radio 300 3000 40 Newspaper 500 5000 25 If the number of TV ads cannot exceed the number of radio ads by more than 10, and if the advertising budget is $15,000, develop the model that will maximize the number reached and achieve an exposure quality of at least 1200. Let T= the number of TV ads Let R= the number of radio ads Let N = the number of newspaper ads The exposure quality constraint is given by:________. 95T > 1200 30T + 40R + 25N > 1000 10,000T + 3,000R + 5,000N > 10,000 30T + 40R+ 25N > 1200

Answer 1

The exposure quality constraint is given by the inequality: 30T + 40R + 25N > 1200. This ensures that the overall exposure quality meets the minimum requirement.

Step-by-step explanation:

The exposure quality constraint is given by the inequality:

30T + 40R + 25N > 1200

This means that the sum of the products of the number of TV ads and their exposure quality, the number of radio ads and their exposure quality, and the number of newspaper ads and their exposure quality must be greater than 1200. This constraint ensures that the overall exposure quality meets the minimum requirement.

Answer 2

The exposure quality constraint for an advertising campaign is represented by the inequality 30T + 40R + 25N >= 1200, where T, R, and N are the numbers of TV ads, radio ads, and newspaper ads, respectively.

Step-by-step explanation:

The student is tasked with developing a model to maximize the number of people reached through an advertising campaign within a $15,000 budget, while also ensuring an exposure quality of at least 1200. The exposure quality constraint for TV ads (T), radio ads (R), and newspaper ads (N) is 30T + 40R + 25N >= 1200.

The budget constraint is:

• 600T + 300R + 500N <= 15000

Additionally, the number of TV ads cannot exceed the number of radio ads by more than 10:

• T <= R + 10

This problem is a form of linear programming where decision variables and constraints have linear relationships.