Computation of mean-semivariance efficient sets by the Critical Line Algorithm
Annals of Operations Research
Computational study of a family of mixed-integer quadratic programming problems
Mathematical Programming: Series A and B
Project portfolio selection through decision support
Decision Support Systems
Heuristics for cardinality constrained portfolio optimisation
Computers and Operations Research
A relational model of data for large shared data banks
Communications of the ACM
A computer system for transformational grammar
Communications of the ACM
A framework of web-based decision support systems for portfolio selection with OLAP and PVM
Decision Support Systems
Hi-index | 0.00 |
This paper presents a novel use of SQL language to solve a practical optimization problem to find the portfolio size and the quantity of money for securities. This problem is known as the Portfolio Selection Problem (PSP). The approach was tested on 9 random instances of PSP. Each instance has up to 12 securities and 50 different choices of money. Each security follows a non-linear profit model. The limitations of our approach are bounded by the computer resources, given that potentially SQL constructs the Cartesian product of the investment options, but it has the advantages of not requiring complex structures and it is easy to understand.