A Robust Knapsack Based Constrained Portfolio Optimization

Many portfolio optimization problems deal with allocation of assets which carry a relatively high market price. therefore, it is necessary to determine the integer value of assets when we deal with portfolio optimization. in addition, one of the main concerns with most portfolio optimization is associated with the type of constraints considered in different models. in many cases, the resulted problem formulations do not yield in practical solutions. therefore, it is necessary to apply some managerial decisions in order to make the results more practical. this paper presents a portfolio optimization based on an improved knapsack problem with the cardinality, floor and ceiling, budget, class, class limit and pre-assignment constraints for asset allocation. to handle the uncertainty associated with different parameters of the proposed model, we use robust optimization techniques. the model is also applied using some realistic data from us stock market. genetic algorithm is also provided to solve the problem for some instances