We have $6,000 to invest in three types of financial products. If we invest x, dollars (in thousands of dollars) in the product n, where xn is a non-negative integer, then this investment returns us r, (xn) dollars with: r, (x,) = 7x1 + 2. (x, 2 1) r2(x2) = 3x2 + 7. (x2 2 1) %3D
We have $6,000 to invest in three types of financial products. If we invest x, dollars (in thousands of dollars) in the product n, where xn is a non-negative integer, then this investment returns us r, (xn) dollars with: r, (x,) = 7x1 + 2. (x, 2 1) r2(x2) = 3x2 + 7. (x2 2 1) %3D
Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter3: Functions And Graphs
Section3.2: Graphs Of Equations
Problem 78E
Related questions
Question
1
![Exercise 3:
We have $6,000 to invest in three types of financial products. If we invest x„ dollars (in
thousands of dollars) in the product n, where xn is a non-negative integer, then this
investment returns us r„ (x„) dollars with:
r, (x,) = 7x, + 2. (x, > 1)
r2(x2) = 3x, + 7. (x2 2 1)
r3(x3) = 4x3 + 5. (x3 2 1)
rị (0) = r2 (0) = r3 (0) = 0.
%3D
The objective is obviously to maximize the sum of the returns on the investments. A
mathematical model for this problem could be expressed as follows:
Max r1 (x1) + r2 (x2) + r3 (X3)
her.
X1 + X2+ X3 = 6
X3 2 0 and integers, n = 1, 2, 3.
We decide to tackle this problem using dynamic programming.
a- Specify the steps, states, decision variables, and recurrence formula for this
problem.
b- Solve the problem using dynamic programming. Indicate all the steps of the
resolution process and describe the optimal decision policy(ies) obtained at the
end.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fe5d51032-2953-40c4-b580-e528391e4784%2F881f7c74-026e-4d09-a694-77cef746c84a%2F3l81j99_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Exercise 3:
We have $6,000 to invest in three types of financial products. If we invest x„ dollars (in
thousands of dollars) in the product n, where xn is a non-negative integer, then this
investment returns us r„ (x„) dollars with:
r, (x,) = 7x, + 2. (x, > 1)
r2(x2) = 3x, + 7. (x2 2 1)
r3(x3) = 4x3 + 5. (x3 2 1)
rị (0) = r2 (0) = r3 (0) = 0.
%3D
The objective is obviously to maximize the sum of the returns on the investments. A
mathematical model for this problem could be expressed as follows:
Max r1 (x1) + r2 (x2) + r3 (X3)
her.
X1 + X2+ X3 = 6
X3 2 0 and integers, n = 1, 2, 3.
We decide to tackle this problem using dynamic programming.
a- Specify the steps, states, decision variables, and recurrence formula for this
problem.
b- Solve the problem using dynamic programming. Indicate all the steps of the
resolution process and describe the optimal decision policy(ies) obtained at the
end.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
![Algebra: Structure And Method, Book 1](https://www.bartleby.com/isbn_cover_images/9780395977224/9780395977224_smallCoverImage.gif)
Algebra: Structure And Method, Book 1
Algebra
ISBN:
9780395977224
Author:
Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:
McDougal Littell
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
![Algebra: Structure And Method, Book 1](https://www.bartleby.com/isbn_cover_images/9780395977224/9780395977224_smallCoverImage.gif)
Algebra: Structure And Method, Book 1
Algebra
ISBN:
9780395977224
Author:
Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:
McDougal Littell