Explore BrainMass
Share

# Dynamic Programming Problem

This content was STOLEN from BrainMass.com - View the original, and get the already-completed solution here!

A company is planning its advertising strategy for next year for its three major products. Since the three products are quite different, each advertising effort will focus on a single product. In units of millions of dollars, a total of 6 is available for advertising next year, where the advertising expenditure for each product must be an integer greater than or equal to 1. The vice-president for marketing has established the objective: Determine how much to spend on each product in order to maximize total sales. The following table gives the estimated increase in sales (in appropriate units) for the different advertising expenditures.

1 2 3
1 7 4 6
2 10 8 9
3 14 11 13
4 17 14 15

See attached file for full problem description.

Use dynamic programming to solve this problem.

https://brainmass.com/math/optimization/dynamic-programming-problem-110714

#### Solution Preview

Let's break the problem into three stages: each stage represents the money allocated to a single product. So stage 1 represents the money allocated to product 1, stage 2 the money to product 2, and stage 3 the money to product 3. We will artificially place an ordering on the stages, saying that we will first allocate to product 1, then product 2, then product 3.
Each stage is divided into states. A state encompasses the information required to go from one stage to the next. In this case the ...

\$2.19
Similar Posting

## Water allocation problem using Dynamic Programming

Please solve the attached problem using Dynamic Programming method.

Consider water supply for a region consisting of three cities. The total available water supply is 8 units. Determine the optimal allocation of water to the three cities that maximizes the total economic return for the region. The relationship between the economic return and the quantity of water allocated for each city are given in the following table:

City
1 2 3
q r1(q) r2(q) r3(q)
0 0 0 0
1 6 5 7
2 12 14 30
3 35 40 42
4 75 55 50
5 85 65 60
6 91 70 70
7 96 75 72
8 100 80 75

View Full Posting Details