Global optimisation of a portfolio adjustment problem under credibility measures
by Andreas Lundell; Kaj-Mikael Björk
International Journal of Operational Research (IJOR), Vol. 25, No. 4, 2016

Abstract: In this paper it is shown how to find the guaranteed ε-optimal solution to the credibilistic portfolio adjustment problem in the formulation presented by Zhang et al. (2010). In its crisp form, the problem is a non-convex signomial programming problem. This type of problem is difficult to solve to global optimality and solving it using a non-global solver may give suboptimal solutions. Using the signomial global optimisation (SGO) algorithm, it is however possible to reformulate the problem into a convex problem whose feasible region overestimates that of the non-convex problem in an extended variable space. The overestimation is iteratively reduced until the global solution is found. To illustrate the procedure, the SGO algorithm is applied to the example in the original article. It is shown that the solutions presented were only local ones, and the global solution corresponding to better portfolio adjustment strategies is given.

Online publication date: Thu, 10-Mar-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email