April 7th, 2011, 9:00 pm
If the number of possible sets L of long weights is not too outrageous, you couldstep through them one by one. For each, caclulate your objective function usingx(i) > 0; i in Lsum(i in L) x(i) < 1which meets your criteria. Then, one of these sets L* had the best objective value, so that set is the answer. For example, for N securities, I believe there are 2^N such sets to test. Also, inspection of the problem,perhaps after trying a few sets, might reduce the number of candidates considerably.
Last edited by
Alan on April 6th, 2011, 10:00 pm, edited 1 time in total.