Question: i want the code in java { java } please Problem Statement: You work for a prestigious investment firm that manages a large number of
i want the code in java java please
Problem Statement:
You work for a prestigious investment firm that manages a large number of clients portfolios.
Your task is to develop a program that determines the optimal allocation of assets in a given
investment portfolio.
The portfolio consists of N different assets, each with an associated expected return and
risk level. Your program should take as input the expected return and risk of each asset, along
with the total investment amount available. The goal is to find the allocation of assets that
maximizes the portfolios expected return while keeping the risk within a specified tolerance
level.
Your program should solve this problem using two different algorithm paradigms: Brute
Force and Dynamic Programming.
Project Part : Brute Force Approach
Implement a brute force algorithm to exhaustively search all possible asset allocations within
the given investment amount. Evaluate the return and risk of each allocation and find the one
that maximizes the expected return while keeping the risk within the specified tolerance level.
and i will Attach a picture for the sample run Good luck, and remember to adhere to proper programming practices and documentation stan
dards throughout the project.
Sample run:
Input will be in the form of a text file your program should read. The input has the following
format:
IDofasset : Expectedreturn : Risklevel : Quantityunits
Example.txt:
Example :
AAPL : ::
GOOGL : ::
MSFT : ::
Total investment is units
Risk tolerance level is
Example :
AMZN : ::
TSLA : ::
FB : ::
Total Investment is units
Risk Tolerance Level is
Output Sample:
Example : Optimal Allocation:
AAPL: units
GOOGL: units
MSFT: units
Expected Portfolio Return:
Portfolio Risk Level:
Example :
Optimal Allocation:
AMZN: units
TSLA: units
FB: units
Expected Portfolio Return:
Portfolio Risk Level:
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
