Hi, wondering if anyone might have an idea how to handle this case when it comes to portfolio optimization and how to construct the matrices. Simple case is fine using portfolios = [solvers.qp(mu*P, -q, G, h, A, b)['x'] for mu in mus] where sum(x)=1 and x>=0 but what happens if you have n assets and you set upper and lower bounds. Example, if I have 3 assets and say lower bound is 40% and upper bound is 100%, the optimizer will fail because lower weights on all 3 assets will sum to greater than 1. Therefore, that means, 1 asset must fall out. Only way I can understand this case is optimize on the combinations of 3 assets with same lower bound of 40%. Thus, optimize(0,1) then (0,2) and finally (1,2) and find the combination with lowest stdev if that is your objective but if assets are large this process will be computationally heavy. Each combination can have lower bound of 40% and sum to 1. So, my question, how do you change G, h, A, b so this will work. I think you need to change lower bound <= x <= upper bound to an equality but can not figure this out. Any feedback greatly appreciated. thanks