User Account

All Pages

Design algorithm that plans your optimal investment strategy

Assignment Help Data Structure & Algorithms
Reference no: EM13688119

Planning an investment strategy your knowledge of algorithms helps you obtain an exciting job with the acme computer company, along with a $10,000 signing bonus. you decide to invest this money with the goal of maximizing your return at the end of 10 years. you decide to use the amalgamated investment company to manage your investments. amalgamated investments requires you to observe the following rules. it offers n different investments, numbered 1 through n. in each year j , investment i provides a return rate of rij . in other words, if you invest d dollars in investment i in year j , then at the end of year j , you have drij dollars. the return rates are guaranteed, that is, you are given all the return rates for the next 10 years for each investment. you make investment decisions only once per year. at the end of each year, you can leave the money made in the previous year in the same investments, or you can shift money to other investments, by either shifting money between existing investments or moving money to a new investement. if you do not move your money between two consecutive years, you pay a fee of f1 dollars, whereas if you switch your money, you pay a fee of f2 dollars, where f2 gt f1.

a. the problem, as stated, allows you to invest your money inmultiple investments in each year. prove that there exists an optimal investment strategy that, in each year, puts all the money into a single investment. (recall that an optimal investment strategy maximizes the amount of money after 10 years and is not concerned with any other objectives, such as minimizing risk.)

b. prove that the problem of planning your optimal investment strategy exhibits optimal substructure.

c. design an algorithm that plans your optimal investment strategy. what is the running time of your algorithm?

d. suppose that amalgamated investments imposed the additional restriction that, at any point, you can have no more than $15,000 in any one investment. show that the problem of maximizing your income at the end of 10 years no longer exhibits optimal substructure.

Reference no: EM13688119

Questions Cloud

Carefully labeling slopes and intercepts : Carefully labeling slopes and intercepts
Value of firm t : Value of Firm T
Mashups in education : Mashups are basically the combination of two or more traditionally unrelated subjects which allow a pupil to use their right brain to arrive at a more creative conclusion than more commonly found methods.
Describe the pre-socratic philosophic tradition : How would we best describe the pre-Socratic philosophic tradition as related to metaphysical speculation in the thought of Thales of Miletus, Leucippus, and Democitus.
Design algorithm that plans your optimal investment strategy : Prove that the problem of planning your optimal investment strategy exhibits optimal substructure and design an algorithm that plans your optimal investment strategy. what is the running time of your algorithm?
What is the cell potential at 25 degrees c : What is the cell potential at 25 degrees C?
The oxidation state for an element : The oxidation state for an element that loses 3 electrons?
New hrm approaches might affect staff management : Explain how the revised and/or new HRM approaches might affect staff management's function/role. How might the revised and/or new HRM approaches affect how they manage and/or communicate with their staff - Review the Unit Introduction and the Learn..
How many mass does cuso4 needs : How many mass does CuSO4 needs

Reviews

Write a Review

Data Structure & Algorithms Questions & Answers

  Virtualization & memory

Evaluate the efficiency and reliability of both the most common nonpreemptive dispatch algorithms and the most common preemptive dispatch algorithms used for scheduling decisions. Provide one (1) example of the best use for each dispatch algorithm..

  Design a control unit for simple hand held video game

Create a control unit for a simple hand held video game in which a character on the display catches objects. Only demonstrate the transition diagram

  Creating two arrays of integers

Prepare two arrays of integers, each holding 10-elements of data. Make a third array of integers for a result array. The main program will take the 2-arrays of integers and pass them to the function subtract().

  What is the minimum number of attendants

A nursing home employs attendants who are needed around the clock. Each attendant is paid the same, regardless of when his or her shift begins. Each shift is 8 consecutive hours.

  Explain the different usability data-gathering techniques

Demonstrate the ability to select an appropriate user interface interaction style for a particular task and explain the different usability data-gathering techniques

  Create algorithm to read file of employee records

Create the algorithm which will read the file of employee records and produce the weekly report of gross earnings for those employees.

  Inventory tracking database

Construct a relational database of your choice. The DB should contain no more than six tables. Define three business requirements that this database will provide.

  Determine the transmission rate

Assume two TCP connections are available over some bottleneck link of rate R bps. Both connections have a huge document to send in the similar direction over the bottleneck link

  Pseudocode for divide-and-conquer algorithm

Write a pseudocode for a divide-and-conquer algorithm for finding the position of the largest element in an array of n numbers.

  1 describe the jsp life cycledraw a diagram of the various

1. describe the jsp life cycle.draw a diagram of the various events and transformations.for each part of the cycle

  Algorithm to keep track of sufficient information

Your algorithm must keep track of sufficient information so that, for any computer Cb it is possible to retrieve in O(n) time a sequence of communications by which Cb could have become infected.

  Explain eager decision tree algorithm-lazy knn algorithm

Discuss the advantages and disadvantages of the new algorithm compared with the eager decision tree algorithm, and the advantages and disadvantages of the new algorithm compared with the lazy kNN algorithm.

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

Submit Assignment

Academics

Major Subjects

Majors

Get In Touch

whatsapp: +1-415-670-9521

Phone: +1-415-670-9521

Email: [email protected]

TERMS & POLICIES

HELP & SUPPORT

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd