Optimization of Stock Portfolios Using Goal Programming Based on the Kalman-Filter Method

Long-term stock investment development is carried out by means of portfolio optimization. Selection of stocks for portfolios is not only based on high-value stock prices but also takes into account their fluctuations. Estimation of future stock price fluctuations has an indirect impact on future portfolio formation. This research has implemented the Kalman filter method to obtain the best estimation results from various stock prices with a high degree of accuracy. The results are then used to form a stock portfolio on the basis of Goal Programming. This study has compared the optimization results with the real value of stock prices. The results obtained, Kalman filter-based Goal Programming is more effective for predicting future portfolios compared to the Goal Programming method with a return difference of Rp. 178,039,848. This suggests that optimization with the Kalman Filter-based Objective Programming can be used as a tool to determine future stock portfolios

Solving a novel multi-divisional project portfolio selection and scheduling problem

A common problem faced by organizations is how to select and schedule an optimal portfolio of projects subject to various constraints, such as a limited budget. This problem is known as the project portfolio selection and scheduling problem (PPSSP). Despite the widespread nature of this problem, no existing model adequately addresses a sufficient set of characteristics that arise in real-world problems. One contribution of this article is the proposal of a novel, practical class of PPSSP that consists of multiple groups of projects, proposed by different sections of a major organization. The proposed problem can be considered as a generalized PPSSP given that many specific PPSSPs reported in the literature can be generated by relaxing certain constraints. As this is a novel formulation, existing algorithms cannot ensure high-quality solutions to this problem. Thus, a further contribution of this article is the design of three hybrid meta-heuristic algorithms based on a custom-purpose heuristic and local search operator. A case problem, inspired by future force design (FFD) in the Australian Defence Force (ADF), is presented to exemplify the applicability of this model to a real-world problem. Results indicate that the obtained solutions are of acceptable quality for implementation

Portfolio Optimization for Defence Applications

The problem of designing an effective future defense force is quite complex and challenging. One methodology that is often employed in this domain is portfolio optimization, whereby the objective is to select a diverse set of assets that maximize the return on investment. In the defense context, the return on investment is often measured in terms of the capabilities that the investments will provide. While the field of portfolio optimization is well established, applications in the defense sector pose unique challenges not seen in other application domains. However, the literature regarding portfolio optimization for defense applications is rather sparse. To this end, this paper provides a structured review of recent applications and identifies a number of areas that warrant further investigation