I've been trying to use this function fmincon to find a minimum value for this function, but its not outputting believable answers. So I've decided to see if its possible to just brute force find a solution.
my input is an array, one by ten x=[x1 x2 x3... x10]
the only possible solutions include the constraint that each progressive element is greater than or equal to the one before it ie x3=>x2=>x1...
so I want to build a matrix with columns being each possible solution. Values for elements can be between 0 and .4 in increments of .01. I cant input zero, so I need to start at .00001.
This set up probably sounds pretty idiotic, but I've given up doing this a reasonable way - if someone could just help me construct the right set up of for loops or whatever, that'd be amazing.
This post has been edited by canopy: 01 May 2009 - 10:11 AM