Goal Seek VB6 optimum weight for each portfolio element
Required skills: Algorithmic, Engineering, Finance, Statistical Analysis
|
Need a programmer who is competent in numerical methods to write a GoalSeek function to replace calls currently being made to VB6 Rnd function. The task ends when each element of a 1 dimension array of weights>=0<=1 holds the optimum value in each element. I want to minimize the number of iterations needed to close on a solution. Currently existing code can decide when the solution is met. Local minima are possible. I've looked at Levenberg-Marquart but simplex may work. Open to suggestions on this choice. Two dependent variables: risk# and return#. These could possibly be expressed as a single variable like this: try# = return# / risk#. I want to maximize return# value and minimize risk# value. These 2 values can be passed to your routine on each iteration. Your routine will offer a new array of suggested values each in the range 0 to 1, one weight for each array element. Alternatively it may be necessary to call your routine once for each element in the array so as to evaluate each change at the global level. |
Posted In:Engineering |
Related projects:
2 Rewrites for Each Original-Hired Rewriters to Start NOW!
hesitate to bid.
